./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 17:40:51,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 17:40:51,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 17:40:51,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 17:40:51,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 17:40:51,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 17:40:51,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 17:40:51,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 17:40:51,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 17:40:51,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 17:40:51,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 17:40:51,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 17:40:51,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 17:40:51,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 17:40:51,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 17:40:51,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 17:40:51,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 17:40:51,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 17:40:51,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 17:40:51,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 17:40:51,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 17:40:51,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 17:40:51,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 17:40:51,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 17:40:51,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 17:40:51,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 17:40:51,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 17:40:51,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 17:40:51,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 17:40:51,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 17:40:51,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 17:40:51,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 17:40:51,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 17:40:51,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 17:40:51,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 17:40:51,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 17:40:51,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 17:40:51,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 17:40:51,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 17:40:51,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 17:40:51,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 17:40:51,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-21 17:40:51,185 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 17:40:51,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 17:40:51,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 17:40:51,186 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 17:40:51,186 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 17:40:51,186 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 17:40:51,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 17:40:51,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 17:40:51,187 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 17:40:51,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 17:40:51,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 17:40:51,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 17:40:51,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 17:40:51,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 17:40:51,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 17:40:51,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 17:40:51,194 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 17:40:51,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 17:40:51,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 17:40:51,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 17:40:51,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 17:40:51,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 17:40:51,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 17:40:51,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 17:40:51,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 17:40:51,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 17:40:51,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 17:40:51,196 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 17:40:51,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 17:40:51,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 17:40:51,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 17:40:51,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c [2021-12-21 17:40:51,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 17:40:51,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 17:40:51,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 17:40:51,426 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 17:40:51,426 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 17:40:51,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-12-21 17:40:51,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc40342c/2333a71d08ca42fa9c4572588866e773/FLAG35ada5768 [2021-12-21 17:40:52,140 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 17:40:52,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-12-21 17:40:52,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc40342c/2333a71d08ca42fa9c4572588866e773/FLAG35ada5768 [2021-12-21 17:40:52,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc40342c/2333a71d08ca42fa9c4572588866e773 [2021-12-21 17:40:52,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 17:40:52,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 17:40:52,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 17:40:52,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 17:40:52,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 17:40:52,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:40:52" (1/1) ... [2021-12-21 17:40:52,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714b6635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:52, skipping insertion in model container [2021-12-21 17:40:52,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:40:52" (1/1) ... [2021-12-21 17:40:52,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 17:40:52,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 17:40:55,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-12-21 17:40:55,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-12-21 17:40:55,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-12-21 17:40:55,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-12-21 17:40:55,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-12-21 17:40:55,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-12-21 17:40:55,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-12-21 17:40:55,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-12-21 17:40:55,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-12-21 17:40:55,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-12-21 17:40:55,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-12-21 17:40:55,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-12-21 17:40:55,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-12-21 17:40:55,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-12-21 17:40:55,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-12-21 17:40:55,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-12-21 17:40:55,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-12-21 17:40:55,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-12-21 17:40:55,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-12-21 17:40:55,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-12-21 17:40:55,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-12-21 17:40:55,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-12-21 17:40:55,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-12-21 17:40:55,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-12-21 17:40:55,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-12-21 17:40:55,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-12-21 17:40:55,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-12-21 17:40:55,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-12-21 17:40:55,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-12-21 17:40:55,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-12-21 17:40:55,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-12-21 17:40:55,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-12-21 17:40:55,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-12-21 17:40:55,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-12-21 17:40:55,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-12-21 17:40:55,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-12-21 17:40:55,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-12-21 17:40:55,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-12-21 17:40:55,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-12-21 17:40:55,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-12-21 17:40:55,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-12-21 17:40:55,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-12-21 17:40:55,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-12-21 17:40:55,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-12-21 17:40:55,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-12-21 17:40:55,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-12-21 17:40:55,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-12-21 17:40:55,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-12-21 17:40:55,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-12-21 17:40:55,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-12-21 17:40:55,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-12-21 17:40:55,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-12-21 17:40:55,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-12-21 17:40:55,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-12-21 17:40:55,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-12-21 17:40:55,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-12-21 17:40:55,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-12-21 17:40:55,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-12-21 17:40:55,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-12-21 17:40:55,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-12-21 17:40:55,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-12-21 17:40:55,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-12-21 17:40:55,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-12-21 17:40:55,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-12-21 17:40:55,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-12-21 17:40:55,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-12-21 17:40:55,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-12-21 17:40:55,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-12-21 17:40:55,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-12-21 17:40:55,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-12-21 17:40:55,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-12-21 17:40:55,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-12-21 17:40:55,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-12-21 17:40:55,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-12-21 17:40:55,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-12-21 17:40:55,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-12-21 17:40:55,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-12-21 17:40:55,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-12-21 17:40:55,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-12-21 17:40:55,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-12-21 17:40:55,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-12-21 17:40:55,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-12-21 17:40:55,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-12-21 17:40:55,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-12-21 17:40:55,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-12-21 17:40:55,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-12-21 17:40:55,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-12-21 17:40:55,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-12-21 17:40:55,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 17:40:55,317 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 17:40:55,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-12-21 17:40:55,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-12-21 17:40:55,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-12-21 17:40:55,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-12-21 17:40:55,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-12-21 17:40:55,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-12-21 17:40:55,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-12-21 17:40:55,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-12-21 17:40:55,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-12-21 17:40:55,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-12-21 17:40:55,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-12-21 17:40:55,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-12-21 17:40:55,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-12-21 17:40:55,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-12-21 17:40:55,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-12-21 17:40:55,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-12-21 17:40:55,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-12-21 17:40:55,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-12-21 17:40:55,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-12-21 17:40:55,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-12-21 17:40:55,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-12-21 17:40:55,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-12-21 17:40:55,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-12-21 17:40:55,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-12-21 17:40:55,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-12-21 17:40:55,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-12-21 17:40:55,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-12-21 17:40:55,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-12-21 17:40:55,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-12-21 17:40:55,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-12-21 17:40:55,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-12-21 17:40:55,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-12-21 17:40:55,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-12-21 17:40:55,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-12-21 17:40:55,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-12-21 17:40:55,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-12-21 17:40:55,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-12-21 17:40:55,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-12-21 17:40:55,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-12-21 17:40:55,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-12-21 17:40:55,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-12-21 17:40:55,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-12-21 17:40:55,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-12-21 17:40:55,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-12-21 17:40:55,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-12-21 17:40:55,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-12-21 17:40:55,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-12-21 17:40:55,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-12-21 17:40:55,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-12-21 17:40:55,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-12-21 17:40:55,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-12-21 17:40:55,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-12-21 17:40:55,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-12-21 17:40:55,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-12-21 17:40:55,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-12-21 17:40:55,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-12-21 17:40:55,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-12-21 17:40:55,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-12-21 17:40:55,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-12-21 17:40:55,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-12-21 17:40:55,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-12-21 17:40:55,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-12-21 17:40:55,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-12-21 17:40:55,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-12-21 17:40:55,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-12-21 17:40:55,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-12-21 17:40:55,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-12-21 17:40:55,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-12-21 17:40:55,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-12-21 17:40:55,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-12-21 17:40:55,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-12-21 17:40:55,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-12-21 17:40:55,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-12-21 17:40:55,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-12-21 17:40:55,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-12-21 17:40:55,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-12-21 17:40:55,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-12-21 17:40:55,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-12-21 17:40:55,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-12-21 17:40:55,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-12-21 17:40:55,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-12-21 17:40:55,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-12-21 17:40:55,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-12-21 17:40:55,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-12-21 17:40:55,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-12-21 17:40:55,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-12-21 17:40:55,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-12-21 17:40:55,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-12-21 17:40:55,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 17:40:55,789 INFO L208 MainTranslator]: Completed translation [2021-12-21 17:40:55,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55 WrapperNode [2021-12-21 17:40:55,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 17:40:55,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 17:40:55,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 17:40:55,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 17:40:55,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:55,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:55,962 INFO L137 Inliner]: procedures = 616, calls = 1459, calls flagged for inlining = 273, calls inlined = 178, statements flattened = 2640 [2021-12-21 17:40:55,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 17:40:55,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 17:40:55,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 17:40:55,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 17:40:55,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:55,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:55,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:55,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:56,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:56,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:56,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:56,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 17:40:56,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 17:40:56,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 17:40:56,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 17:40:56,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (1/1) ... [2021-12-21 17:40:56,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 17:40:56,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:40:56,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 17:40:56,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 17:40:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2021-12-21 17:40:56,152 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2021-12-21 17:40:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-21 17:40:56,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-21 17:40:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2021-12-21 17:40:56,152 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2021-12-21 17:40:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-21 17:40:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-21 17:40:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2021-12-21 17:40:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2021-12-21 17:40:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-21 17:40:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-21 17:40:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-21 17:40:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-21 17:40:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-21 17:40:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-21 17:40:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2021-12-21 17:40:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2021-12-21 17:40:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2021-12-21 17:40:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2021-12-21 17:40:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2021-12-21 17:40:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2021-12-21 17:40:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-21 17:40:56,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-21 17:40:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2021-12-21 17:40:56,156 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2021-12-21 17:40:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-21 17:40:56,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-21 17:40:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-12-21 17:40:56,156 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-12-21 17:40:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-21 17:40:56,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-21 17:40:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2021-12-21 17:40:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2021-12-21 17:40:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-21 17:40:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-21 17:40:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-21 17:40:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-21 17:40:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 17:40:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2021-12-21 17:40:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2021-12-21 17:40:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-21 17:40:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-21 17:40:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-12-21 17:40:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-12-21 17:40:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-12-21 17:40:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-12-21 17:40:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-21 17:40:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-21 17:40:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-21 17:40:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-21 17:40:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2021-12-21 17:40:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2021-12-21 17:40:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-21 17:40:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-21 17:40:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 17:40:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-21 17:40:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-21 17:40:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-21 17:40:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-21 17:40:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2021-12-21 17:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2021-12-21 17:40:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2021-12-21 17:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2021-12-21 17:40:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-21 17:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-21 17:40:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2021-12-21 17:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2021-12-21 17:40:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2021-12-21 17:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2021-12-21 17:40:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-21 17:40:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-21 17:40:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2021-12-21 17:40:56,163 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2021-12-21 17:40:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 17:40:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 17:40:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-21 17:40:56,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-21 17:40:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 17:40:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2021-12-21 17:40:56,164 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2021-12-21 17:40:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-21 17:40:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-21 17:40:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 17:40:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 17:40:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2021-12-21 17:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2021-12-21 17:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-12-21 17:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-12-21 17:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2021-12-21 17:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2021-12-21 17:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-12-21 17:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-21 17:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-21 17:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-21 17:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-21 17:40:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2021-12-21 17:40:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2021-12-21 17:40:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2021-12-21 17:40:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2021-12-21 17:40:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2021-12-21 17:40:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2021-12-21 17:40:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2021-12-21 17:40:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2021-12-21 17:40:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-12-21 17:40:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-12-21 17:40:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2021-12-21 17:40:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2021-12-21 17:40:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-21 17:40:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-21 17:40:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2021-12-21 17:40:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2021-12-21 17:40:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2021-12-21 17:40:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2021-12-21 17:40:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-21 17:40:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-21 17:40:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 17:40:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-21 17:40:56,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-21 17:40:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 17:40:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2021-12-21 17:40:56,169 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2021-12-21 17:40:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 17:40:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2021-12-21 17:40:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2021-12-21 17:40:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2021-12-21 17:40:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2021-12-21 17:40:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-12-21 17:40:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-12-21 17:40:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-21 17:40:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-21 17:40:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2021-12-21 17:40:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2021-12-21 17:40:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-21 17:40:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-21 17:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-21 17:40:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-21 17:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-21 17:40:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-21 17:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-21 17:40:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-21 17:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2021-12-21 17:40:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2021-12-21 17:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2021-12-21 17:40:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2021-12-21 17:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2021-12-21 17:40:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2021-12-21 17:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2021-12-21 17:40:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2021-12-21 17:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-21 17:40:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-21 17:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-21 17:40:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-21 17:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 17:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-21 17:40:56,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-21 17:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-21 17:40:56,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-21 17:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-21 17:40:56,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-21 17:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2021-12-21 17:40:56,173 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2021-12-21 17:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2021-12-21 17:40:56,173 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2021-12-21 17:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2021-12-21 17:40:56,173 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2021-12-21 17:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2021-12-21 17:40:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2021-12-21 17:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-21 17:40:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-21 17:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2021-12-21 17:40:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2021-12-21 17:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-21 17:40:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-21 17:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2021-12-21 17:40:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2021-12-21 17:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 17:40:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2021-12-21 17:40:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2021-12-21 17:40:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2021-12-21 17:40:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2021-12-21 17:40:56,692 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 17:40:56,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 17:40:56,825 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-21 17:40:57,962 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 17:40:57,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 17:40:57,975 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 17:40:57,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:40:57 BoogieIcfgContainer [2021-12-21 17:40:57,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 17:40:57,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 17:40:57,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 17:40:57,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 17:40:57,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:40:52" (1/3) ... [2021-12-21 17:40:57,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea9729c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:40:57, skipping insertion in model container [2021-12-21 17:40:57,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:55" (2/3) ... [2021-12-21 17:40:57,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea9729c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:40:57, skipping insertion in model container [2021-12-21 17:40:57,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:40:57" (3/3) ... [2021-12-21 17:40:57,985 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-12-21 17:40:57,989 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 17:40:57,989 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-12-21 17:40:58,034 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 17:40:58,039 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 17:40:58,040 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-12-21 17:40:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 1116 states, 741 states have (on average 1.2496626180836707) internal successors, (926), 797 states have internal predecessors, (926), 260 states have call successors, (260), 84 states have call predecessors, (260), 83 states have return successors, (255), 251 states have call predecessors, (255), 255 states have call successors, (255) [2021-12-21 17:40:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-21 17:40:58,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:40:58,077 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:40:58,078 INFO L402 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 29 more)] === [2021-12-21 17:40:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:40:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash -138799992, now seen corresponding path program 1 times [2021-12-21 17:40:58,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:40:58,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605319975] [2021-12-21 17:40:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:40:58,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:40:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:40:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:40:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:40:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:40:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:40:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:40:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:40:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:40:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:40:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:40:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:40:58,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:40:58,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605319975] [2021-12-21 17:40:58,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605319975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:40:58,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:40:58,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:40:58,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379802442] [2021-12-21 17:40:58,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:40:58,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:40:58,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:40:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:40:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:40:58,591 INFO L87 Difference]: Start difference. First operand has 1116 states, 741 states have (on average 1.2496626180836707) internal successors, (926), 797 states have internal predecessors, (926), 260 states have call successors, (260), 84 states have call predecessors, (260), 83 states have return successors, (255), 251 states have call predecessors, (255), 255 states have call successors, (255) Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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) [2021-12-21 17:41:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:00,170 INFO L93 Difference]: Finished difference Result 2200 states and 2931 transitions. [2021-12-21 17:41:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:00,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 70 [2021-12-21 17:41:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:00,190 INFO L225 Difference]: With dead ends: 2200 [2021-12-21 17:41:00,190 INFO L226 Difference]: Without dead ends: 1093 [2021-12-21 17:41:00,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:00,202 INFO L933 BasicCegarLoop]: 1319 mSDtfsCounter, 1961 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:00,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2136 Valid, 3013 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-21 17:41:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-12-21 17:41:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2021-12-21 17:41:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 726 states have (on average 1.1942148760330578) internal successors, (867), 777 states have internal predecessors, (867), 255 states have call successors, (255), 83 states have call predecessors, (255), 82 states have return successors, (253), 249 states have call predecessors, (253), 253 states have call successors, (253) [2021-12-21 17:41:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1375 transitions. [2021-12-21 17:41:00,320 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1375 transitions. Word has length 70 [2021-12-21 17:41:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:00,322 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 1375 transitions. [2021-12-21 17:41:00,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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) [2021-12-21 17:41:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1375 transitions. [2021-12-21 17:41:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-21 17:41:00,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:00,330 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:00,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 17:41:00,331 INFO L402 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 29 more)] === [2021-12-21 17:41:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 333096518, now seen corresponding path program 1 times [2021-12-21 17:41:00,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638590885] [2021-12-21 17:41:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:00,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:00,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:00,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638590885] [2021-12-21 17:41:00,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638590885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:00,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:00,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:00,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516757655] [2021-12-21 17:41:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:00,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:00,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:00,590 INFO L87 Difference]: Start difference. First operand 1093 states and 1375 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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) [2021-12-21 17:41:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:01,833 INFO L93 Difference]: Finished difference Result 1093 states and 1375 transitions. [2021-12-21 17:41:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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 76 [2021-12-21 17:41:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:01,841 INFO L225 Difference]: With dead ends: 1093 [2021-12-21 17:41:01,843 INFO L226 Difference]: Without dead ends: 1091 [2021-12-21 17:41:01,844 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:41:01,846 INFO L933 BasicCegarLoop]: 1299 mSDtfsCounter, 1927 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:01,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2099 Valid, 2971 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-21 17:41:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-12-21 17:41:01,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2021-12-21 17:41:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 725 states have (on average 1.193103448275862) internal successors, (865), 775 states have internal predecessors, (865), 255 states have call successors, (255), 83 states have call predecessors, (255), 82 states have return successors, (253), 249 states have call predecessors, (253), 253 states have call successors, (253) [2021-12-21 17:41:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1373 transitions. [2021-12-21 17:41:01,902 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1373 transitions. Word has length 76 [2021-12-21 17:41:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:01,902 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 1373 transitions. [2021-12-21 17:41:01,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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) [2021-12-21 17:41:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1373 transitions. [2021-12-21 17:41:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-21 17:41:01,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:01,911 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:01,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 17:41:01,911 INFO L402 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 29 more)] === [2021-12-21 17:41:01,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:01,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1375714423, now seen corresponding path program 1 times [2021-12-21 17:41:01,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:01,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107799175] [2021-12-21 17:41:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:01,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:01,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:02,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:02,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107799175] [2021-12-21 17:41:02,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107799175] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:02,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:02,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:02,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688908262] [2021-12-21 17:41:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:02,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:02,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:02,060 INFO L87 Difference]: Start difference. First operand 1091 states and 1373 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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) [2021-12-21 17:41:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:03,378 INFO L93 Difference]: Finished difference Result 1091 states and 1373 transitions. [2021-12-21 17:41:03,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:03,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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 82 [2021-12-21 17:41:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:03,383 INFO L225 Difference]: With dead ends: 1091 [2021-12-21 17:41:03,383 INFO L226 Difference]: Without dead ends: 1089 [2021-12-21 17:41:03,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:03,384 INFO L933 BasicCegarLoop]: 1297 mSDtfsCounter, 1921 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 2969 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:03,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2092 Valid, 2969 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-21 17:41:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-12-21 17:41:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2021-12-21 17:41:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 724 states have (on average 1.191988950276243) internal successors, (863), 773 states have internal predecessors, (863), 255 states have call successors, (255), 83 states have call predecessors, (255), 82 states have return successors, (253), 249 states have call predecessors, (253), 253 states have call successors, (253) [2021-12-21 17:41:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1371 transitions. [2021-12-21 17:41:03,416 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1371 transitions. Word has length 82 [2021-12-21 17:41:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:03,416 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 1371 transitions. [2021-12-21 17:41:03,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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) [2021-12-21 17:41:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1371 transitions. [2021-12-21 17:41:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-21 17:41:03,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:03,418 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:03,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 17:41:03,418 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting nfnl_log_pernetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-21 17:41:03,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:03,418 INFO L85 PathProgramCache]: Analyzing trace with hash -62631502, now seen corresponding path program 1 times [2021-12-21 17:41:03,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:03,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82475324] [2021-12-21 17:41:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:03,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-21 17:41:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-21 17:41:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-21 17:41:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-21 17:41:03,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:03,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82475324] [2021-12-21 17:41:03,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82475324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:03,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:03,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:03,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647206369] [2021-12-21 17:41:03,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:03,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:03,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:03,600 INFO L87 Difference]: Start difference. First operand 1089 states and 1371 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-21 17:41:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:05,490 INFO L93 Difference]: Finished difference Result 1862 states and 2308 transitions. [2021-12-21 17:41:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 17:41:05,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2021-12-21 17:41:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:05,497 INFO L225 Difference]: With dead ends: 1862 [2021-12-21 17:41:05,497 INFO L226 Difference]: Without dead ends: 1860 [2021-12-21 17:41:05,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:05,498 INFO L933 BasicCegarLoop]: 1567 mSDtfsCounter, 1359 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 4980 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:05,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 4980 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-21 17:41:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2021-12-21 17:41:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1597. [2021-12-21 17:41:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1060 states have (on average 1.180188679245283) internal successors, (1251), 1125 states have internal predecessors, (1251), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-21 17:41:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2009 transitions. [2021-12-21 17:41:05,556 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2009 transitions. Word has length 97 [2021-12-21 17:41:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:05,557 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2009 transitions. [2021-12-21 17:41:05,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-21 17:41:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2009 transitions. [2021-12-21 17:41:05,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-21 17:41:05,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:05,558 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:05,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 17:41:05,558 INFO L402 AbstractCegarLoop]: === Iteration 5 === 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 29 more)] === [2021-12-21 17:41:05,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash 591565888, now seen corresponding path program 1 times [2021-12-21 17:41:05,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:05,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173527628] [2021-12-21 17:41:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:05,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:05,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:05,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173527628] [2021-12-21 17:41:05,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173527628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:05,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:05,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:05,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726281204] [2021-12-21 17:41:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:05,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:05,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:05,702 INFO L87 Difference]: Start difference. First operand 1597 states and 2009 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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) [2021-12-21 17:41:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:06,925 INFO L93 Difference]: Finished difference Result 1597 states and 2009 transitions. [2021-12-21 17:41:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 88 [2021-12-21 17:41:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:06,931 INFO L225 Difference]: With dead ends: 1597 [2021-12-21 17:41:06,932 INFO L226 Difference]: Without dead ends: 1595 [2021-12-21 17:41:06,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:06,933 INFO L933 BasicCegarLoop]: 1295 mSDtfsCounter, 1915 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2085 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:06,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2085 Valid, 2967 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-21 17:41:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-12-21 17:41:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595. [2021-12-21 17:41:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1059 states have (on average 1.1794145420207742) internal successors, (1249), 1123 states have internal predecessors, (1249), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-21 17:41:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2007 transitions. [2021-12-21 17:41:06,991 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2007 transitions. Word has length 88 [2021-12-21 17:41:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:06,992 INFO L470 AbstractCegarLoop]: Abstraction has 1595 states and 2007 transitions. [2021-12-21 17:41:06,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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) [2021-12-21 17:41:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2007 transitions. [2021-12-21 17:41:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-21 17:41:06,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:06,994 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:06,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 17:41:06,995 INFO L402 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 29 more)] === [2021-12-21 17:41:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash -56363973, now seen corresponding path program 1 times [2021-12-21 17:41:06,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:06,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472128874] [2021-12-21 17:41:06,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:06,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:07,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:07,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472128874] [2021-12-21 17:41:07,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472128874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:07,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:07,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:07,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960727371] [2021-12-21 17:41:07,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:07,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:07,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:07,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:07,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:07,199 INFO L87 Difference]: Start difference. First operand 1595 states and 2007 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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) [2021-12-21 17:41:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:08,505 INFO L93 Difference]: Finished difference Result 1595 states and 2007 transitions. [2021-12-21 17:41:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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 94 [2021-12-21 17:41:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:08,512 INFO L225 Difference]: With dead ends: 1595 [2021-12-21 17:41:08,512 INFO L226 Difference]: Without dead ends: 1593 [2021-12-21 17:41:08,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:08,513 INFO L933 BasicCegarLoop]: 1293 mSDtfsCounter, 1909 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:08,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2078 Valid, 2965 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-21 17:41:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2021-12-21 17:41:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1593. [2021-12-21 17:41:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1058 states have (on average 1.1786389413988658) internal successors, (1247), 1121 states have internal predecessors, (1247), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-21 17:41:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2005 transitions. [2021-12-21 17:41:08,579 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2005 transitions. Word has length 94 [2021-12-21 17:41:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:08,579 INFO L470 AbstractCegarLoop]: Abstraction has 1593 states and 2005 transitions. [2021-12-21 17:41:08,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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) [2021-12-21 17:41:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2005 transitions. [2021-12-21 17:41:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 17:41:08,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:08,582 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:08,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 17:41:08,582 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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 29 more)] === [2021-12-21 17:41:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash 915527194, now seen corresponding path program 1 times [2021-12-21 17:41:08,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:08,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853088305] [2021-12-21 17:41:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:08,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:08,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:08,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853088305] [2021-12-21 17:41:08,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853088305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:08,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:08,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:08,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412229450] [2021-12-21 17:41:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:08,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:08,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:08,775 INFO L87 Difference]: Start difference. First operand 1593 states and 2005 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2021-12-21 17:41:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:09,894 INFO L93 Difference]: Finished difference Result 1593 states and 2005 transitions. [2021-12-21 17:41:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:09,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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 100 [2021-12-21 17:41:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:09,902 INFO L225 Difference]: With dead ends: 1593 [2021-12-21 17:41:09,902 INFO L226 Difference]: Without dead ends: 1591 [2021-12-21 17:41:09,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:09,904 INFO L933 BasicCegarLoop]: 1291 mSDtfsCounter, 1903 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 2963 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:09,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2071 Valid, 2963 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-21 17:41:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2021-12-21 17:41:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2021-12-21 17:41:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1057 states have (on average 1.1778618732261117) internal successors, (1245), 1119 states have internal predecessors, (1245), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-21 17:41:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2003 transitions. [2021-12-21 17:41:09,965 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2003 transitions. Word has length 100 [2021-12-21 17:41:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:09,965 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2003 transitions. [2021-12-21 17:41:09,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2021-12-21 17:41:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2003 transitions. [2021-12-21 17:41:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-21 17:41:09,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:09,967 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:09,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 17:41:09,967 INFO L402 AbstractCegarLoop]: === Iteration 8 === 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 29 more)] === [2021-12-21 17:41:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash 178536448, now seen corresponding path program 1 times [2021-12-21 17:41:09,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:09,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549696860] [2021-12-21 17:41:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:09,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:10,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:10,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549696860] [2021-12-21 17:41:10,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549696860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:10,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:10,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:10,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499226078] [2021-12-21 17:41:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:10,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:10,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:10,160 INFO L87 Difference]: Start difference. First operand 1591 states and 2003 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, (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) [2021-12-21 17:41:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:11,326 INFO L93 Difference]: Finished difference Result 1591 states and 2003 transitions. [2021-12-21 17:41:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:11,326 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, (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 106 [2021-12-21 17:41:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:11,332 INFO L225 Difference]: With dead ends: 1591 [2021-12-21 17:41:11,332 INFO L226 Difference]: Without dead ends: 1589 [2021-12-21 17:41:11,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:11,333 INFO L933 BasicCegarLoop]: 1289 mSDtfsCounter, 1897 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:11,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2064 Valid, 2961 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-21 17:41:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-12-21 17:41:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2021-12-21 17:41:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1056 states have (on average 1.1770833333333333) internal successors, (1243), 1117 states have internal predecessors, (1243), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-21 17:41:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2001 transitions. [2021-12-21 17:41:11,382 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2001 transitions. Word has length 106 [2021-12-21 17:41:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:11,382 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 2001 transitions. [2021-12-21 17:41:11,383 INFO L471 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, (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) [2021-12-21 17:41:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2001 transitions. [2021-12-21 17:41:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-21 17:41:11,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:11,384 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-21 17:41:11,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 17:41:11,384 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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 29 more)] === [2021-12-21 17:41:11,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1037707720, now seen corresponding path program 1 times [2021-12-21 17:41:11,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:11,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191839608] [2021-12-21 17:41:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:11,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 17:41:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 17:41:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-12-21 17:41:11,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:11,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191839608] [2021-12-21 17:41:11,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191839608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:11,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:11,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 17:41:11,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660523155] [2021-12-21 17:41:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:11,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 17:41:11,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 17:41:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:41:11,595 INFO L87 Difference]: Start difference. First operand 1589 states and 2001 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-21 17:41:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:13,379 INFO L93 Difference]: Finished difference Result 1869 states and 2334 transitions. [2021-12-21 17:41:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 17:41:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2021-12-21 17:41:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:13,386 INFO L225 Difference]: With dead ends: 1869 [2021-12-21 17:41:13,386 INFO L226 Difference]: Without dead ends: 1867 [2021-12-21 17:41:13,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-12-21 17:41:13,388 INFO L933 BasicCegarLoop]: 1395 mSDtfsCounter, 1888 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 4118 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 853 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:13,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2061 Valid, 4118 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [853 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-21 17:41:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2021-12-21 17:41:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1759. [2021-12-21 17:41:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1176 states have (on average 1.1802721088435375) internal successors, (1388), 1238 states have internal predecessors, (1388), 404 states have call successors, (404), 156 states have call predecessors, (404), 155 states have return successors, (406), 389 states have call predecessors, (406), 402 states have call successors, (406) [2021-12-21 17:41:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2198 transitions. [2021-12-21 17:41:13,446 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2198 transitions. Word has length 118 [2021-12-21 17:41:13,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:13,446 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2198 transitions. [2021-12-21 17:41:13,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-21 17:41:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2198 transitions. [2021-12-21 17:41:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-21 17:41:13,448 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:13,448 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:13,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 17:41:13,448 INFO L402 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 29 more)] === [2021-12-21 17:41:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1083405284, now seen corresponding path program 1 times [2021-12-21 17:41:13,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:13,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682180699] [2021-12-21 17:41:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:13,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-21 17:41:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:13,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:13,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682180699] [2021-12-21 17:41:13,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682180699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:13,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:13,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:13,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926233367] [2021-12-21 17:41:13,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:13,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:13,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:13,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:13,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:13,622 INFO L87 Difference]: Start difference. First operand 1759 states and 2198 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, (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) [2021-12-21 17:41:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:14,749 INFO L93 Difference]: Finished difference Result 1759 states and 2198 transitions. [2021-12-21 17:41:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:14,749 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, (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 112 [2021-12-21 17:41:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:14,755 INFO L225 Difference]: With dead ends: 1759 [2021-12-21 17:41:14,756 INFO L226 Difference]: Without dead ends: 1757 [2021-12-21 17:41:14,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:14,758 INFO L933 BasicCegarLoop]: 1287 mSDtfsCounter, 1895 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:14,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2061 Valid, 2959 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-21 17:41:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2021-12-21 17:41:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2021-12-21 17:41:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1175 states have (on average 1.1795744680851064) internal successors, (1386), 1236 states have internal predecessors, (1386), 404 states have call successors, (404), 156 states have call predecessors, (404), 155 states have return successors, (406), 389 states have call predecessors, (406), 402 states have call successors, (406) [2021-12-21 17:41:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2196 transitions. [2021-12-21 17:41:14,818 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2196 transitions. Word has length 112 [2021-12-21 17:41:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:14,818 INFO L470 AbstractCegarLoop]: Abstraction has 1757 states and 2196 transitions. [2021-12-21 17:41:14,819 INFO L471 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, (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) [2021-12-21 17:41:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2196 transitions. [2021-12-21 17:41:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-21 17:41:14,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:14,820 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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] [2021-12-21 17:41:14,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 17:41:14,821 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting rcu_read_unlock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-21 17:41:14,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash 392296454, now seen corresponding path program 1 times [2021-12-21 17:41:14,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:14,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122256883] [2021-12-21 17:41:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:14,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 17:41:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:41:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-21 17:41:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-21 17:41:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-21 17:41:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-12-21 17:41:15,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:15,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122256883] [2021-12-21 17:41:15,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122256883] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:41:15,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086907739] [2021-12-21 17:41:15,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:15,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:41:15,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:41:15,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 17:41:15,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 17:41:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:15,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 17:41:15,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:41:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-21 17:41:15,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 17:41:15,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086907739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:15,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 17:41:15,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2021-12-21 17:41:15,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454128470] [2021-12-21 17:41:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:15,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 17:41:15,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:15,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 17:41:15,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-21 17:41:15,649 INFO L87 Difference]: Start difference. First operand 1757 states and 2196 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-21 17:41:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:15,785 INFO L93 Difference]: Finished difference Result 3405 states and 4242 transitions. [2021-12-21 17:41:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 17:41:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 134 [2021-12-21 17:41:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:15,794 INFO L225 Difference]: With dead ends: 3405 [2021-12-21 17:41:15,794 INFO L226 Difference]: Without dead ends: 1805 [2021-12-21 17:41:15,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:15,799 INFO L933 BasicCegarLoop]: 1395 mSDtfsCounter, 319 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 5096 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:15,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 5096 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:41:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2021-12-21 17:41:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1763. [2021-12-21 17:41:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1179 states have (on average 1.1789652247667515) internal successors, (1390), 1240 states have internal predecessors, (1390), 406 states have call successors, (406), 156 states have call predecessors, (406), 155 states have return successors, (408), 391 states have call predecessors, (408), 404 states have call successors, (408) [2021-12-21 17:41:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2204 transitions. [2021-12-21 17:41:15,876 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2204 transitions. Word has length 134 [2021-12-21 17:41:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:15,878 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 2204 transitions. [2021-12-21 17:41:15,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-21 17:41:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2204 transitions. [2021-12-21 17:41:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-21 17:41:15,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:15,879 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:15,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 17:41:16,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-21 17:41:16,095 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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 29 more)] === [2021-12-21 17:41:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1770258305, now seen corresponding path program 1 times [2021-12-21 17:41:16,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:16,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797249241] [2021-12-21 17:41:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:16,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-21 17:41:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:16,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:16,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797249241] [2021-12-21 17:41:16,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797249241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:16,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:16,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:16,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798876692] [2021-12-21 17:41:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:16,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:16,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:16,255 INFO L87 Difference]: Start difference. First operand 1763 states and 2204 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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) [2021-12-21 17:41:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:17,560 INFO L93 Difference]: Finished difference Result 1763 states and 2204 transitions. [2021-12-21 17:41:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:17,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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 114 [2021-12-21 17:41:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:17,567 INFO L225 Difference]: With dead ends: 1763 [2021-12-21 17:41:17,568 INFO L226 Difference]: Without dead ends: 1761 [2021-12-21 17:41:17,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:17,569 INFO L933 BasicCegarLoop]: 1285 mSDtfsCounter, 1883 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2049 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:17,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2049 Valid, 2957 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-21 17:41:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2021-12-21 17:41:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2021-12-21 17:41:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1178 states have (on average 1.1782682512733447) internal successors, (1388), 1238 states have internal predecessors, (1388), 406 states have call successors, (406), 156 states have call predecessors, (406), 155 states have return successors, (408), 391 states have call predecessors, (408), 404 states have call successors, (408) [2021-12-21 17:41:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2202 transitions. [2021-12-21 17:41:17,643 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2202 transitions. Word has length 114 [2021-12-21 17:41:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:17,643 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 2202 transitions. [2021-12-21 17:41:17,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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) [2021-12-21 17:41:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2202 transitions. [2021-12-21 17:41:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-21 17:41:17,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:17,645 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:17,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 17:41:17,646 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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 29 more)] === [2021-12-21 17:41:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1352940516, now seen corresponding path program 1 times [2021-12-21 17:41:17,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:17,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774388761] [2021-12-21 17:41:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:17,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-21 17:41:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 17:41:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:17,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:17,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774388761] [2021-12-21 17:41:17,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774388761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:17,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:17,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:17,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81088941] [2021-12-21 17:41:17,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:17,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:17,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:17,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:17,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:17,799 INFO L87 Difference]: Start difference. First operand 1761 states and 2202 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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) [2021-12-21 17:41:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:19,737 INFO L93 Difference]: Finished difference Result 2666 states and 3269 transitions. [2021-12-21 17:41:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 17:41:19,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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 120 [2021-12-21 17:41:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:19,745 INFO L225 Difference]: With dead ends: 2666 [2021-12-21 17:41:19,745 INFO L226 Difference]: Without dead ends: 2664 [2021-12-21 17:41:19,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:41:19,746 INFO L933 BasicCegarLoop]: 1377 mSDtfsCounter, 2664 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 1199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2829 SdHoareTripleChecker+Valid, 3591 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1199 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:19,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2829 Valid, 3591 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1199 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-21 17:41:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-12-21 17:41:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2619. [2021-12-21 17:41:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2619 states, 1778 states have (on average 1.1805399325084365) internal successors, (2099), 1846 states have internal predecessors, (2099), 571 states have call successors, (571), 249 states have call predecessors, (571), 248 states have return successors, (573), 555 states have call predecessors, (573), 569 states have call successors, (573) [2021-12-21 17:41:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3243 transitions. [2021-12-21 17:41:19,849 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3243 transitions. Word has length 120 [2021-12-21 17:41:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:19,849 INFO L470 AbstractCegarLoop]: Abstraction has 2619 states and 3243 transitions. [2021-12-21 17:41:19,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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) [2021-12-21 17:41:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3243 transitions. [2021-12-21 17:41:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-21 17:41:19,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:19,851 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:19,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 17:41:19,851 INFO L402 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 29 more)] === [2021-12-21 17:41:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -179191031, now seen corresponding path program 1 times [2021-12-21 17:41:19,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:19,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134863594] [2021-12-21 17:41:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:19,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-21 17:41:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 17:41:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:19,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-21 17:41:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:20,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:20,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134863594] [2021-12-21 17:41:20,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134863594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:20,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:20,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:20,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520513634] [2021-12-21 17:41:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:20,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:20,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:20,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:20,003 INFO L87 Difference]: Start difference. First operand 2619 states and 3243 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 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) [2021-12-21 17:41:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:21,843 INFO L93 Difference]: Finished difference Result 3726 states and 4547 transitions. [2021-12-21 17:41:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 17:41:21,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 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 126 [2021-12-21 17:41:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:21,856 INFO L225 Difference]: With dead ends: 3726 [2021-12-21 17:41:21,857 INFO L226 Difference]: Without dead ends: 3724 [2021-12-21 17:41:21,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:41:21,861 INFO L933 BasicCegarLoop]: 1360 mSDtfsCounter, 2149 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 1098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2251 SdHoareTripleChecker+Valid, 3797 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:21,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2251 Valid, 3797 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-21 17:41:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2021-12-21 17:41:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3583. [2021-12-21 17:41:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 2425 states have (on average 1.1698969072164949) internal successors, (2837), 2515 states have internal predecessors, (2837), 784 states have call successors, (784), 354 states have call predecessors, (784), 352 states have return successors, (786), 758 states have call predecessors, (786), 782 states have call successors, (786) [2021-12-21 17:41:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4407 transitions. [2021-12-21 17:41:21,999 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4407 transitions. Word has length 126 [2021-12-21 17:41:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:21,999 INFO L470 AbstractCegarLoop]: Abstraction has 3583 states and 4407 transitions. [2021-12-21 17:41:21,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 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) [2021-12-21 17:41:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4407 transitions. [2021-12-21 17:41:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-21 17:41:22,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:22,001 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2021-12-21 17:41:22,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 17:41:22,001 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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 29 more)] === [2021-12-21 17:41:22,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash -31471526, now seen corresponding path program 1 times [2021-12-21 17:41:22,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:22,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646693099] [2021-12-21 17:41:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:22,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 17:41:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 17:41:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 17:41:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 17:41:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-21 17:41:22,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:22,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646693099] [2021-12-21 17:41:22,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646693099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:22,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:22,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:22,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082746348] [2021-12-21 17:41:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:22,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:22,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:22,167 INFO L87 Difference]: Start difference. First operand 3583 states and 4407 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-21 17:41:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:23,697 INFO L93 Difference]: Finished difference Result 6578 states and 8094 transitions. [2021-12-21 17:41:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2021-12-21 17:41:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:23,712 INFO L225 Difference]: With dead ends: 6578 [2021-12-21 17:41:23,712 INFO L226 Difference]: Without dead ends: 3850 [2021-12-21 17:41:23,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:23,720 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1339 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:23,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1341 Valid, 3384 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-21 17:41:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2021-12-21 17:41:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3584. [2021-12-21 17:41:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 2426 states have (on average 1.1698268755152514) internal successors, (2838), 2516 states have internal predecessors, (2838), 784 states have call successors, (784), 354 states have call predecessors, (784), 352 states have return successors, (786), 758 states have call predecessors, (786), 782 states have call successors, (786) [2021-12-21 17:41:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4408 transitions. [2021-12-21 17:41:23,861 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4408 transitions. Word has length 141 [2021-12-21 17:41:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:23,861 INFO L470 AbstractCegarLoop]: Abstraction has 3584 states and 4408 transitions. [2021-12-21 17:41:23,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-21 17:41:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4408 transitions. [2021-12-21 17:41:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-21 17:41:23,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:23,863 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:23,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 17:41:23,863 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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 29 more)] === [2021-12-21 17:41:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1628899092, now seen corresponding path program 1 times [2021-12-21 17:41:23,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:23,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226989733] [2021-12-21 17:41:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:23,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:24,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:24,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-21 17:41:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 17:41:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-21 17:41:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-21 17:41:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:24,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:24,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226989733] [2021-12-21 17:41:24,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226989733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:24,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:24,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:24,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887045105] [2021-12-21 17:41:24,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:24,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:24,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:24,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:24,052 INFO L87 Difference]: Start difference. First operand 3584 states and 4408 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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) [2021-12-21 17:41:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:25,216 INFO L93 Difference]: Finished difference Result 3584 states and 4408 transitions. [2021-12-21 17:41:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:25,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 132 [2021-12-21 17:41:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:25,227 INFO L225 Difference]: With dead ends: 3584 [2021-12-21 17:41:25,228 INFO L226 Difference]: Without dead ends: 3582 [2021-12-21 17:41:25,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:25,230 INFO L933 BasicCegarLoop]: 1282 mSDtfsCounter, 1879 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:25,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2042 Valid, 2954 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-21 17:41:25,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2021-12-21 17:41:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3582. [2021-12-21 17:41:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 2425 states have (on average 1.1690721649484537) internal successors, (2835), 2514 states have internal predecessors, (2835), 784 states have call successors, (784), 354 states have call predecessors, (784), 352 states have return successors, (786), 758 states have call predecessors, (786), 782 states have call successors, (786) [2021-12-21 17:41:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4405 transitions. [2021-12-21 17:41:25,400 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4405 transitions. Word has length 132 [2021-12-21 17:41:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:25,401 INFO L470 AbstractCegarLoop]: Abstraction has 3582 states and 4405 transitions. [2021-12-21 17:41:25,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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) [2021-12-21 17:41:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4405 transitions. [2021-12-21 17:41:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-21 17:41:25,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:25,403 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2021-12-21 17:41:25,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 17:41:25,404 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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 29 more)] === [2021-12-21 17:41:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1350192956, now seen corresponding path program 1 times [2021-12-21 17:41:25,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:25,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186668866] [2021-12-21 17:41:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:25,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 17:41:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 17:41:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 17:41:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 17:41:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-21 17:41:25,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:25,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186668866] [2021-12-21 17:41:25,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186668866] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:41:25,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688588103] [2021-12-21 17:41:25,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:25,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:41:25,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:41:25,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 17:41:25,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 17:41:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:25,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 17:41:25,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:41:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-21 17:41:26,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:41:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-21 17:41:26,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688588103] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:41:26,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:41:26,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2021-12-21 17:41:26,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225257499] [2021-12-21 17:41:26,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:41:26,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 17:41:26,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:26,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 17:41:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:26,350 INFO L87 Difference]: Start difference. First operand 3582 states and 4405 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-21 17:41:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:27,939 INFO L93 Difference]: Finished difference Result 6598 states and 8126 transitions. [2021-12-21 17:41:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 17:41:27,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2021-12-21 17:41:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:27,954 INFO L225 Difference]: With dead ends: 6598 [2021-12-21 17:41:27,954 INFO L226 Difference]: Without dead ends: 3871 [2021-12-21 17:41:27,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-21 17:41:27,962 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1390 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 1032 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1032 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:27,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 4246 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1032 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-21 17:41:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2021-12-21 17:41:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3615. [2021-12-21 17:41:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3615 states, 2455 states have (on average 1.1718940936863544) internal successors, (2877), 2547 states have internal predecessors, (2877), 787 states have call successors, (787), 354 states have call predecessors, (787), 352 states have return successors, (789), 761 states have call predecessors, (789), 785 states have call successors, (789) [2021-12-21 17:41:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4453 transitions. [2021-12-21 17:41:28,106 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4453 transitions. Word has length 146 [2021-12-21 17:41:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:28,107 INFO L470 AbstractCegarLoop]: Abstraction has 3615 states and 4453 transitions. [2021-12-21 17:41:28,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-21 17:41:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4453 transitions. [2021-12-21 17:41:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-21 17:41:28,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:28,109 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2021-12-21 17:41:28,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 17:41:28,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 17:41:28,329 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_for_read_sectionErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-21 17:41:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash 216200491, now seen corresponding path program 1 times [2021-12-21 17:41:28,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807455273] [2021-12-21 17:41:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:28,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 17:41:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 17:41:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 17:41:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 17:41:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-21 17:41:28,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:28,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807455273] [2021-12-21 17:41:28,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807455273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:28,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:28,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 17:41:28,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446206182] [2021-12-21 17:41:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:28,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 17:41:28,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:28,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 17:41:28,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:41:28,542 INFO L87 Difference]: Start difference. First operand 3615 states and 4453 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-21 17:41:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:30,943 INFO L93 Difference]: Finished difference Result 3915 states and 4825 transitions. [2021-12-21 17:41:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 17:41:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2021-12-21 17:41:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:30,954 INFO L225 Difference]: With dead ends: 3915 [2021-12-21 17:41:30,954 INFO L226 Difference]: Without dead ends: 3913 [2021-12-21 17:41:30,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-12-21 17:41:30,957 INFO L933 BasicCegarLoop]: 1350 mSDtfsCounter, 2967 mSDsluCounter, 2909 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 1694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3081 SdHoareTripleChecker+Valid, 4259 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1694 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:30,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3081 Valid, 4259 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1694 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-21 17:41:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2021-12-21 17:41:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3615. [2021-12-21 17:41:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3615 states, 2455 states have (on average 1.170672097759674) internal successors, (2874), 2547 states have internal predecessors, (2874), 787 states have call successors, (787), 354 states have call predecessors, (787), 352 states have return successors, (789), 761 states have call predecessors, (789), 785 states have call successors, (789) [2021-12-21 17:41:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4450 transitions. [2021-12-21 17:41:31,100 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4450 transitions. Word has length 147 [2021-12-21 17:41:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:31,101 INFO L470 AbstractCegarLoop]: Abstraction has 3615 states and 4450 transitions. [2021-12-21 17:41:31,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-21 17:41:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4450 transitions. [2021-12-21 17:41:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-21 17:41:31,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:31,103 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:31,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 17:41:31,104 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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 29 more)] === [2021-12-21 17:41:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -973056597, now seen corresponding path program 1 times [2021-12-21 17:41:31,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:31,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16034520] [2021-12-21 17:41:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:31,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-21 17:41:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 17:41:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-21 17:41:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-21 17:41:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-21 17:41:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:31,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:31,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16034520] [2021-12-21 17:41:31,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16034520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:31,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:31,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:31,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022419448] [2021-12-21 17:41:31,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:31,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:31,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:31,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:31,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:31,291 INFO L87 Difference]: Start difference. First operand 3615 states and 4450 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 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) [2021-12-21 17:41:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:33,163 INFO L93 Difference]: Finished difference Result 3948 states and 4802 transitions. [2021-12-21 17:41:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 17:41:33,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 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 138 [2021-12-21 17:41:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:33,174 INFO L225 Difference]: With dead ends: 3948 [2021-12-21 17:41:33,174 INFO L226 Difference]: Without dead ends: 3946 [2021-12-21 17:41:33,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:41:33,176 INFO L933 BasicCegarLoop]: 1533 mSDtfsCounter, 1819 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 1066 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 4180 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1066 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:33,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1924 Valid, 4180 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1066 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-21 17:41:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-12-21 17:41:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3819. [2021-12-21 17:41:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 2591 states have (on average 1.1620995754534929) internal successors, (3011), 2683 states have internal predecessors, (3011), 827 states have call successors, (827), 382 states have call predecessors, (827), 380 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-21 17:41:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4667 transitions. [2021-12-21 17:41:33,353 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4667 transitions. Word has length 138 [2021-12-21 17:41:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:33,354 INFO L470 AbstractCegarLoop]: Abstraction has 3819 states and 4667 transitions. [2021-12-21 17:41:33,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 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) [2021-12-21 17:41:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4667 transitions. [2021-12-21 17:41:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-21 17:41:33,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:33,356 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2021-12-21 17:41:33,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 17:41:33,356 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_for_read_sectionErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-21 17:41:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1616326209, now seen corresponding path program 1 times [2021-12-21 17:41:33,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:33,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656496896] [2021-12-21 17:41:33,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:33,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 17:41:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 17:41:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 17:41:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 17:41:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-21 17:41:33,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:33,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656496896] [2021-12-21 17:41:33,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656496896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:33,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:33,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 17:41:33,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792298148] [2021-12-21 17:41:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:33,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 17:41:33,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 17:41:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:41:33,526 INFO L87 Difference]: Start difference. First operand 3819 states and 4667 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-21 17:41:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:35,053 INFO L93 Difference]: Finished difference Result 4075 states and 5007 transitions. [2021-12-21 17:41:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 17:41:35,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 150 [2021-12-21 17:41:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:35,070 INFO L225 Difference]: With dead ends: 4075 [2021-12-21 17:41:35,071 INFO L226 Difference]: Without dead ends: 4073 [2021-12-21 17:41:35,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:41:35,073 INFO L933 BasicCegarLoop]: 1272 mSDtfsCounter, 2361 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:35,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2541 Valid, 3394 Invalid, 2407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-21 17:41:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2021-12-21 17:41:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3817. [2021-12-21 17:41:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3817 states, 2590 states have (on average 1.159073359073359) internal successors, (3002), 2681 states have internal predecessors, (3002), 827 states have call successors, (827), 382 states have call predecessors, (827), 380 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-21 17:41:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 4658 transitions. [2021-12-21 17:41:35,246 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 4658 transitions. Word has length 150 [2021-12-21 17:41:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:35,246 INFO L470 AbstractCegarLoop]: Abstraction has 3817 states and 4658 transitions. [2021-12-21 17:41:35,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-21 17:41:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 4658 transitions. [2021-12-21 17:41:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-21 17:41:35,248 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:35,248 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:35,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-21 17:41:35,248 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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 29 more)] === [2021-12-21 17:41:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash 713324926, now seen corresponding path program 1 times [2021-12-21 17:41:35,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402568794] [2021-12-21 17:41:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:35,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-21 17:41:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 17:41:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-21 17:41:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-21 17:41:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-21 17:41:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-21 17:41:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:35,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:35,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402568794] [2021-12-21 17:41:35,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402568794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:35,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:35,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:35,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917736163] [2021-12-21 17:41:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:35,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:35,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:35,438 INFO L87 Difference]: Start difference. First operand 3817 states and 4658 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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) [2021-12-21 17:41:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:36,612 INFO L93 Difference]: Finished difference Result 3817 states and 4658 transitions. [2021-12-21 17:41:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:36,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 144 [2021-12-21 17:41:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:36,621 INFO L225 Difference]: With dead ends: 3817 [2021-12-21 17:41:36,621 INFO L226 Difference]: Without dead ends: 3815 [2021-12-21 17:41:36,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:36,623 INFO L933 BasicCegarLoop]: 1278 mSDtfsCounter, 1867 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:36,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2028 Valid, 2950 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-21 17:41:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2021-12-21 17:41:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3815. [2021-12-21 17:41:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 2589 states have (on average 1.1583623020471225) internal successors, (2999), 2679 states have internal predecessors, (2999), 827 states have call successors, (827), 382 states have call predecessors, (827), 380 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-21 17:41:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 4655 transitions. [2021-12-21 17:41:36,832 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 4655 transitions. Word has length 144 [2021-12-21 17:41:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:36,833 INFO L470 AbstractCegarLoop]: Abstraction has 3815 states and 4655 transitions. [2021-12-21 17:41:36,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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) [2021-12-21 17:41:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 4655 transitions. [2021-12-21 17:41:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-21 17:41:36,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:36,835 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2021-12-21 17:41:36,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 17:41:36,835 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_check_for_read_sectionErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-21 17:41:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1089934537, now seen corresponding path program 1 times [2021-12-21 17:41:36,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:36,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189352542] [2021-12-21 17:41:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:36,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:36,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 17:41:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 17:41:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 17:41:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 17:41:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-21 17:41:37,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:37,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189352542] [2021-12-21 17:41:37,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189352542] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:41:37,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785197164] [2021-12-21 17:41:37,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:37,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:41:37,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:41:37,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 17:41:37,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 17:41:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:37,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 17:41:37,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:41:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-21 17:41:37,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 17:41:37,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785197164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:37,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 17:41:37,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2021-12-21 17:41:37,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032335597] [2021-12-21 17:41:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:37,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:37,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-12-21 17:41:37,791 INFO L87 Difference]: Start difference. First operand 3815 states and 4655 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-21 17:41:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:39,232 INFO L93 Difference]: Finished difference Result 3839 states and 4671 transitions. [2021-12-21 17:41:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:39,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2021-12-21 17:41:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:39,247 INFO L225 Difference]: With dead ends: 3839 [2021-12-21 17:41:39,247 INFO L226 Difference]: Without dead ends: 3837 [2021-12-21 17:41:39,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-12-21 17:41:39,250 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 1360 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:39,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 2702 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-21 17:41:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2021-12-21 17:41:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3837. [2021-12-21 17:41:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 2604 states have (on average 1.1543778801843319) internal successors, (3006), 2693 states have internal predecessors, (3006), 827 states have call successors, (827), 390 states have call predecessors, (827), 388 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-21 17:41:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4662 transitions. [2021-12-21 17:41:39,413 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4662 transitions. Word has length 153 [2021-12-21 17:41:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:39,414 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 4662 transitions. [2021-12-21 17:41:39,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-21 17:41:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4662 transitions. [2021-12-21 17:41:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-21 17:41:39,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:39,416 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2021-12-21 17:41:39,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 17:41:39,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:41:39,623 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_check_for_read_sectionErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-21 17:41:39,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:39,624 INFO L85 PathProgramCache]: Analyzing trace with hash -281219765, now seen corresponding path program 1 times [2021-12-21 17:41:39,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:39,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298544418] [2021-12-21 17:41:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:39,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 17:41:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 17:41:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 17:41:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 17:41:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-21 17:41:39,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298544418] [2021-12-21 17:41:39,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298544418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:39,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:39,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 17:41:39,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377671940] [2021-12-21 17:41:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:39,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 17:41:39,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 17:41:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:41:39,817 INFO L87 Difference]: Start difference. First operand 3837 states and 4662 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-21 17:41:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:41,346 INFO L93 Difference]: Finished difference Result 4093 states and 5002 transitions. [2021-12-21 17:41:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 17:41:41,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2021-12-21 17:41:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:41,355 INFO L225 Difference]: With dead ends: 4093 [2021-12-21 17:41:41,355 INFO L226 Difference]: Without dead ends: 4091 [2021-12-21 17:41:41,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:41:41,357 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 2321 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2501 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:41,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2501 Valid, 3388 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-21 17:41:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2021-12-21 17:41:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 3835. [2021-12-21 17:41:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3835 states, 2603 states have (on average 1.1513638109873223) internal successors, (2997), 2691 states have internal predecessors, (2997), 827 states have call successors, (827), 390 states have call predecessors, (827), 388 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-21 17:41:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 4653 transitions. [2021-12-21 17:41:41,510 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 4653 transitions. Word has length 156 [2021-12-21 17:41:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:41,510 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 4653 transitions. [2021-12-21 17:41:41,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-21 17:41:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 4653 transitions. [2021-12-21 17:41:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-21 17:41:41,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:41,513 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:41:41,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-21 17:41:41,513 INFO L402 AbstractCegarLoop]: === Iteration 24 === 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 29 more)] === [2021-12-21 17:41:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1200520837, now seen corresponding path program 1 times [2021-12-21 17:41:41,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:41,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332710591] [2021-12-21 17:41:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:41,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-21 17:41:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:41:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:41:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:41:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:41:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:41:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-21 17:41:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:41:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:41:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 17:41:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:41:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-21 17:41:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 17:41:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-21 17:41:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-21 17:41:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-21 17:41:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-21 17:41:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-21 17:41:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-21 17:41:41,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332710591] [2021-12-21 17:41:41,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332710591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:41,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:41,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:41:41,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359937482] [2021-12-21 17:41:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:41,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:41:41,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:41,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:41:41,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:41:41,697 INFO L87 Difference]: Start difference. First operand 3835 states and 4653 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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) [2021-12-21 17:41:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:41:42,942 INFO L93 Difference]: Finished difference Result 3835 states and 4653 transitions. [2021-12-21 17:41:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:41:42,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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 150 [2021-12-21 17:41:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:41:42,953 INFO L225 Difference]: With dead ends: 3835 [2021-12-21 17:41:42,953 INFO L226 Difference]: Without dead ends: 3833 [2021-12-21 17:41:42,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:41:42,955 INFO L933 BasicCegarLoop]: 1273 mSDtfsCounter, 1849 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 2945 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:41:42,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2009 Valid, 2945 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-21 17:41:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2021-12-21 17:41:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3833. [2021-12-21 17:41:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 2602 states have (on average 1.15065334358186) internal successors, (2994), 2689 states have internal predecessors, (2994), 827 states have call successors, (827), 390 states have call predecessors, (827), 388 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-21 17:41:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 4650 transitions. [2021-12-21 17:41:43,155 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 4650 transitions. Word has length 150 [2021-12-21 17:41:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:41:43,155 INFO L470 AbstractCegarLoop]: Abstraction has 3833 states and 4650 transitions. [2021-12-21 17:41:43,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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) [2021-12-21 17:41:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 4650 transitions. [2021-12-21 17:41:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-21 17:41:43,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:41:43,158 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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] [2021-12-21 17:41:43,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-21 17:41:43,158 INFO L402 AbstractCegarLoop]: === Iteration 25 === 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 29 more)] === [2021-12-21 17:41:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:41:43,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1309291226, now seen corresponding path program 2 times [2021-12-21 17:41:43,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:41:43,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477599377] [2021-12-21 17:41:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:41:43,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:41:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:41:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 17:41:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-21 17:41:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 17:41:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-21 17:41:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-21 17:41:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 17:41:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 17:41:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 17:41:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 17:41:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-21 17:41:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:41:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:41:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 17:41:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:41:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2021-12-21 17:41:43,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:41:43,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477599377] [2021-12-21 17:41:43,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477599377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:41:43,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:41:43,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 17:41:43,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887592817] [2021-12-21 17:41:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:41:43,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 17:41:43,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:41:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 17:41:43,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 17:41:43,385 INFO L87 Difference]: Start difference. First operand 3833 states and 4650 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)