./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:13:23,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:13:23,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:13:23,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:13:23,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:13:23,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:13:23,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:13:23,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:13:23,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:13:23,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:13:23,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:13:23,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:13:23,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:13:23,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:13:23,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:13:23,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:13:23,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:13:23,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:13:23,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:13:23,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:13:23,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:13:23,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:13:23,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:13:23,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:13:23,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:13:23,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:13:23,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:13:23,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:13:23,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:13:23,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:13:23,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:13:23,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:13:23,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:13:23,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:13:23,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:13:23,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:13:23,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:13:23,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:13:23,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:13:23,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:13:23,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:13:23,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 19:13:23,098 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:13:23,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:13:23,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:13:23,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:13:23,100 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:13:23,100 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:13:23,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:13:23,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:13:23,100 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:13:23,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:13:23,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:13:23,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:13:23,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 19:13:23,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:13:23,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 19:13:23,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 19:13:23,102 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:13:23,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 19:13:23,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:13:23,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:13:23,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:13:23,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:13:23,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:13:23,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:13:23,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 19:13:23,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:13:23,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:13:23,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 19:13:23,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 19:13:23,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 19:13:23,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:13:23,105 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-14 19:13:23,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:13:23,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:13:23,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:13:23,330 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:13:23,330 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:13:23,331 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-14 19:13:23,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e2ea3e9/7622c80bbbb84d3791c22c766480d88e/FLAG9382ef1ac [2021-12-14 19:13:24,030 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:13:24,030 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-14 19:13:24,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e2ea3e9/7622c80bbbb84d3791c22c766480d88e/FLAG9382ef1ac [2021-12-14 19:13:24,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e2ea3e9/7622c80bbbb84d3791c22c766480d88e [2021-12-14 19:13:24,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:13:24,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:13:24,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:13:24,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:13:24,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:13:24,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:13:24" (1/1) ... [2021-12-14 19:13:24,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddd3998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:24, skipping insertion in model container [2021-12-14 19:13:24,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:13:24" (1/1) ... [2021-12-14 19:13:24,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:13:24,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:13:26,650 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-14 19:13:26,652 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-14 19:13:26,652 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-14 19:13:26,653 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-14 19:13:26,653 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-14 19:13:26,653 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-14 19:13:26,654 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-14 19:13:26,654 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-14 19:13:26,654 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-14 19:13:26,655 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-14 19:13:26,655 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-14 19:13:26,655 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-14 19:13:26,655 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-14 19:13:26,656 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-14 19:13:26,656 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-14 19:13:26,656 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-14 19:13:26,657 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-14 19:13:26,657 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-14 19:13:26,657 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-14 19:13:26,658 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-14 19:13:26,658 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-14 19:13:26,658 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-14 19:13:26,658 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-14 19:13:26,659 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-14 19:13:26,659 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-14 19:13:26,659 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-14 19:13:26,660 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-14 19:13:26,661 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-14 19:13:26,661 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-14 19:13:26,661 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-14 19:13:26,661 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-14 19:13:26,662 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-14 19:13:26,662 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-14 19:13:26,662 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-14 19:13:26,663 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-14 19:13:26,680 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-14 19:13:26,681 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-14 19:13:26,681 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-14 19:13:26,681 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-14 19:13:26,682 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-14 19:13:26,682 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-14 19:13:26,682 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-14 19:13:26,683 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-14 19:13:26,683 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-14 19:13:26,683 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-14 19:13:26,684 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-14 19:13:26,684 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-14 19:13:26,684 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-14 19:13:26,685 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-14 19:13:26,685 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-14 19:13:26,685 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-14 19:13:26,686 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-14 19:13:26,686 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-14 19:13:26,686 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-14 19:13:26,686 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-14 19:13:26,687 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-14 19:13:26,687 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-14 19:13:26,687 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-14 19:13:26,688 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-14 19:13:26,688 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-14 19:13:26,688 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-14 19:13:26,689 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-14 19:13:26,689 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-14 19:13:26,689 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-14 19:13:26,689 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-14 19:13:26,690 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-14 19:13:26,690 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-14 19:13:26,690 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-14 19:13:26,691 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-14 19:13:26,691 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-14 19:13:26,691 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-14 19:13:26,691 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-14 19:13:26,692 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-14 19:13:26,692 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-14 19:13:26,692 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-14 19:13:26,693 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-14 19:13:26,693 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-14 19:13:26,693 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-14 19:13:26,694 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-14 19:13:26,694 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-14 19:13:26,694 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-14 19:13:26,694 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-14 19:13:26,695 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-14 19:13:26,695 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-14 19:13:26,695 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-14 19:13:26,696 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-14 19:13:26,696 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-14 19:13:26,696 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-14 19:13:26,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:13:26,720 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:13:26,966 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-14 19:13:26,968 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-14 19:13:26,968 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-14 19:13:26,969 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-14 19:13:26,972 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-14 19:13:26,972 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-14 19:13:26,973 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-14 19:13:26,974 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-14 19:13:26,974 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-14 19:13:26,975 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-14 19:13:26,975 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-14 19:13:26,975 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-14 19:13:26,976 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-14 19:13:26,976 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-14 19:13:26,976 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-14 19:13:26,976 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-14 19:13:26,977 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-14 19:13:26,977 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-14 19:13:26,977 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-14 19:13:26,977 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-14 19:13:26,978 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-14 19:13:26,978 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-14 19:13:26,978 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-14 19:13:26,978 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-14 19:13:26,979 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-14 19:13:26,979 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-14 19:13:26,980 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-14 19:13:26,980 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-14 19:13:26,980 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-14 19:13:26,981 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-14 19:13:26,981 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-14 19:13:26,981 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-14 19:13:26,981 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-14 19:13:26,982 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-14 19:13:26,982 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-14 19:13:26,982 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-14 19:13:26,983 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-14 19:13:26,984 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-14 19:13:26,984 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-14 19:13:27,000 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-14 19:13:27,001 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-14 19:13:27,002 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-14 19:13:27,003 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-14 19:13:27,003 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-14 19:13:27,003 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-14 19:13:27,003 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-14 19:13:27,004 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-14 19:13:27,004 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-14 19:13:27,004 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-14 19:13:27,005 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-14 19:13:27,005 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-14 19:13:27,005 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-14 19:13:27,006 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-14 19:13:27,006 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-14 19:13:27,006 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-14 19:13:27,006 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-14 19:13:27,007 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-14 19:13:27,007 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-14 19:13:27,007 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-14 19:13:27,008 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-14 19:13:27,008 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-14 19:13:27,009 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-14 19:13:27,009 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-14 19:13:27,011 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-14 19:13:27,011 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-14 19:13:27,012 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-14 19:13:27,012 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-14 19:13:27,015 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-14 19:13:27,016 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-14 19:13:27,017 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-14 19:13:27,017 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-14 19:13:27,017 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-14 19:13:27,021 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-14 19:13:27,022 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-14 19:13:27,022 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-14 19:13:27,022 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-14 19:13:27,022 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-14 19:13:27,023 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-14 19:13:27,023 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-14 19:13:27,024 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-14 19:13:27,024 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-14 19:13:27,025 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-14 19:13:27,026 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-14 19:13:27,026 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-14 19:13:27,026 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-14 19:13:27,026 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-14 19:13:27,027 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-14 19:13:27,029 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-14 19:13:27,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:13:27,148 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:13:27,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27 WrapperNode [2021-12-14 19:13:27,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:13:27,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:13:27,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:13:27,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:13:27,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,369 INFO L137 Inliner]: procedures = 616, calls = 1459, calls flagged for inlining = 273, calls inlined = 178, statements flattened = 2640 [2021-12-14 19:13:27,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:13:27,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:13:27,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:13:27,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:13:27,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:13:27,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:13:27,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:13:27,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:13:27,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (1/1) ... [2021-12-14 19:13:27,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:13:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:13:27,572 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-14 19:13:27,586 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-14 19:13:27,596 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2021-12-14 19:13:27,596 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2021-12-14 19:13:27,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:13:27,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:13:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2021-12-14 19:13:27,597 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2021-12-14 19:13:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-14 19:13:27,597 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-14 19:13:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2021-12-14 19:13:27,597 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2021-12-14 19:13:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-14 19:13:27,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-14 19:13:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:13:27,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:13:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-14 19:13:27,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-14 19:13:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2021-12-14 19:13:27,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2021-12-14 19:13:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2021-12-14 19:13:27,598 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2021-12-14 19:13:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2021-12-14 19:13:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2021-12-14 19:13:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:13:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:13:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2021-12-14 19:13:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2021-12-14 19:13:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:13:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:13:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-12-14 19:13:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-12-14 19:13:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-14 19:13:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-14 19:13:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2021-12-14 19:13:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2021-12-14 19:13:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-14 19:13:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-14 19:13:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:13:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:13:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:13:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2021-12-14 19:13:27,601 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2021-12-14 19:13:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:13:27,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:13:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-12-14 19:13:27,601 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-12-14 19:13:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-12-14 19:13:27,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-12-14 19:13:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-14 19:13:27,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-14 19:13:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-14 19:13:27,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-14 19:13:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2021-12-14 19:13:27,602 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2021-12-14 19:13:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:13:27,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:13:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:13:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:13:27,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:13:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:13:27,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:13:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2021-12-14 19:13:27,603 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2021-12-14 19:13:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2021-12-14 19:13:27,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2021-12-14 19:13:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:13:27,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:13:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2021-12-14 19:13:27,604 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2021-12-14 19:13:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2021-12-14 19:13:27,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2021-12-14 19:13:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:13:27,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:13:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2021-12-14 19:13:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2021-12-14 19:13:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:13:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:13:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-14 19:13:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-14 19:13:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:13:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2021-12-14 19:13:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2021-12-14 19:13:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:13:27,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:13:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:13:27,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:13:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2021-12-14 19:13:27,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2021-12-14 19:13:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-12-14 19:13:27,606 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-12-14 19:13:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2021-12-14 19:13:27,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2021-12-14 19:13:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-12-14 19:13:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-14 19:13:27,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-14 19:13:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-14 19:13:27,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-14 19:13:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2021-12-14 19:13:27,607 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2021-12-14 19:13:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2021-12-14 19:13:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2021-12-14 19:13:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2021-12-14 19:13:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2021-12-14 19:13:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2021-12-14 19:13:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2021-12-14 19:13:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-12-14 19:13:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-12-14 19:13:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2021-12-14 19:13:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2021-12-14 19:13:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:13:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:13:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2021-12-14 19:13:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2021-12-14 19:13:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2021-12-14 19:13:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2021-12-14 19:13:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:13:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:13:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:13:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:13:27,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:13:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:13:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2021-12-14 19:13:27,610 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2021-12-14 19:13:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:13:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2021-12-14 19:13:27,610 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2021-12-14 19:13:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2021-12-14 19:13:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2021-12-14 19:13:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-12-14 19:13:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-12-14 19:13:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:13:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:13:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2021-12-14 19:13:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2021-12-14 19:13:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-14 19:13:27,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-14 19:13:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-14 19:13:27,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-14 19:13:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:13:27,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:13:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:13:27,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:13:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2021-12-14 19:13:27,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2021-12-14 19:13:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2021-12-14 19:13:27,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2021-12-14 19:13:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2021-12-14 19:13:27,613 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2021-12-14 19:13:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2021-12-14 19:13:27,613 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2021-12-14 19:13:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:13:27,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:13:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-14 19:13:27,614 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-14 19:13:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:13:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:13:27,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:13:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-14 19:13:27,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-14 19:13:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:13:27,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:13:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2021-12-14 19:13:27,615 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2021-12-14 19:13:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2021-12-14 19:13:27,615 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2021-12-14 19:13:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2021-12-14 19:13:27,615 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2021-12-14 19:13:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2021-12-14 19:13:27,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2021-12-14 19:13:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-14 19:13:27,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-14 19:13:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2021-12-14 19:13:27,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2021-12-14 19:13:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:13:27,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:13:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2021-12-14 19:13:27,616 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2021-12-14 19:13:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:13:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2021-12-14 19:13:27,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2021-12-14 19:13:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2021-12-14 19:13:27,617 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2021-12-14 19:13:28,010 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:13:28,012 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:13:28,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-14 19:13:29,129 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:13:29,139 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:13:29,139 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 19:13:29,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:13:29 BoogieIcfgContainer [2021-12-14 19:13:29,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:13:29,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:13:29,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:13:29,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:13:29,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:13:24" (1/3) ... [2021-12-14 19:13:29,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15691d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:13:29, skipping insertion in model container [2021-12-14 19:13:29,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:13:27" (2/3) ... [2021-12-14 19:13:29,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15691d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:13:29, skipping insertion in model container [2021-12-14 19:13:29,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:13:29" (3/3) ... [2021-12-14 19:13:29,150 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-12-14 19:13:29,154 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:13:29,154 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-12-14 19:13:29,200 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:13:29,205 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-14 19:13:29,206 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-12-14 19:13:29,247 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-14 19:13:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 19:13:29,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:29,257 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-14 19:13:29,257 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-14 19:13:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash -138799992, now seen corresponding path program 1 times [2021-12-14 19:13:29,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:29,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805903512] [2021-12-14 19:13:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:29,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,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-14 19:13:29,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:29,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805903512] [2021-12-14 19:13:29,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805903512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:29,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:29,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:29,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417090748] [2021-12-14 19:13:29,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:29,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:29,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:29,733 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-14 19:13:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:31,076 INFO L93 Difference]: Finished difference Result 2200 states and 2931 transitions. [2021-12-14 19:13:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:31,078 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-14 19:13:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:31,115 INFO L225 Difference]: With dead ends: 2200 [2021-12-14 19:13:31,115 INFO L226 Difference]: Without dead ends: 1093 [2021-12-14 19:13:31,144 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-14 19:13:31,151 INFO L933 BasicCegarLoop]: 1319 mSDtfsCounter, 1961 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:31,152 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.1s Time] [2021-12-14 19:13:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-12-14 19:13:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2021-12-14 19:13:31,257 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-14 19:13:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1375 transitions. [2021-12-14 19:13:31,264 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1375 transitions. Word has length 70 [2021-12-14 19:13:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:31,265 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 1375 transitions. [2021-12-14 19:13:31,265 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-14 19:13:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1375 transitions. [2021-12-14 19:13:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-14 19:13:31,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:31,268 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-14 19:13:31,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:13:31,268 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-14 19:13:31,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash 333096518, now seen corresponding path program 1 times [2021-12-14 19:13:31,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:31,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479372304] [2021-12-14 19:13:31,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:31,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:31,429 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-14 19:13:31,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:31,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479372304] [2021-12-14 19:13:31,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479372304] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:31,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:31,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:31,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107825288] [2021-12-14 19:13:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:31,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:31,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:31,431 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-14 19:13:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:32,508 INFO L93 Difference]: Finished difference Result 1093 states and 1375 transitions. [2021-12-14 19:13:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:32,508 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-14 19:13:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:32,514 INFO L225 Difference]: With dead ends: 1093 [2021-12-14 19:13:32,515 INFO L226 Difference]: Without dead ends: 1091 [2021-12-14 19:13:32,515 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-14 19:13:32,518 INFO L933 BasicCegarLoop]: 1299 mSDtfsCounter, 1927 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:32,518 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.0s Time] [2021-12-14 19:13:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-12-14 19:13:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2021-12-14 19:13:32,568 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-14 19:13:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1373 transitions. [2021-12-14 19:13:32,575 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1373 transitions. Word has length 76 [2021-12-14 19:13:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:32,577 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 1373 transitions. [2021-12-14 19:13:32,577 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-14 19:13:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1373 transitions. [2021-12-14 19:13:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-14 19:13:32,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:32,585 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-14 19:13:32,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:13:32,585 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-14 19:13:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1375714423, now seen corresponding path program 1 times [2021-12-14 19:13:32,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:32,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745941315] [2021-12-14 19:13:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:32,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,836 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-14 19:13:32,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:32,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745941315] [2021-12-14 19:13:32,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745941315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:32,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:32,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:32,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761221823] [2021-12-14 19:13:32,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:32,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:32,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:32,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:32,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:32,839 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-14 19:13:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:33,977 INFO L93 Difference]: Finished difference Result 1091 states and 1373 transitions. [2021-12-14 19:13:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:33,978 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-14 19:13:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:33,984 INFO L225 Difference]: With dead ends: 1091 [2021-12-14 19:13:33,984 INFO L226 Difference]: Without dead ends: 1089 [2021-12-14 19:13:33,985 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-14 19:13:33,987 INFO L933 BasicCegarLoop]: 1297 mSDtfsCounter, 1921 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:33,990 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.0s Time] [2021-12-14 19:13:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-12-14 19:13:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2021-12-14 19:13:34,029 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-14 19:13:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1371 transitions. [2021-12-14 19:13:34,033 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1371 transitions. Word has length 82 [2021-12-14 19:13:34,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:34,035 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 1371 transitions. [2021-12-14 19:13:34,035 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-14 19:13:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1371 transitions. [2021-12-14 19:13:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-14 19:13:34,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:34,037 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-14 19:13:34,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:13:34,038 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-14 19:13:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:34,038 INFO L85 PathProgramCache]: Analyzing trace with hash -62631502, now seen corresponding path program 1 times [2021-12-14 19:13:34,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:34,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248591116] [2021-12-14 19:13:34,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:34,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:13:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-14 19:13:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-14 19:13:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-14 19:13:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:34,247 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-14 19:13:34,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248591116] [2021-12-14 19:13:34,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248591116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:34,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:34,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:34,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588711527] [2021-12-14 19:13:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:34,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:34,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:34,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:34,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:34,250 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-14 19:13:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:35,783 INFO L93 Difference]: Finished difference Result 1862 states and 2308 transitions. [2021-12-14 19:13:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:13:35,784 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-14 19:13:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:35,792 INFO L225 Difference]: With dead ends: 1862 [2021-12-14 19:13:35,792 INFO L226 Difference]: Without dead ends: 1860 [2021-12-14 19:13:35,794 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-14 19:13:35,795 INFO L933 BasicCegarLoop]: 1567 mSDtfsCounter, 1359 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:35,796 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.3s Time] [2021-12-14 19:13:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2021-12-14 19:13:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1597. [2021-12-14 19:13:35,917 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-14 19:13:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2009 transitions. [2021-12-14 19:13:35,925 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2009 transitions. Word has length 97 [2021-12-14 19:13:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:35,926 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2009 transitions. [2021-12-14 19:13:35,926 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-14 19:13:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2009 transitions. [2021-12-14 19:13:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-14 19:13:35,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:35,931 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-14 19:13:35,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:13:35,931 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-14 19:13:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash 591565888, now seen corresponding path program 1 times [2021-12-14 19:13:35,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:35,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296721015] [2021-12-14 19:13:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:35,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:36,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-14 19:13:36,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:36,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296721015] [2021-12-14 19:13:36,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296721015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:36,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:36,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:36,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366908605] [2021-12-14 19:13:36,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:36,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:36,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:36,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:36,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:36,254 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-14 19:13:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:37,298 INFO L93 Difference]: Finished difference Result 1597 states and 2009 transitions. [2021-12-14 19:13:37,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:37,298 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-14 19:13:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:37,305 INFO L225 Difference]: With dead ends: 1597 [2021-12-14 19:13:37,305 INFO L226 Difference]: Without dead ends: 1595 [2021-12-14 19:13:37,306 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-14 19:13:37,306 INFO L933 BasicCegarLoop]: 1295 mSDtfsCounter, 1915 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:37,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2085 Valid, 2967 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 19:13:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-12-14 19:13:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595. [2021-12-14 19:13:37,398 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-14 19:13:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2007 transitions. [2021-12-14 19:13:37,419 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2007 transitions. Word has length 88 [2021-12-14 19:13:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:37,420 INFO L470 AbstractCegarLoop]: Abstraction has 1595 states and 2007 transitions. [2021-12-14 19:13:37,420 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-14 19:13:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2007 transitions. [2021-12-14 19:13:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-14 19:13:37,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:37,421 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-14 19:13:37,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:13:37,422 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-14 19:13:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -56363973, now seen corresponding path program 1 times [2021-12-14 19:13:37,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:37,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680578306] [2021-12-14 19:13:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:37,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:37,563 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-14 19:13:37,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680578306] [2021-12-14 19:13:37,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680578306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:37,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:37,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:37,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452199263] [2021-12-14 19:13:37,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:37,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:37,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:37,565 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-14 19:13:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:38,643 INFO L93 Difference]: Finished difference Result 1595 states and 2007 transitions. [2021-12-14 19:13:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:38,643 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-14 19:13:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:38,649 INFO L225 Difference]: With dead ends: 1595 [2021-12-14 19:13:38,649 INFO L226 Difference]: Without dead ends: 1593 [2021-12-14 19:13:38,650 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-14 19:13:38,650 INFO L933 BasicCegarLoop]: 1293 mSDtfsCounter, 1909 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:38,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2078 Valid, 2965 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 19:13:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2021-12-14 19:13:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1593. [2021-12-14 19:13:38,737 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-14 19:13:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2005 transitions. [2021-12-14 19:13:38,758 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2005 transitions. Word has length 94 [2021-12-14 19:13:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:38,758 INFO L470 AbstractCegarLoop]: Abstraction has 1593 states and 2005 transitions. [2021-12-14 19:13:38,758 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-14 19:13:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2005 transitions. [2021-12-14 19:13:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 19:13:38,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:38,760 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-14 19:13:38,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:13:38,760 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-14 19:13:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash 915527194, now seen corresponding path program 1 times [2021-12-14 19:13:38,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:38,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913257706] [2021-12-14 19:13:38,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:38,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:38,926 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-14 19:13:38,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:38,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913257706] [2021-12-14 19:13:38,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913257706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:38,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:38,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:38,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860181962] [2021-12-14 19:13:38,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:38,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:38,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:38,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:38,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:38,928 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-14 19:13:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:40,194 INFO L93 Difference]: Finished difference Result 1593 states and 2005 transitions. [2021-12-14 19:13:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:40,195 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-14 19:13:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:40,201 INFO L225 Difference]: With dead ends: 1593 [2021-12-14 19:13:40,201 INFO L226 Difference]: Without dead ends: 1591 [2021-12-14 19:13:40,202 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-14 19:13:40,202 INFO L933 BasicCegarLoop]: 1291 mSDtfsCounter, 1903 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:40,202 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.1s Time] [2021-12-14 19:13:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2021-12-14 19:13:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2021-12-14 19:13:40,256 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-14 19:13:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2003 transitions. [2021-12-14 19:13:40,267 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2003 transitions. Word has length 100 [2021-12-14 19:13:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:40,267 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2003 transitions. [2021-12-14 19:13:40,267 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-14 19:13:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2003 transitions. [2021-12-14 19:13:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-14 19:13:40,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:40,270 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-14 19:13:40,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:13:40,270 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-14 19:13:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:40,270 INFO L85 PathProgramCache]: Analyzing trace with hash 178536448, now seen corresponding path program 1 times [2021-12-14 19:13:40,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:40,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762090032] [2021-12-14 19:13:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:40,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,442 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-14 19:13:40,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:40,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762090032] [2021-12-14 19:13:40,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762090032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:40,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:40,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:40,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341603461] [2021-12-14 19:13:40,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:40,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:40,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:40,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:40,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:40,444 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-14 19:13:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:41,673 INFO L93 Difference]: Finished difference Result 1591 states and 2003 transitions. [2021-12-14 19:13:41,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:41,673 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-14 19:13:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:41,678 INFO L225 Difference]: With dead ends: 1591 [2021-12-14 19:13:41,678 INFO L226 Difference]: Without dead ends: 1589 [2021-12-14 19:13:41,679 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-14 19:13:41,679 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.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:41,679 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.1s Time] [2021-12-14 19:13:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-12-14 19:13:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2021-12-14 19:13:41,727 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-14 19:13:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2001 transitions. [2021-12-14 19:13:41,733 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2001 transitions. Word has length 106 [2021-12-14 19:13:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:41,734 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 2001 transitions. [2021-12-14 19:13:41,734 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-14 19:13:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2001 transitions. [2021-12-14 19:13:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-14 19:13:41,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:41,736 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-14 19:13:41,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:13:41,736 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-14 19:13:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1037707720, now seen corresponding path program 1 times [2021-12-14 19:13:41,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43210811] [2021-12-14 19:13:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:41,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:13:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:13:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:13:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:13:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,950 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-14 19:13:41,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:41,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43210811] [2021-12-14 19:13:41,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43210811] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:41,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:41,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:13:41,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982558354] [2021-12-14 19:13:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:41,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:13:41,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:41,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:13:41,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:13:41,953 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-14 19:13:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:43,810 INFO L93 Difference]: Finished difference Result 1869 states and 2334 transitions. [2021-12-14 19:13:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:13:43,811 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-14 19:13:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:43,817 INFO L225 Difference]: With dead ends: 1869 [2021-12-14 19:13:43,818 INFO L226 Difference]: Without dead ends: 1867 [2021-12-14 19:13:43,818 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-14 19:13:43,820 INFO L933 BasicCegarLoop]: 1395 mSDtfsCounter, 1888 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:43,820 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.7s Time] [2021-12-14 19:13:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2021-12-14 19:13:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1759. [2021-12-14 19:13:43,875 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-14 19:13:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2198 transitions. [2021-12-14 19:13:43,881 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2198 transitions. Word has length 118 [2021-12-14 19:13:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:43,882 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2198 transitions. [2021-12-14 19:13:43,882 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-14 19:13:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2198 transitions. [2021-12-14 19:13:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-14 19:13:43,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:43,884 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-14 19:13:43,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:13:43,884 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-14 19:13:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1083405284, now seen corresponding path program 1 times [2021-12-14 19:13:43,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:43,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966098640] [2021-12-14 19:13:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:43,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:43,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:44,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:44,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:44,029 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-14 19:13:44,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:44,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966098640] [2021-12-14 19:13:44,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966098640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:44,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:44,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:44,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954017037] [2021-12-14 19:13:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:44,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:44,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:44,032 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-14 19:13:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:45,292 INFO L93 Difference]: Finished difference Result 1759 states and 2198 transitions. [2021-12-14 19:13:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:45,293 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-14 19:13:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:45,300 INFO L225 Difference]: With dead ends: 1759 [2021-12-14 19:13:45,300 INFO L226 Difference]: Without dead ends: 1757 [2021-12-14 19:13:45,302 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-14 19:13:45,303 INFO L933 BasicCegarLoop]: 1287 mSDtfsCounter, 1895 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:45,303 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.1s Time] [2021-12-14 19:13:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2021-12-14 19:13:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2021-12-14 19:13:45,405 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-14 19:13:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2196 transitions. [2021-12-14 19:13:45,410 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2196 transitions. Word has length 112 [2021-12-14 19:13:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:45,410 INFO L470 AbstractCegarLoop]: Abstraction has 1757 states and 2196 transitions. [2021-12-14 19:13:45,410 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-14 19:13:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2196 transitions. [2021-12-14 19:13:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-14 19:13:45,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:45,412 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-14 19:13:45,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:13:45,412 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-14 19:13:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 392296454, now seen corresponding path program 1 times [2021-12-14 19:13:45,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106884355] [2021-12-14 19:13:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:45,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:13:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:13:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:13:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 19:13:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:13:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-14 19:13:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:45,796 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-14 19:13:45,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:45,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106884355] [2021-12-14 19:13:45,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106884355] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:13:45,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891807516] [2021-12-14 19:13:45,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:45,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:13:45,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:13:45,798 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-14 19:13:45,827 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-14 19:13:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:46,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:13:46,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:13:46,478 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-14 19:13:46,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:13:46,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891807516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:46,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:13:46,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2021-12-14 19:13:46,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398595941] [2021-12-14 19:13:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:46,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:13:46,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:13:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:13:46,480 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-14 19:13:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:46,641 INFO L93 Difference]: Finished difference Result 3405 states and 4242 transitions. [2021-12-14 19:13:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:13:46,642 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-14 19:13:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:46,651 INFO L225 Difference]: With dead ends: 3405 [2021-12-14 19:13:46,651 INFO L226 Difference]: Without dead ends: 1805 [2021-12-14 19:13:46,656 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-14 19:13:46,657 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-14 19:13:46,657 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-14 19:13:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2021-12-14 19:13:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1763. [2021-12-14 19:13:46,732 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-14 19:13:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2204 transitions. [2021-12-14 19:13:46,737 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2204 transitions. Word has length 134 [2021-12-14 19:13:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:46,739 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 2204 transitions. [2021-12-14 19:13:46,739 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-14 19:13:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2204 transitions. [2021-12-14 19:13:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-14 19:13:46,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:46,741 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-14 19:13:46,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:13:46,955 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-14 19:13:46,955 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-14 19:13:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:46,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1770258305, now seen corresponding path program 1 times [2021-12-14 19:13:46,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:46,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012548472] [2021-12-14 19:13:46,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:46,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:47,275 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-14 19:13:47,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:47,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012548472] [2021-12-14 19:13:47,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012548472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:47,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:47,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:47,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699334993] [2021-12-14 19:13:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:47,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:47,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:47,277 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-14 19:13:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:48,565 INFO L93 Difference]: Finished difference Result 1763 states and 2204 transitions. [2021-12-14 19:13:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:48,565 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-14 19:13:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:48,571 INFO L225 Difference]: With dead ends: 1763 [2021-12-14 19:13:48,571 INFO L226 Difference]: Without dead ends: 1761 [2021-12-14 19:13:48,572 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-14 19:13:48,573 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-14 19:13:48,573 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-14 19:13:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2021-12-14 19:13:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2021-12-14 19:13:48,635 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-14 19:13:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2202 transitions. [2021-12-14 19:13:48,639 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2202 transitions. Word has length 114 [2021-12-14 19:13:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:48,640 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 2202 transitions. [2021-12-14 19:13:48,640 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-14 19:13:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2202 transitions. [2021-12-14 19:13:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-14 19:13:48,641 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:48,641 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-14 19:13:48,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:13:48,642 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-14 19:13:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1352940516, now seen corresponding path program 1 times [2021-12-14 19:13:48,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:48,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078471691] [2021-12-14 19:13:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:48,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:13:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:48,780 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-14 19:13:48,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:48,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078471691] [2021-12-14 19:13:48,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078471691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:48,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:48,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:48,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645237062] [2021-12-14 19:13:48,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:48,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:48,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:48,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:48,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:48,782 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-14 19:13:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:50,522 INFO L93 Difference]: Finished difference Result 2666 states and 3269 transitions. [2021-12-14 19:13:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:13:50,522 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-14 19:13:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:50,531 INFO L225 Difference]: With dead ends: 2666 [2021-12-14 19:13:50,531 INFO L226 Difference]: Without dead ends: 2664 [2021-12-14 19:13:50,532 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-14 19:13:50,533 INFO L933 BasicCegarLoop]: 1377 mSDtfsCounter, 2664 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 1199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:50,533 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.6s Time] [2021-12-14 19:13:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-12-14 19:13:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2619. [2021-12-14 19:13:50,620 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-14 19:13:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3243 transitions. [2021-12-14 19:13:50,627 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3243 transitions. Word has length 120 [2021-12-14 19:13:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:50,627 INFO L470 AbstractCegarLoop]: Abstraction has 2619 states and 3243 transitions. [2021-12-14 19:13:50,627 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-14 19:13:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3243 transitions. [2021-12-14 19:13:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-14 19:13:50,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:50,629 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-14 19:13:50,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:13:50,629 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-14 19:13:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:50,630 INFO L85 PathProgramCache]: Analyzing trace with hash -179191031, now seen corresponding path program 1 times [2021-12-14 19:13:50,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:50,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899918008] [2021-12-14 19:13:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:50,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:13:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:50,767 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-14 19:13:50,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:50,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899918008] [2021-12-14 19:13:50,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899918008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:50,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:50,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:50,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109330702] [2021-12-14 19:13:50,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:50,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:50,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:50,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:50,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:50,770 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-14 19:13:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:52,672 INFO L93 Difference]: Finished difference Result 3726 states and 4547 transitions. [2021-12-14 19:13:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:13:52,673 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-14 19:13:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:52,687 INFO L225 Difference]: With dead ends: 3726 [2021-12-14 19:13:52,687 INFO L226 Difference]: Without dead ends: 3724 [2021-12-14 19:13:52,689 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-14 19:13:52,690 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.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:52,690 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.7s Time] [2021-12-14 19:13:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2021-12-14 19:13:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3583. [2021-12-14 19:13:52,885 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-14 19:13:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4407 transitions. [2021-12-14 19:13:52,897 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4407 transitions. Word has length 126 [2021-12-14 19:13:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:52,897 INFO L470 AbstractCegarLoop]: Abstraction has 3583 states and 4407 transitions. [2021-12-14 19:13:52,898 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-14 19:13:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4407 transitions. [2021-12-14 19:13:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-14 19:13:52,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:52,900 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-14 19:13:52,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:13:52,900 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-14 19:13:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -31471526, now seen corresponding path program 1 times [2021-12-14 19:13:52,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:52,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853928767] [2021-12-14 19:13:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:52,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:13:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:13:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:13:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:13:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-14 19:13:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:13:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:53,065 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-14 19:13:53,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:53,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853928767] [2021-12-14 19:13:53,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853928767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:53,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:53,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:53,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975086954] [2021-12-14 19:13:53,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:53,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:53,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:53,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:53,068 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-14 19:13:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:54,401 INFO L93 Difference]: Finished difference Result 6578 states and 8094 transitions. [2021-12-14 19:13:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:54,402 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-14 19:13:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:54,419 INFO L225 Difference]: With dead ends: 6578 [2021-12-14 19:13:54,420 INFO L226 Difference]: Without dead ends: 3850 [2021-12-14 19:13:54,435 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-14 19:13:54,436 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1339 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:54,437 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.1s Time] [2021-12-14 19:13:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2021-12-14 19:13:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3584. [2021-12-14 19:13:54,673 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-14 19:13:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4408 transitions. [2021-12-14 19:13:54,682 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4408 transitions. Word has length 141 [2021-12-14 19:13:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:54,682 INFO L470 AbstractCegarLoop]: Abstraction has 3584 states and 4408 transitions. [2021-12-14 19:13:54,683 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-14 19:13:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4408 transitions. [2021-12-14 19:13:54,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-14 19:13:54,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:54,684 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-14 19:13:54,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:13:54,685 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-14 19:13:54,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:54,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1628899092, now seen corresponding path program 1 times [2021-12-14 19:13:54,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:54,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945807662] [2021-12-14 19:13:54,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:54,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:13:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:13:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:13:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:13:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:13:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:54,835 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-14 19:13:54,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:54,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945807662] [2021-12-14 19:13:54,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945807662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:54,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:54,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:54,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502797960] [2021-12-14 19:13:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:54,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:54,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:54,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:54,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:54,837 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-14 19:13:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:55,771 INFO L93 Difference]: Finished difference Result 3584 states and 4408 transitions. [2021-12-14 19:13:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:55,771 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-14 19:13:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:55,782 INFO L225 Difference]: With dead ends: 3584 [2021-12-14 19:13:55,783 INFO L226 Difference]: Without dead ends: 3582 [2021-12-14 19:13:55,784 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-14 19:13:55,784 INFO L933 BasicCegarLoop]: 1282 mSDtfsCounter, 1879 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:55,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2042 Valid, 2954 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 19:13:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2021-12-14 19:13:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3582. [2021-12-14 19:13:55,956 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-14 19:13:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4405 transitions. [2021-12-14 19:13:55,963 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4405 transitions. Word has length 132 [2021-12-14 19:13:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:55,964 INFO L470 AbstractCegarLoop]: Abstraction has 3582 states and 4405 transitions. [2021-12-14 19:13:55,964 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-14 19:13:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4405 transitions. [2021-12-14 19:13:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-14 19:13:55,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:55,966 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-14 19:13:55,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:13:55,967 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-14 19:13:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1350192956, now seen corresponding path program 1 times [2021-12-14 19:13:55,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:55,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63801867] [2021-12-14 19:13:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:55,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:13:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:13:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:13:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:13:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-14 19:13:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:13:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,129 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-14 19:13:56,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63801867] [2021-12-14 19:13:56,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63801867] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:13:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680735791] [2021-12-14 19:13:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:56,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:13:56,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:13:56,134 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-14 19:13:56,135 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-14 19:13:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:56,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:13:56,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:13:56,658 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-14 19:13:56,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:13:56,906 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-14 19:13:56,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680735791] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:13:56,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:13:56,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2021-12-14 19:13:56,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446905176] [2021-12-14 19:13:56,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:13:56,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:13:56,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:56,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:13:56,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:56,908 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-14 19:13:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:58,571 INFO L93 Difference]: Finished difference Result 6598 states and 8126 transitions. [2021-12-14 19:13:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:13:58,572 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-14 19:13:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:58,582 INFO L225 Difference]: With dead ends: 6598 [2021-12-14 19:13:58,582 INFO L226 Difference]: Without dead ends: 3871 [2021-12-14 19:13:58,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:13:58,589 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1390 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 1032 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:58,589 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.5s Time] [2021-12-14 19:13:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2021-12-14 19:13:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3615. [2021-12-14 19:13:58,717 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-14 19:13:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4453 transitions. [2021-12-14 19:13:58,726 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4453 transitions. Word has length 146 [2021-12-14 19:13:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:58,727 INFO L470 AbstractCegarLoop]: Abstraction has 3615 states and 4453 transitions. [2021-12-14 19:13:58,727 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-14 19:13:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4453 transitions. [2021-12-14 19:13:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-14 19:13:58,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:58,729 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-14 19:13:58,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 19:13:58,943 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-14 19:13:58,943 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-14 19:13:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 216200491, now seen corresponding path program 1 times [2021-12-14 19:13:58,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:58,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203752778] [2021-12-14 19:13:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:58,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:13:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:13:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:13:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:13:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-14 19:13:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:13:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:59,131 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-14 19:13:59,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:59,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203752778] [2021-12-14 19:13:59,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203752778] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:59,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:59,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:13:59,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380723476] [2021-12-14 19:13:59,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:59,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:13:59,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:13:59,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:13:59,133 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-14 19:14:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:01,426 INFO L93 Difference]: Finished difference Result 3915 states and 4825 transitions. [2021-12-14 19:14:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:14:01,427 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-14 19:14:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:01,436 INFO L225 Difference]: With dead ends: 3915 [2021-12-14 19:14:01,436 INFO L226 Difference]: Without dead ends: 3913 [2021-12-14 19:14:01,437 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-14 19:14:01,438 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:14:01,438 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.0s Time] [2021-12-14 19:14:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2021-12-14 19:14:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3615. [2021-12-14 19:14:01,555 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-14 19:14:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4450 transitions. [2021-12-14 19:14:01,562 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4450 transitions. Word has length 147 [2021-12-14 19:14:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:01,563 INFO L470 AbstractCegarLoop]: Abstraction has 3615 states and 4450 transitions. [2021-12-14 19:14:01,563 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-14 19:14:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4450 transitions. [2021-12-14 19:14:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-14 19:14:01,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:01,564 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-14 19:14:01,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:14:01,565 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-14 19:14:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash -973056597, now seen corresponding path program 1 times [2021-12-14 19:14:01,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:01,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952361912] [2021-12-14 19:14:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:01,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:14:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:14:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:14:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:14:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:14:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:14:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:14:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:14:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:14:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:14:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:14:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:14:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:14:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:14:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:14:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:14:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:01,729 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-14 19:14:01,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:01,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952361912] [2021-12-14 19:14:01,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952361912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:01,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:01,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:14:01,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122813958] [2021-12-14 19:14:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:01,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:14:01,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:01,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:14:01,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:14:01,732 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-14 19:14:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:03,580 INFO L93 Difference]: Finished difference Result 3948 states and 4802 transitions. [2021-12-14 19:14:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:14:03,580 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-14 19:14:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:03,590 INFO L225 Difference]: With dead ends: 3948 [2021-12-14 19:14:03,590 INFO L226 Difference]: Without dead ends: 3946 [2021-12-14 19:14:03,591 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-14 19:14:03,592 INFO L933 BasicCegarLoop]: 1533 mSDtfsCounter, 1819 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 1066 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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-14 19:14:03,592 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-14 19:14:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-12-14 19:14:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3819. [2021-12-14 19:14:03,777 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-14 19:14:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4667 transitions. [2021-12-14 19:14:03,786 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4667 transitions. Word has length 138 [2021-12-14 19:14:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:03,786 INFO L470 AbstractCegarLoop]: Abstraction has 3819 states and 4667 transitions. [2021-12-14 19:14:03,786 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-14 19:14:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4667 transitions. [2021-12-14 19:14:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-14 19:14:03,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:03,788 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-14 19:14:03,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:14:03,789 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-14 19:14:03,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1616326209, now seen corresponding path program 1 times [2021-12-14 19:14:03,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:03,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146212975] [2021-12-14 19:14:03,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:03,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:14:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:14:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:14:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:14:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:14:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:14:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-14 19:14:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:14:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:03,958 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-14 19:14:03,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:03,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146212975] [2021-12-14 19:14:03,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146212975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:03,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:03,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:14:03,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656135378] [2021-12-14 19:14:03,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:03,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:14:03,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:14:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:14:03,961 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-14 19:14:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:05,149 INFO L93 Difference]: Finished difference Result 4075 states and 5007 transitions. [2021-12-14 19:14:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:14:05,150 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-14 19:14:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:05,158 INFO L225 Difference]: With dead ends: 4075 [2021-12-14 19:14:05,159 INFO L226 Difference]: Without dead ends: 4073 [2021-12-14 19:14:05,160 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-14 19:14:05,161 INFO L933 BasicCegarLoop]: 1272 mSDtfsCounter, 2361 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:14:05,161 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.0s Time] [2021-12-14 19:14:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2021-12-14 19:14:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3817. [2021-12-14 19:14:05,383 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-14 19:14:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 4658 transitions. [2021-12-14 19:14:05,391 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 4658 transitions. Word has length 150 [2021-12-14 19:14:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:05,392 INFO L470 AbstractCegarLoop]: Abstraction has 3817 states and 4658 transitions. [2021-12-14 19:14:05,392 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-14 19:14:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 4658 transitions. [2021-12-14 19:14:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-14 19:14:05,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:05,404 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-14 19:14:05,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 19:14:05,404 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-14 19:14:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash 713324926, now seen corresponding path program 1 times [2021-12-14 19:14:05,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:05,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824436361] [2021-12-14 19:14:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:05,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:14:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:14:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:14:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:14:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:14:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:14:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:14:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:14:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:14:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:14:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:14:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:14:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:14:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:14:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:14:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:14:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:14:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:05,533 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-14 19:14:05,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:05,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824436361] [2021-12-14 19:14:05,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824436361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:05,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:05,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:14:05,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969134547] [2021-12-14 19:14:05,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:05,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:14:05,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:05,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:14:05,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:14:05,536 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-14 19:14:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:06,613 INFO L93 Difference]: Finished difference Result 3817 states and 4658 transitions. [2021-12-14 19:14:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:14:06,614 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-14 19:14:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:06,624 INFO L225 Difference]: With dead ends: 3817 [2021-12-14 19:14:06,625 INFO L226 Difference]: Without dead ends: 3815 [2021-12-14 19:14:06,627 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-14 19:14:06,627 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, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:14:06,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2028 Valid, 2950 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 19:14:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2021-12-14 19:14:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3815. [2021-12-14 19:14:06,762 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-14 19:14:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 4655 transitions. [2021-12-14 19:14:06,770 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 4655 transitions. Word has length 144 [2021-12-14 19:14:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:06,771 INFO L470 AbstractCegarLoop]: Abstraction has 3815 states and 4655 transitions. [2021-12-14 19:14:06,771 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-14 19:14:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 4655 transitions. [2021-12-14 19:14:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-14 19:14:06,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:06,773 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-14 19:14:06,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 19:14:06,773 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-14 19:14:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1089934537, now seen corresponding path program 1 times [2021-12-14 19:14:06,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:06,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877600929] [2021-12-14 19:14:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:06,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:14:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:14:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:14:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:14:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:14:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:14:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-14 19:14:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:14:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,270 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-14 19:14:07,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:07,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877600929] [2021-12-14 19:14:07,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877600929] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:14:07,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352404279] [2021-12-14 19:14:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:07,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:14:07,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:14:07,284 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-14 19:14:07,285 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-14 19:14:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:07,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:14:07,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:14:07,953 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-14 19:14:07,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:14:07,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352404279] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:07,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:14:07,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2021-12-14 19:14:07,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176827583] [2021-12-14 19:14:07,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:07,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:14:07,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:07,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:14:07,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:14:07,955 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-14 19:14:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:09,366 INFO L93 Difference]: Finished difference Result 3839 states and 4671 transitions. [2021-12-14 19:14:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:14:09,366 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-14 19:14:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:09,377 INFO L225 Difference]: With dead ends: 3839 [2021-12-14 19:14:09,377 INFO L226 Difference]: Without dead ends: 3837 [2021-12-14 19:14:09,379 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-14 19:14:09,380 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-14 19:14:09,380 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-14 19:14:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2021-12-14 19:14:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3837. [2021-12-14 19:14:09,572 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-14 19:14:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4662 transitions. [2021-12-14 19:14:09,579 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4662 transitions. Word has length 153 [2021-12-14 19:14:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:09,579 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 4662 transitions. [2021-12-14 19:14:09,579 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-14 19:14:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4662 transitions. [2021-12-14 19:14:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-14 19:14:09,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:09,581 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-14 19:14:09,602 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-14 19:14:09,795 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-14 19:14:09,795 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-14 19:14:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -281219765, now seen corresponding path program 1 times [2021-12-14 19:14:09,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:09,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750386880] [2021-12-14 19:14:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:09,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:14:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:14:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:14:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:14:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:14:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:14:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-14 19:14:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:14:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:09,936 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-14 19:14:09,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:09,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750386880] [2021-12-14 19:14:09,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750386880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:09,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:09,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:14:09,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093103184] [2021-12-14 19:14:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:09,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:14:09,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:14:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:14:09,938 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-14 19:14:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:11,492 INFO L93 Difference]: Finished difference Result 4093 states and 5002 transitions. [2021-12-14 19:14:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:14:11,493 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-14 19:14:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:11,503 INFO L225 Difference]: With dead ends: 4093 [2021-12-14 19:14:11,503 INFO L226 Difference]: Without dead ends: 4091 [2021-12-14 19:14:11,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:14:11,506 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-14 19:14:11,507 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-14 19:14:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2021-12-14 19:14:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 3835. [2021-12-14 19:14:11,698 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-14 19:14:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 4653 transitions. [2021-12-14 19:14:11,708 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 4653 transitions. Word has length 156 [2021-12-14 19:14:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:11,708 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 4653 transitions. [2021-12-14 19:14:11,708 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-14 19:14:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 4653 transitions. [2021-12-14 19:14:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-14 19:14:11,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:11,711 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-14 19:14:11,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 19:14:11,711 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-14 19:14:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1200520837, now seen corresponding path program 1 times [2021-12-14 19:14:11,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:11,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930941613] [2021-12-14 19:14:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:11,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:14:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:14:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:14:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:14:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:14:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:14:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:14:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:14:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:14:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:14:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:14:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:14:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:14:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:14:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:14:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:14:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:14:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-14 19:14:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:11,926 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-14 19:14:11,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:11,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930941613] [2021-12-14 19:14:11,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930941613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:11,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:11,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:14:11,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707847680] [2021-12-14 19:14:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:11,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:14:11,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:11,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:14:11,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:14:11,929 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-14 19:14:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:13,006 INFO L93 Difference]: Finished difference Result 3835 states and 4653 transitions. [2021-12-14 19:14:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:14:13,006 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-14 19:14:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:13,013 INFO L225 Difference]: With dead ends: 3835 [2021-12-14 19:14:13,014 INFO L226 Difference]: Without dead ends: 3833 [2021-12-14 19:14:13,015 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-14 19:14:13,015 INFO L933 BasicCegarLoop]: 1273 mSDtfsCounter, 1849 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:14:13,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2009 Valid, 2945 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 19:14:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2021-12-14 19:14:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3833. [2021-12-14 19:14:13,158 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-14 19:14:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 4650 transitions. [2021-12-14 19:14:13,165 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 4650 transitions. Word has length 150 [2021-12-14 19:14:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:13,165 INFO L470 AbstractCegarLoop]: Abstraction has 3833 states and 4650 transitions. [2021-12-14 19:14:13,165 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-14 19:14:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 4650 transitions. [2021-12-14 19:14:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-14 19:14:13,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:13,167 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-14 19:14:13,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 19:14:13,168 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-14 19:14:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1309291226, now seen corresponding path program 2 times [2021-12-14 19:14:13,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:13,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999439069] [2021-12-14 19:14:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:13,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:14:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:14:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:14:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:14:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:14:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:14:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-14 19:14:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:14:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:13,334 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-14 19:14:13,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:13,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999439069] [2021-12-14 19:14:13,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999439069] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:13,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:13,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:14:13,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786370659] [2021-12-14 19:14:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:13,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:14:13,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:14:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:14:13,337 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) [2021-12-14 19:14:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:15,141 INFO L93 Difference]: Finished difference Result 4109 states and 5006 transitions. [2021-12-14 19:14:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:14:15,142 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 161 [2021-12-14 19:14:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:15,152 INFO L225 Difference]: With dead ends: 4109 [2021-12-14 19:14:15,152 INFO L226 Difference]: Without dead ends: 4107 [2021-12-14 19:14:15,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-12-14 19:14:15,154 INFO L933 BasicCegarLoop]: 1306 mSDtfsCounter, 1893 mSDsluCounter, 3470 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 1282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 4776 SdHoareTripleChecker+Invalid, 3915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1282 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:14:15,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1908 Valid, 4776 Invalid, 3915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1282 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-14 19:14:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2021-12-14 19:14:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3845. [2021-12-14 19:14:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 2611 states have (on average 1.1501340482573728) internal successors, (3003), 2698 states have internal predecessors, (3003), 827 states have call successors, (827), 393 states have call predecessors, (827), 391 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-14 19:14:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 4659 transitions. [2021-12-14 19:14:15,323 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 4659 transitions. Word has length 161 [2021-12-14 19:14:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:15,323 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 4659 transitions. [2021-12-14 19:14:15,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2021-12-14 19:14:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 4659 transitions. [2021-12-14 19:14:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-14 19:14:15,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:15,325 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, 1, 1, 1, 1, 1, 1] [2021-12-14 19:14:15,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 19:14:15,326 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-14 19:14:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -317173186, now seen corresponding path program 1 times [2021-12-14 19:14:15,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:15,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578409303] [2021-12-14 19:14:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:15,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:14:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:14:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:14:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:14:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:14:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:14:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:14:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:14:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:14:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:14:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:14:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:14:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:14:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:14:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:14:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:14:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:14:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-14 19:14:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 19:14:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:15,463 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-14 19:14:15,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:15,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578409303] [2021-12-14 19:14:15,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578409303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:15,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:15,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:14:15,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944628766] [2021-12-14 19:14:15,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:15,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:14:15,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:14:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:14:15,465 INFO L87 Difference]: Start difference. First operand 3845 states and 4659 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-14 19:14:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:16,307 INFO L93 Difference]: Finished difference Result 3845 states and 4659 transitions. [2021-12-14 19:14:16,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:14:16,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2021-12-14 19:14:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:16,316 INFO L225 Difference]: With dead ends: 3845 [2021-12-14 19:14:16,317 INFO L226 Difference]: Without dead ends: 3843 [2021-12-14 19:14:16,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:14:16,318 INFO L933 BasicCegarLoop]: 1271 mSDtfsCounter, 1843 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:14:16,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2002 Valid, 2943 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 19:14:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2021-12-14 19:14:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3843. [2021-12-14 19:14:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3843 states, 2610 states have (on average 1.1494252873563218) internal successors, (3000), 2696 states have internal predecessors, (3000), 827 states have call successors, (827), 393 states have call predecessors, (827), 391 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-14 19:14:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 4656 transitions. [2021-12-14 19:14:16,477 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 4656 transitions. Word has length 156 [2021-12-14 19:14:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:16,477 INFO L470 AbstractCegarLoop]: Abstraction has 3843 states and 4656 transitions. [2021-12-14 19:14:16,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-14 19:14:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 4656 transitions. [2021-12-14 19:14:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-14 19:14:16,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:16,480 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:14:16,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 19:14:16,480 INFO L402 AbstractCegarLoop]: === Iteration 27 === 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-14 19:14:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1340163979, now seen corresponding path program 1 times [2021-12-14 19:14:16,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:16,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698321389] [2021-12-14 19:14:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:16,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:14:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:14:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:14:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:14:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:14:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:14:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-14 19:14:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:14:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-14 19:14:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-14 19:14:16,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:16,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698321389] [2021-12-14 19:14:16,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698321389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:16,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:16,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:14:16,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674902771] [2021-12-14 19:14:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:16,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:14:16,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:16,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:14:16,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:14:16,630 INFO L87 Difference]: Start difference. First operand 3843 states and 4656 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-14 19:14:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:18,286 INFO L93 Difference]: Finished difference Result 4294 states and 5180 transitions. [2021-12-14 19:14:18,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:14:18,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2021-12-14 19:14:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:18,312 INFO L225 Difference]: With dead ends: 4294 [2021-12-14 19:14:18,314 INFO L226 Difference]: Without dead ends: 4292 [2021-12-14 19:14:18,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:14:18,317 INFO L933 BasicCegarLoop]: 1289 mSDtfsCounter, 2277 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 1159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2439 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1159 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:14:18,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2439 Valid, 4332 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1159 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-14 19:14:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2021-12-14 19:14:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 4030. [2021-12-14 19:14:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 2749 states have (on average 1.1436886140414697) internal successors, (3144), 2834 states have internal predecessors, (3144), 841 states have call successors, (841), 428 states have call predecessors, (841), 426 states have return successors, (843), 815 states have call predecessors, (843), 839 states have call successors, (843) [2021-12-14 19:14:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 4828 transitions. [2021-12-14 19:14:18,498 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 4828 transitions. Word has length 165 [2021-12-14 19:14:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:18,498 INFO L470 AbstractCegarLoop]: Abstraction has 4030 states and 4828 transitions. [2021-12-14 19:14:18,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-14 19:14:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 4828 transitions. [2021-12-14 19:14:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-14 19:14:18,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:18,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:14:18,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 19:14:18,501 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-14 19:14:18,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:18,501 INFO L85 PathProgramCache]: Analyzing trace with hash -960462947, now seen corresponding path program 1 times [2021-12-14 19:14:18,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:18,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746280959] [2021-12-14 19:14:18,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:18,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 19:14:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-14 19:14:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 19:14:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:14:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:14:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:14:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:14:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:14:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:14:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:14:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:14:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:14:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-14 19:14:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:14:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:14:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:14:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:14:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-14 19:14:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 19:14:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-14 19:14:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:18,685 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-14 19:14:18,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:18,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746280959] [2021-12-14 19:14:18,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746280959] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:14:18,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:14:18,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:14:18,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403378166] [2021-12-14 19:14:18,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:14:18,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:14:18,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:14:18,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:14:18,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:14:18,688 INFO L87 Difference]: Start difference. First operand 4030 states and 4828 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-14 19:14:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:14:20,005 INFO L93 Difference]: Finished difference Result 4030 states and 4828 transitions. [2021-12-14 19:14:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:14:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2021-12-14 19:14:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:14:20,016 INFO L225 Difference]: With dead ends: 4030 [2021-12-14 19:14:20,016 INFO L226 Difference]: Without dead ends: 4028 [2021-12-14 19:14:20,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:14:20,019 INFO L933 BasicCegarLoop]: 1267 mSDtfsCounter, 1831 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:14:20,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1989 Valid, 2939 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-14 19:14:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2021-12-14 19:14:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 4028. [2021-12-14 19:14:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4028 states, 2748 states have (on average 1.1430131004366813) internal successors, (3141), 2832 states have internal predecessors, (3141), 841 states have call successors, (841), 428 states have call predecessors, (841), 426 states have return successors, (843), 815 states have call predecessors, (843), 839 states have call successors, (843) [2021-12-14 19:14:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 4825 transitions. [2021-12-14 19:14:20,213 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 4825 transitions. Word has length 162 [2021-12-14 19:14:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:14:20,214 INFO L470 AbstractCegarLoop]: Abstraction has 4028 states and 4825 transitions. [2021-12-14 19:14:20,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-14 19:14:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 4825 transitions. [2021-12-14 19:14:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-14 19:14:20,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:14:20,216 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-14 19:14:20,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 19:14:20,217 INFO L402 AbstractCegarLoop]: === Iteration 29 === 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-14 19:14:20,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:14:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash 418258293, now seen corresponding path program 1 times [2021-12-14 19:14:20,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:14:20,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442881541] [2021-12-14 19:14:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:20,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:14:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:14:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:14:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:14:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 19:14:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:14:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 19:14:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:14:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:14:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 19:14:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-14 19:14:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-14 19:14:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-14 19:14:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:14:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:14:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:14:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-14 19:14:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-14 19:14:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-14 19:14:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-12-14 19:14:20,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:14:20,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442881541] [2021-12-14 19:14:20,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442881541] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:14:20,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216261850] [2021-12-14 19:14:20,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:14:20,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:14:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:14:20,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:14:20,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:14:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:14:20,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 19:14:20,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:14:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-12-14 19:14:21,264 INFO L328 TraceCheckSpWp]: Computing backward predicates...