./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 ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:25:37,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:25:37,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:25:37,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:25:37,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:25:37,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:25:37,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:25:37,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:25:37,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:25:37,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:25:37,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:25:37,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:25:37,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:25:37,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:25:37,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:25:37,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:25:37,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:25:37,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:25:37,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:25:37,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:25:37,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:25:37,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:25:37,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:25:37,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:25:37,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:25:37,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:25:37,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:25:37,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:25:37,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:25:37,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:25:37,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:25:37,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:25:37,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:25:37,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:25:37,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:25:37,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:25:37,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:25:37,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:25:37,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:25:37,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:25:37,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:25:37,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 05:25:37,654 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:25:37,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:25:37,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:25:37,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:25:37,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:25:37,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:25:37,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:25:37,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:25:37,657 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:25:37,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:25:37,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:25:37,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:25:37,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 05:25:37,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:25:37,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 05:25:37,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 05:25:37,659 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:25:37,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 05:25:37,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:25:37,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:25:37,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:25:37,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:25:37,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:25:37,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:25:37,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 05:25:37,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:25:37,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:25:37,661 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 05:25:37,661 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 05:25:37,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 05:25:37,661 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-28 05:25:37,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:25:37,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:25:37,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:25:37,920 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:25:37,920 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:25:37,922 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-28 05:25:37,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551346be4/5f4613d26ced4cf2914f2cfdd65d28e4/FLAGbfc74d509 [2021-12-28 05:25:38,602 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:25:38,603 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-28 05:25:38,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551346be4/5f4613d26ced4cf2914f2cfdd65d28e4/FLAGbfc74d509 [2021-12-28 05:25:38,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551346be4/5f4613d26ced4cf2914f2cfdd65d28e4 [2021-12-28 05:25:38,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:25:39,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:25:39,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:25:39,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:25:39,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:25:39,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:25:38" (1/1) ... [2021-12-28 05:25:39,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6197f95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:39, skipping insertion in model container [2021-12-28 05:25:39,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:25:38" (1/1) ... [2021-12-28 05:25:39,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:25:39,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:25:41,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-12-28 05:25:41,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-12-28 05:25:41,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-12-28 05:25:41,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-12-28 05:25:41,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-12-28 05:25:41,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-12-28 05:25:41,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-12-28 05:25:41,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-12-28 05:25:41,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-12-28 05:25:41,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-12-28 05:25:41,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-12-28 05:25:41,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-12-28 05:25:41,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-12-28 05:25:41,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-12-28 05:25:41,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-12-28 05:25:41,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-12-28 05:25:41,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-12-28 05:25:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-12-28 05:25:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-12-28 05:25:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-12-28 05:25:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-12-28 05:25:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-12-28 05:25:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-12-28 05:25:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-12-28 05:25:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-12-28 05:25:41,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-12-28 05:25:41,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-12-28 05:25:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-12-28 05:25:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-12-28 05:25:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-12-28 05:25:41,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-12-28 05:25:41,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-12-28 05:25:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-12-28 05:25:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-12-28 05:25:41,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-12-28 05:25:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-12-28 05:25:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-12-28 05:25:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-12-28 05:25:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-12-28 05:25:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-12-28 05:25:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-12-28 05:25:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-12-28 05:25:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-12-28 05:25:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-12-28 05:25:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-12-28 05:25:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-12-28 05:25:41,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-12-28 05:25:41,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-12-28 05:25:41,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-12-28 05:25:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-12-28 05:25:41,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-12-28 05:25:41,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-12-28 05:25:41,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:25:41,316 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:25:41,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-12-28 05:25:41,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-12-28 05:25:41,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-12-28 05:25:41,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-12-28 05:25:41,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-12-28 05:25:41,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-12-28 05:25:41,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-12-28 05:25:41,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-12-28 05:25:41,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-12-28 05:25:41,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-12-28 05:25:41,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-12-28 05:25:41,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-12-28 05:25:41,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-12-28 05:25:41,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-12-28 05:25:41,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-12-28 05:25:41,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-12-28 05:25:41,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-12-28 05:25:41,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-12-28 05:25:41,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-12-28 05:25:41,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-12-28 05:25:41,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-12-28 05:25:41,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-12-28 05:25:41,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-12-28 05:25:41,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-12-28 05:25:41,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-12-28 05:25:41,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-12-28 05:25:41,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-12-28 05:25:41,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-28 05:25:41,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-12-28 05:25:41,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-12-28 05:25:41,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-12-28 05:25:41,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:25:41,722 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:25:41,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41 WrapperNode [2021-12-28 05:25:41,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:25:41,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:25:41,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:25:41,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:25:41,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:41,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:41,900 INFO L137 Inliner]: procedures = 616, calls = 1459, calls flagged for inlining = 273, calls inlined = 178, statements flattened = 2640 [2021-12-28 05:25:41,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:25:41,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:25:41,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:25:41,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:25:41,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:41,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:41,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:41,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:41,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:41,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:42,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:42,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:25:42,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:25:42,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:25:42,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:25:42,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (1/1) ... [2021-12-28 05:25:42,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:25:42,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:25:42,046 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-28 05:25:42,052 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-28 05:25:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2021-12-28 05:25:42,073 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2021-12-28 05:25:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:25:42,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:25:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2021-12-28 05:25:42,073 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2021-12-28 05:25:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-28 05:25:42,073 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-28 05:25:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2021-12-28 05:25:42,074 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2021-12-28 05:25:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 05:25:42,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 05:25:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:25:42,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:25:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-28 05:25:42,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-28 05:25:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2021-12-28 05:25:42,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2021-12-28 05:25:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2021-12-28 05:25:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2021-12-28 05:25:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2021-12-28 05:25:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2021-12-28 05:25:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:25:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:25:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2021-12-28 05:25:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2021-12-28 05:25:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:25:42,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:25:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-12-28 05:25:42,077 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-12-28 05:25:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-28 05:25:42,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-28 05:25:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2021-12-28 05:25:42,077 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2021-12-28 05:25:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-28 05:25:42,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-28 05:25:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:25:42,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:25:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:25:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2021-12-28 05:25:42,078 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2021-12-28 05:25:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:25:42,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:25:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-12-28 05:25:42,078 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-12-28 05:25:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-12-28 05:25:42,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-12-28 05:25:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-28 05:25:42,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-28 05:25:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-28 05:25:42,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-28 05:25:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2021-12-28 05:25:42,079 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2021-12-28 05:25:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:25:42,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:25:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:25:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:25:42,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:25:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:25:42,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:25:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2021-12-28 05:25:42,080 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2021-12-28 05:25:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2021-12-28 05:25:42,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2021-12-28 05:25:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:25:42,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:25:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2021-12-28 05:25:42,081 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2021-12-28 05:25:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2021-12-28 05:25:42,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2021-12-28 05:25:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:25:42,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:25:42,082 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2021-12-28 05:25:42,084 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2021-12-28 05:25:42,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:25:42,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:25:42,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-28 05:25:42,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-28 05:25:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:25:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2021-12-28 05:25:42,085 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2021-12-28 05:25:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:25:42,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:25:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:25:42,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:25:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2021-12-28 05:25:42,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2021-12-28 05:25:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-12-28 05:25:42,086 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-12-28 05:25:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2021-12-28 05:25:42,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2021-12-28 05:25:42,087 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-12-28 05:25:42,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-28 05:25:42,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-28 05:25:42,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-28 05:25:42,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-28 05:25:42,087 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2021-12-28 05:25:42,087 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2021-12-28 05:25:42,087 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2021-12-28 05:25:42,087 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2021-12-28 05:25:42,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2021-12-28 05:25:42,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2021-12-28 05:25:42,088 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2021-12-28 05:25:42,088 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2021-12-28 05:25:42,088 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-12-28 05:25:42,088 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-12-28 05:25:42,088 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2021-12-28 05:25:42,088 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2021-12-28 05:25:42,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:25:42,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:25:42,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2021-12-28 05:25:42,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2021-12-28 05:25:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2021-12-28 05:25:42,091 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2021-12-28 05:25:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:25:42,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:25:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:25:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:25:42,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:25:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:25:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2021-12-28 05:25:42,092 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2021-12-28 05:25:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:25:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2021-12-28 05:25:42,092 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2021-12-28 05:25:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2021-12-28 05:25:42,092 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2021-12-28 05:25:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-12-28 05:25:42,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-12-28 05:25:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:25:42,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:25:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2021-12-28 05:25:42,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2021-12-28 05:25:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-28 05:25:42,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-28 05:25:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-28 05:25:42,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-28 05:25:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:25:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:25:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:25:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:25:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2021-12-28 05:25:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2021-12-28 05:25:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2021-12-28 05:25:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2021-12-28 05:25:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2021-12-28 05:25:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2021-12-28 05:25:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2021-12-28 05:25:42,095 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2021-12-28 05:25:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:25:42,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:25:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-28 05:25:42,095 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-28 05:25:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:25:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:25:42,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:25:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-28 05:25:42,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-28 05:25:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:25:42,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:25:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2021-12-28 05:25:42,096 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2021-12-28 05:25:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2021-12-28 05:25:42,096 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2021-12-28 05:25:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2021-12-28 05:25:42,096 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2021-12-28 05:25:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2021-12-28 05:25:42,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2021-12-28 05:25:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-28 05:25:42,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-28 05:25:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2021-12-28 05:25:42,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2021-12-28 05:25:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:25:42,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:25:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2021-12-28 05:25:42,097 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2021-12-28 05:25:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:25:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2021-12-28 05:25:42,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2021-12-28 05:25:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2021-12-28 05:25:42,098 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2021-12-28 05:25:42,629 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:25:42,631 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:25:42,764 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-28 05:25:43,766 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:25:43,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:25:43,776 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 05:25:43,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:25:43 BoogieIcfgContainer [2021-12-28 05:25:43,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:25:43,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:25:43,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:25:43,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:25:43,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:25:38" (1/3) ... [2021-12-28 05:25:43,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352ce817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:25:43, skipping insertion in model container [2021-12-28 05:25:43,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:41" (2/3) ... [2021-12-28 05:25:43,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352ce817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:25:43, skipping insertion in model container [2021-12-28 05:25:43,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:25:43" (3/3) ... [2021-12-28 05:25:43,783 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-12-28 05:25:43,786 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:25:43,786 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-12-28 05:25:43,818 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:25:43,823 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-28 05:25:43,823 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-12-28 05:25:43,845 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-28 05:25:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 05:25:43,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:43,851 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:43,852 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-28 05:25:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash -138799992, now seen corresponding path program 1 times [2021-12-28 05:25:43,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:43,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917871535] [2021-12-28 05:25:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:43,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:25:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:25:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:25:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,279 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-28 05:25:44,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:44,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917871535] [2021-12-28 05:25:44,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917871535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:44,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:44,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:44,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66226291] [2021-12-28 05:25:44,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:44,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:44,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:44,308 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-28 05:25:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:45,808 INFO L93 Difference]: Finished difference Result 2200 states and 2931 transitions. [2021-12-28 05:25:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:45,810 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-28 05:25:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:45,822 INFO L225 Difference]: With dead ends: 2200 [2021-12-28 05:25:45,827 INFO L226 Difference]: Without dead ends: 1093 [2021-12-28 05:25:45,835 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-28 05:25:45,838 INFO L933 BasicCegarLoop]: 1319 mSDtfsCounter, 1961 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:45,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2136 Valid, 2756 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-28 05:25:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-12-28 05:25:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2021-12-28 05:25:45,944 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-28 05:25:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1375 transitions. [2021-12-28 05:25:45,951 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1375 transitions. Word has length 70 [2021-12-28 05:25:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:45,952 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 1375 transitions. [2021-12-28 05:25:45,952 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-28 05:25:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1375 transitions. [2021-12-28 05:25:45,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-28 05:25:45,955 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:45,955 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-28 05:25:45,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:25:45,955 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-28 05:25:45,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash 333096518, now seen corresponding path program 1 times [2021-12-28 05:25:45,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479982552] [2021-12-28 05:25:45,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:45,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:25:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:25:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:25:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:46,145 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-28 05:25:46,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:46,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479982552] [2021-12-28 05:25:46,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479982552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:46,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:46,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:46,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955744830] [2021-12-28 05:25:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:46,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:46,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:46,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:46,149 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-28 05:25:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:47,560 INFO L93 Difference]: Finished difference Result 1093 states and 1375 transitions. [2021-12-28 05:25:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:47,560 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-28 05:25:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:47,565 INFO L225 Difference]: With dead ends: 1093 [2021-12-28 05:25:47,565 INFO L226 Difference]: Without dead ends: 1091 [2021-12-28 05:25:47,566 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-28 05:25:47,567 INFO L933 BasicCegarLoop]: 1299 mSDtfsCounter, 1927 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:47,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2099 Valid, 2716 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-28 05:25:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-12-28 05:25:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2021-12-28 05:25:47,594 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-28 05:25:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1373 transitions. [2021-12-28 05:25:47,599 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1373 transitions. Word has length 76 [2021-12-28 05:25:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:47,599 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 1373 transitions. [2021-12-28 05:25:47,599 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-28 05:25:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1373 transitions. [2021-12-28 05:25:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-28 05:25:47,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:47,601 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-28 05:25:47,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:25:47,601 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-28 05:25:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1375714423, now seen corresponding path program 1 times [2021-12-28 05:25:47,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:47,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097774315] [2021-12-28 05:25:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:47,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:25:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:25:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:25:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,754 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-28 05:25:47,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:47,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097774315] [2021-12-28 05:25:47,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097774315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:47,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:47,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:47,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645172439] [2021-12-28 05:25:47,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:47,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:47,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:47,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:47,756 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-28 05:25:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:49,084 INFO L93 Difference]: Finished difference Result 1091 states and 1373 transitions. [2021-12-28 05:25:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:49,084 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-28 05:25:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:49,094 INFO L225 Difference]: With dead ends: 1091 [2021-12-28 05:25:49,094 INFO L226 Difference]: Without dead ends: 1089 [2021-12-28 05:25:49,095 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-28 05:25:49,097 INFO L933 BasicCegarLoop]: 1297 mSDtfsCounter, 1921 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:49,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2092 Valid, 2714 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-12-28 05:25:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2021-12-28 05:25:49,139 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-28 05:25:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1371 transitions. [2021-12-28 05:25:49,143 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1371 transitions. Word has length 82 [2021-12-28 05:25:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:49,144 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 1371 transitions. [2021-12-28 05:25:49,144 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-28 05:25:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1371 transitions. [2021-12-28 05:25:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-28 05:25:49,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:49,148 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-28 05:25:49,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:25:49,149 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-28 05:25:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -62631502, now seen corresponding path program 1 times [2021-12-28 05:25:49,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:49,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880229414] [2021-12-28 05:25:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:49,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:25:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:25:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:25:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-28 05:25:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:25:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:25:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,376 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-28 05:25:49,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:49,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880229414] [2021-12-28 05:25:49,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880229414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:49,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:49,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:49,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348749983] [2021-12-28 05:25:49,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:49,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:49,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:49,379 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-28 05:25:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:51,318 INFO L93 Difference]: Finished difference Result 1862 states and 2308 transitions. [2021-12-28 05:25:51,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:25:51,318 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-28 05:25:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:51,326 INFO L225 Difference]: With dead ends: 1862 [2021-12-28 05:25:51,326 INFO L226 Difference]: Without dead ends: 1860 [2021-12-28 05:25:51,327 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-28 05:25:51,327 INFO L933 BasicCegarLoop]: 1567 mSDtfsCounter, 1359 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 4281 SdHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:51,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 4281 Invalid, 3423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 2912 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-28 05:25:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2021-12-28 05:25:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1597. [2021-12-28 05:25:51,376 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-28 05:25:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2009 transitions. [2021-12-28 05:25:51,382 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2009 transitions. Word has length 97 [2021-12-28 05:25:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:51,383 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2009 transitions. [2021-12-28 05:25:51,383 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-28 05:25:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2009 transitions. [2021-12-28 05:25:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-28 05:25:51,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:51,384 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-28 05:25:51,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:25:51,384 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-28 05:25:51,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:51,385 INFO L85 PathProgramCache]: Analyzing trace with hash 591565888, now seen corresponding path program 1 times [2021-12-28 05:25:51,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:51,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745042207] [2021-12-28 05:25:51,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:51,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:25:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:25:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:25:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,564 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-28 05:25:51,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:51,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745042207] [2021-12-28 05:25:51,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745042207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:51,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:51,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:51,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420633685] [2021-12-28 05:25:51,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:51,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:51,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:51,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:51,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:51,566 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-28 05:25:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:52,850 INFO L93 Difference]: Finished difference Result 1597 states and 2009 transitions. [2021-12-28 05:25:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:52,850 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-28 05:25:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:52,856 INFO L225 Difference]: With dead ends: 1597 [2021-12-28 05:25:52,856 INFO L226 Difference]: Without dead ends: 1595 [2021-12-28 05:25:52,858 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-28 05:25:52,859 INFO L933 BasicCegarLoop]: 1295 mSDtfsCounter, 1915 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2085 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:52,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2085 Valid, 2712 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-12-28 05:25:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595. [2021-12-28 05:25:52,904 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-28 05:25:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2007 transitions. [2021-12-28 05:25:52,910 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2007 transitions. Word has length 88 [2021-12-28 05:25:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:52,911 INFO L470 AbstractCegarLoop]: Abstraction has 1595 states and 2007 transitions. [2021-12-28 05:25:52,911 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-28 05:25:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2007 transitions. [2021-12-28 05:25:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 05:25:52,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:52,914 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-28 05:25:52,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:25:52,915 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-28 05:25:52,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash -56363973, now seen corresponding path program 1 times [2021-12-28 05:25:52,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699051461] [2021-12-28 05:25:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:52,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:25:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:25:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:25:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,093 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-28 05:25:53,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:53,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699051461] [2021-12-28 05:25:53,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699051461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:53,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:53,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:53,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697086637] [2021-12-28 05:25:53,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:53,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:53,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:53,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:53,095 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-28 05:25:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:54,343 INFO L93 Difference]: Finished difference Result 1595 states and 2007 transitions. [2021-12-28 05:25:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:54,344 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-28 05:25:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:54,349 INFO L225 Difference]: With dead ends: 1595 [2021-12-28 05:25:54,349 INFO L226 Difference]: Without dead ends: 1593 [2021-12-28 05:25:54,350 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-28 05:25:54,350 INFO L933 BasicCegarLoop]: 1293 mSDtfsCounter, 1909 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:54,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2078 Valid, 2710 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2021-12-28 05:25:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1593. [2021-12-28 05:25:54,394 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-28 05:25:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2005 transitions. [2021-12-28 05:25:54,399 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2005 transitions. Word has length 94 [2021-12-28 05:25:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:54,400 INFO L470 AbstractCegarLoop]: Abstraction has 1593 states and 2005 transitions. [2021-12-28 05:25:54,400 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-28 05:25:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2005 transitions. [2021-12-28 05:25:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 05:25:54,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:54,401 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-28 05:25:54,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:25:54,402 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-28 05:25:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash 915527194, now seen corresponding path program 1 times [2021-12-28 05:25:54,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:54,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193643936] [2021-12-28 05:25:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:54,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:25:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:25:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:25:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,559 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-28 05:25:54,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:54,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193643936] [2021-12-28 05:25:54,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193643936] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:54,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:54,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:54,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593500774] [2021-12-28 05:25:54,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:54,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:54,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:54,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:54,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:54,561 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-28 05:25:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:55,820 INFO L93 Difference]: Finished difference Result 1593 states and 2005 transitions. [2021-12-28 05:25:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:55,821 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-28 05:25:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:55,826 INFO L225 Difference]: With dead ends: 1593 [2021-12-28 05:25:55,826 INFO L226 Difference]: Without dead ends: 1591 [2021-12-28 05:25:55,826 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-28 05:25:55,827 INFO L933 BasicCegarLoop]: 1291 mSDtfsCounter, 1903 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:55,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2071 Valid, 2708 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2021-12-28 05:25:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2021-12-28 05:25:55,869 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-28 05:25:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2003 transitions. [2021-12-28 05:25:55,877 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2003 transitions. Word has length 100 [2021-12-28 05:25:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:55,878 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2003 transitions. [2021-12-28 05:25:55,878 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-28 05:25:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2003 transitions. [2021-12-28 05:25:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-28 05:25:55,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:55,879 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:55,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:25:55,879 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-28 05:25:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash 178536448, now seen corresponding path program 1 times [2021-12-28 05:25:55,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:55,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715110871] [2021-12-28 05:25:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:55,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:25:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:25:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:25:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,045 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-28 05:25:56,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:56,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715110871] [2021-12-28 05:25:56,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715110871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:56,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:56,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:56,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006702080] [2021-12-28 05:25:56,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:56,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:56,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:56,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:56,047 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-28 05:25:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:57,248 INFO L93 Difference]: Finished difference Result 1591 states and 2003 transitions. [2021-12-28 05:25:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:57,249 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-28 05:25:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:57,254 INFO L225 Difference]: With dead ends: 1591 [2021-12-28 05:25:57,254 INFO L226 Difference]: Without dead ends: 1589 [2021-12-28 05:25:57,255 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-28 05:25:57,256 INFO L933 BasicCegarLoop]: 1289 mSDtfsCounter, 1897 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:57,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2064 Valid, 2706 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-12-28 05:25:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2021-12-28 05:25:57,316 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-28 05:25:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2001 transitions. [2021-12-28 05:25:57,320 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2001 transitions. Word has length 106 [2021-12-28 05:25:57,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:57,320 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 2001 transitions. [2021-12-28 05:25:57,320 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-28 05:25:57,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2001 transitions. [2021-12-28 05:25:57,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-28 05:25:57,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:57,322 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-28 05:25:57,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:25:57,322 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-28 05:25:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1037707720, now seen corresponding path program 1 times [2021-12-28 05:25:57,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:57,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356319785] [2021-12-28 05:25:57,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:57,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:25:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:25:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:25:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:25:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:25:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 05:25:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,548 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-28 05:25:57,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:57,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356319785] [2021-12-28 05:25:57,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356319785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:57,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:57,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:25:57,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644230507] [2021-12-28 05:25:57,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:57,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:25:57,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:25:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:25:57,550 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-28 05:25:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:59,409 INFO L93 Difference]: Finished difference Result 1869 states and 2334 transitions. [2021-12-28 05:25:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 05:25:59,411 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-28 05:25:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:59,438 INFO L225 Difference]: With dead ends: 1869 [2021-12-28 05:25:59,438 INFO L226 Difference]: Without dead ends: 1867 [2021-12-28 05:25:59,439 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-28 05:25:59,439 INFO L933 BasicCegarLoop]: 1395 mSDtfsCounter, 1888 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 3636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 853 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:59,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2061 Valid, 3480 Invalid, 3636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [853 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-28 05:25:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2021-12-28 05:25:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1759. [2021-12-28 05:25:59,501 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-28 05:25:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2198 transitions. [2021-12-28 05:25:59,505 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2198 transitions. Word has length 118 [2021-12-28 05:25:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:59,506 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2198 transitions. [2021-12-28 05:25:59,506 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-28 05:25:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2198 transitions. [2021-12-28 05:25:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-28 05:25:59,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:59,508 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-28 05:25:59,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:25:59,508 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-28 05:25:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1083405284, now seen corresponding path program 1 times [2021-12-28 05:25:59,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:59,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120185553] [2021-12-28 05:25:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:59,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:25:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:25:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:25:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,677 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-28 05:25:59,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:59,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120185553] [2021-12-28 05:25:59,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120185553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:59,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:59,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:59,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956995446] [2021-12-28 05:25:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:59,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:59,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:59,679 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-28 05:26:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:00,903 INFO L93 Difference]: Finished difference Result 1759 states and 2198 transitions. [2021-12-28 05:26:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:26:00,911 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-28 05:26:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:00,918 INFO L225 Difference]: With dead ends: 1759 [2021-12-28 05:26:00,918 INFO L226 Difference]: Without dead ends: 1757 [2021-12-28 05:26:00,918 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-28 05:26:00,919 INFO L933 BasicCegarLoop]: 1287 mSDtfsCounter, 1895 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:00,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2061 Valid, 2704 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:26:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2021-12-28 05:26:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2021-12-28 05:26:00,970 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-28 05:26:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2196 transitions. [2021-12-28 05:26:00,974 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2196 transitions. Word has length 112 [2021-12-28 05:26:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:00,974 INFO L470 AbstractCegarLoop]: Abstraction has 1757 states and 2196 transitions. [2021-12-28 05:26:00,975 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-28 05:26:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2196 transitions. [2021-12-28 05:26:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-28 05:26:00,976 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:00,976 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-28 05:26:00,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:26:00,976 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-28 05:26:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash 392296454, now seen corresponding path program 1 times [2021-12-28 05:26:00,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:00,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977027625] [2021-12-28 05:26:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:00,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:26:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:26:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:26:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 05:26:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:26:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:26:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,195 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-28 05:26:01,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:01,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977027625] [2021-12-28 05:26:01,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977027625] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:26:01,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362450655] [2021-12-28 05:26:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:01,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:26:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:26:01,198 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-28 05:26:01,204 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-28 05:26:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:01,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 05:26:01,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:26:01,853 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-28 05:26:01,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:26:01,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362450655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:01,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 05:26:01,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2021-12-28 05:26:01,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876390589] [2021-12-28 05:26:01,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:01,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:26:01,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:01,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:26:01,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:26:01,856 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-28 05:26:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:01,995 INFO L93 Difference]: Finished difference Result 3405 states and 4242 transitions. [2021-12-28 05:26:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:26:01,995 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-28 05:26:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:02,003 INFO L225 Difference]: With dead ends: 3405 [2021-12-28 05:26:02,003 INFO L226 Difference]: Without dead ends: 1805 [2021-12-28 05:26:02,006 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-28 05:26:02,007 INFO L933 BasicCegarLoop]: 1395 mSDtfsCounter, 319 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-28 05:26:02,007 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-28 05:26:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2021-12-28 05:26:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1763. [2021-12-28 05:26:02,080 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-28 05:26:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2204 transitions. [2021-12-28 05:26:02,085 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2204 transitions. Word has length 134 [2021-12-28 05:26:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:02,086 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 2204 transitions. [2021-12-28 05:26:02,087 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-28 05:26:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2204 transitions. [2021-12-28 05:26:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-28 05:26:02,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:02,088 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-28 05:26:02,109 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-28 05:26:02,299 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-28 05:26:02,299 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-28 05:26:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1770258305, now seen corresponding path program 1 times [2021-12-28 05:26:02,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:02,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996117209] [2021-12-28 05:26:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:02,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:26:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:26:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:26:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:26:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:26:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:26:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:26:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:02,443 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-28 05:26:02,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:02,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996117209] [2021-12-28 05:26:02,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996117209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:02,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:02,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:02,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104411002] [2021-12-28 05:26:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:02,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:02,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:02,445 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-28 05:26:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:03,701 INFO L93 Difference]: Finished difference Result 1763 states and 2204 transitions. [2021-12-28 05:26:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:26:03,701 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-28 05:26:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:03,707 INFO L225 Difference]: With dead ends: 1763 [2021-12-28 05:26:03,707 INFO L226 Difference]: Without dead ends: 1761 [2021-12-28 05:26:03,708 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-28 05:26:03,708 INFO L933 BasicCegarLoop]: 1285 mSDtfsCounter, 1883 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2049 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:03,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2049 Valid, 2702 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:26:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2021-12-28 05:26:03,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2021-12-28 05:26:03,766 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-28 05:26:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2202 transitions. [2021-12-28 05:26:03,770 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2202 transitions. Word has length 114 [2021-12-28 05:26:03,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:03,770 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 2202 transitions. [2021-12-28 05:26:03,770 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-28 05:26:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2202 transitions. [2021-12-28 05:26:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-28 05:26:03,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:03,772 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-28 05:26:03,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:26:03,772 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-28 05:26:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1352940516, now seen corresponding path program 1 times [2021-12-28 05:26:03,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:03,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385195262] [2021-12-28 05:26:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:03,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:26:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:26:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:26:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:26:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:26:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:26:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:26:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:26:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:03,910 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-28 05:26:03,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:03,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385195262] [2021-12-28 05:26:03,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385195262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:03,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:03,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:03,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784657348] [2021-12-28 05:26:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:03,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:03,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:03,912 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-28 05:26:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:05,862 INFO L93 Difference]: Finished difference Result 2666 states and 3269 transitions. [2021-12-28 05:26:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:26:05,863 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-28 05:26:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:05,871 INFO L225 Difference]: With dead ends: 2666 [2021-12-28 05:26:05,871 INFO L226 Difference]: Without dead ends: 2664 [2021-12-28 05:26:05,872 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-28 05:26:05,872 INFO L933 BasicCegarLoop]: 1377 mSDtfsCounter, 2664 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 1199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2829 SdHoareTripleChecker+Valid, 3119 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1199 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:05,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2829 Valid, 3119 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1199 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-28 05:26:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-12-28 05:26:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2619. [2021-12-28 05:26:05,959 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-28 05:26:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3243 transitions. [2021-12-28 05:26:05,965 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3243 transitions. Word has length 120 [2021-12-28 05:26:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:05,965 INFO L470 AbstractCegarLoop]: Abstraction has 2619 states and 3243 transitions. [2021-12-28 05:26:05,965 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-28 05:26:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3243 transitions. [2021-12-28 05:26:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-28 05:26:05,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:05,967 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:26:05,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:26:05,967 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-28 05:26:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash -179191031, now seen corresponding path program 1 times [2021-12-28 05:26:05,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:05,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784291833] [2021-12-28 05:26:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:05,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:26:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:26:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:26:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:26:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:26:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:26:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:26:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:26:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:26:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:06,111 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-28 05:26:06,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:06,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784291833] [2021-12-28 05:26:06,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784291833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:06,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:06,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:06,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676400471] [2021-12-28 05:26:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:06,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:06,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:06,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:06,113 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-28 05:26:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:07,986 INFO L93 Difference]: Finished difference Result 3726 states and 4547 transitions. [2021-12-28 05:26:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:26:07,986 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-28 05:26:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:07,998 INFO L225 Difference]: With dead ends: 3726 [2021-12-28 05:26:07,998 INFO L226 Difference]: Without dead ends: 3724 [2021-12-28 05:26:07,999 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-28 05:26:08,000 INFO L933 BasicCegarLoop]: 1360 mSDtfsCounter, 2149 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 1098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2251 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:08,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2251 Valid, 3254 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-28 05:26:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2021-12-28 05:26:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3583. [2021-12-28 05:26:08,130 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-28 05:26:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4407 transitions. [2021-12-28 05:26:08,139 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4407 transitions. Word has length 126 [2021-12-28 05:26:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:08,140 INFO L470 AbstractCegarLoop]: Abstraction has 3583 states and 4407 transitions. [2021-12-28 05:26:08,140 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-28 05:26:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4407 transitions. [2021-12-28 05:26:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-28 05:26:08,142 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:08,142 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-28 05:26:08,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:26:08,142 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-28 05:26:08,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:08,142 INFO L85 PathProgramCache]: Analyzing trace with hash -31471526, now seen corresponding path program 1 times [2021-12-28 05:26:08,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:08,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36565734] [2021-12-28 05:26:08,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:08,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:26:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:26:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:26:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:26:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:26:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 05:26:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-28 05:26:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:26:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:08,286 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-28 05:26:08,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:08,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36565734] [2021-12-28 05:26:08,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36565734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:08,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:08,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:08,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869980434] [2021-12-28 05:26:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:08,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:08,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:08,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:08,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:08,289 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-28 05:26:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:09,832 INFO L93 Difference]: Finished difference Result 6578 states and 8094 transitions. [2021-12-28 05:26:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:26:09,833 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-28 05:26:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:09,849 INFO L225 Difference]: With dead ends: 6578 [2021-12-28 05:26:09,850 INFO L226 Difference]: Without dead ends: 3850 [2021-12-28 05:26:09,856 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-28 05:26:09,857 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1339 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:09,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1341 Valid, 3084 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-28 05:26:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2021-12-28 05:26:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3584. [2021-12-28 05:26:10,016 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-28 05:26:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4408 transitions. [2021-12-28 05:26:10,024 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4408 transitions. Word has length 141 [2021-12-28 05:26:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:10,024 INFO L470 AbstractCegarLoop]: Abstraction has 3584 states and 4408 transitions. [2021-12-28 05:26:10,024 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-28 05:26:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4408 transitions. [2021-12-28 05:26:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-28 05:26:10,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:10,026 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-28 05:26:10,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:26:10,026 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-28 05:26:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1628899092, now seen corresponding path program 1 times [2021-12-28 05:26:10,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:10,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862871551] [2021-12-28 05:26:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:10,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:26:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:26:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:26:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:26:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:26:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:26:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:26:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:26:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:26:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:26:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:10,189 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-28 05:26:10,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:10,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862871551] [2021-12-28 05:26:10,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862871551] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:10,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:10,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:10,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531865511] [2021-12-28 05:26:10,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:10,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:10,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:10,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:10,191 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-28 05:26:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:11,438 INFO L93 Difference]: Finished difference Result 3584 states and 4408 transitions. [2021-12-28 05:26:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:26:11,438 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-28 05:26:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:11,448 INFO L225 Difference]: With dead ends: 3584 [2021-12-28 05:26:11,448 INFO L226 Difference]: Without dead ends: 3582 [2021-12-28 05:26:11,450 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-28 05:26:11,450 INFO L933 BasicCegarLoop]: 1282 mSDtfsCounter, 1879 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:11,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2042 Valid, 2699 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:26:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2021-12-28 05:26:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3582. [2021-12-28 05:26:11,596 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-28 05:26:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4405 transitions. [2021-12-28 05:26:11,603 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4405 transitions. Word has length 132 [2021-12-28 05:26:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:11,603 INFO L470 AbstractCegarLoop]: Abstraction has 3582 states and 4405 transitions. [2021-12-28 05:26:11,604 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-28 05:26:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4405 transitions. [2021-12-28 05:26:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-28 05:26:11,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:11,606 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-28 05:26:11,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:26:11,606 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-28 05:26:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1350192956, now seen corresponding path program 1 times [2021-12-28 05:26:11,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:11,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894132787] [2021-12-28 05:26:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:11,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:26:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:26:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:26:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:26:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:26:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 05:26:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-28 05:26:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:26:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:11,756 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-28 05:26:11,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:11,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894132787] [2021-12-28 05:26:11,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894132787] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:26:11,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319582238] [2021-12-28 05:26:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:11,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:26:11,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:26:11,758 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-28 05:26:11,759 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-28 05:26:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:12,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:26:12,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:26:12,302 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-28 05:26:12,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:26:12,537 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-28 05:26:12,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319582238] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:26:12,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:26:12,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2021-12-28 05:26:12,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887050827] [2021-12-28 05:26:12,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:26:12,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:26:12,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:12,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:26:12,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:26:12,538 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-28 05:26:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:14,267 INFO L93 Difference]: Finished difference Result 6598 states and 8126 transitions. [2021-12-28 05:26:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:26:14,268 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-28 05:26:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:14,278 INFO L225 Difference]: With dead ends: 6598 [2021-12-28 05:26:14,279 INFO L226 Difference]: Without dead ends: 3871 [2021-12-28 05:26:14,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:26:14,286 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1390 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 1032 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 3695 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1032 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:14,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 3695 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1032 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 05:26:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2021-12-28 05:26:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3615. [2021-12-28 05:26:14,417 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-28 05:26:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4453 transitions. [2021-12-28 05:26:14,425 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4453 transitions. Word has length 146 [2021-12-28 05:26:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:14,426 INFO L470 AbstractCegarLoop]: Abstraction has 3615 states and 4453 transitions. [2021-12-28 05:26:14,426 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-28 05:26:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4453 transitions. [2021-12-28 05:26:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-28 05:26:14,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:14,428 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-28 05:26:14,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:26:14,638 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-28 05:26:14,638 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-28 05:26:14,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash 216200491, now seen corresponding path program 1 times [2021-12-28 05:26:14,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:14,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350636713] [2021-12-28 05:26:14,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:14,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:26:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:26:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:26:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:26:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:26:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 05:26:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-28 05:26:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:26:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:14,804 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-28 05:26:14,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:14,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350636713] [2021-12-28 05:26:14,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350636713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:14,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:14,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:26:14,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188328453] [2021-12-28 05:26:14,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:14,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:26:14,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:14,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:26:14,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:26:14,807 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-28 05:26:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:17,177 INFO L93 Difference]: Finished difference Result 3915 states and 4825 transitions. [2021-12-28 05:26:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:26:17,177 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-28 05:26:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:17,190 INFO L225 Difference]: With dead ends: 3915 [2021-12-28 05:26:17,190 INFO L226 Difference]: Without dead ends: 3913 [2021-12-28 05:26:17,192 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-28 05:26:17,192 INFO L933 BasicCegarLoop]: 1350 mSDtfsCounter, 2967 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 2690 mSolverCounterSat, 1694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3081 SdHoareTripleChecker+Valid, 3649 SdHoareTripleChecker+Invalid, 4384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1694 IncrementalHoareTripleChecker+Valid, 2690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:17,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3081 Valid, 3649 Invalid, 4384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1694 Valid, 2690 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-28 05:26:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2021-12-28 05:26:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3615. [2021-12-28 05:26:17,317 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-28 05:26:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4450 transitions. [2021-12-28 05:26:17,324 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4450 transitions. Word has length 147 [2021-12-28 05:26:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:17,324 INFO L470 AbstractCegarLoop]: Abstraction has 3615 states and 4450 transitions. [2021-12-28 05:26:17,324 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-28 05:26:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4450 transitions. [2021-12-28 05:26:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-28 05:26:17,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:17,326 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-28 05:26:17,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:26:17,327 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-28 05:26:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -973056597, now seen corresponding path program 1 times [2021-12-28 05:26:17,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:17,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160958855] [2021-12-28 05:26:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:17,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:26:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:26:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:26:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:26:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:26:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:26:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:26:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:26:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:26:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:26:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:26:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:17,483 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-28 05:26:17,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:17,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160958855] [2021-12-28 05:26:17,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160958855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:17,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:17,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:17,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711800005] [2021-12-28 05:26:17,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:17,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:17,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:17,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:17,486 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-28 05:26:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:19,454 INFO L93 Difference]: Finished difference Result 3948 states and 4802 transitions. [2021-12-28 05:26:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:26:19,455 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-28 05:26:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:19,468 INFO L225 Difference]: With dead ends: 3948 [2021-12-28 05:26:19,469 INFO L226 Difference]: Without dead ends: 3946 [2021-12-28 05:26:19,470 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-28 05:26:19,470 INFO L933 BasicCegarLoop]: 1533 mSDtfsCounter, 1819 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 1066 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 3526 SdHoareTripleChecker+Invalid, 3598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1066 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:19,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1924 Valid, 3526 Invalid, 3598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1066 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-28 05:26:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-12-28 05:26:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3819. [2021-12-28 05:26:19,625 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-28 05:26:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4667 transitions. [2021-12-28 05:26:19,632 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4667 transitions. Word has length 138 [2021-12-28 05:26:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:19,632 INFO L470 AbstractCegarLoop]: Abstraction has 3819 states and 4667 transitions. [2021-12-28 05:26:19,632 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-28 05:26:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4667 transitions. [2021-12-28 05:26:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-28 05:26:19,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:19,634 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-28 05:26:19,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 05:26:19,635 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-28 05:26:19,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1616326209, now seen corresponding path program 1 times [2021-12-28 05:26:19,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:19,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780956283] [2021-12-28 05:26:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:19,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:26:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:26:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:26:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:26:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:26:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 05:26:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-28 05:26:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:26:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:19,792 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-28 05:26:19,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:19,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780956283] [2021-12-28 05:26:19,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780956283] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:19,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:19,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:26:19,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689329627] [2021-12-28 05:26:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:19,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:26:19,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:26:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:26:19,795 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-28 05:26:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:21,310 INFO L93 Difference]: Finished difference Result 4075 states and 5007 transitions. [2021-12-28 05:26:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:26:21,311 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-28 05:26:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:21,320 INFO L225 Difference]: With dead ends: 4075 [2021-12-28 05:26:21,320 INFO L226 Difference]: Without dead ends: 4073 [2021-12-28 05:26:21,321 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-28 05:26:21,321 INFO L933 BasicCegarLoop]: 1272 mSDtfsCounter, 2361 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:21,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2541 Valid, 3094 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-28 05:26:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2021-12-28 05:26:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3817. [2021-12-28 05:26:21,476 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-28 05:26:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 4658 transitions. [2021-12-28 05:26:21,483 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 4658 transitions. Word has length 150 [2021-12-28 05:26:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:21,484 INFO L470 AbstractCegarLoop]: Abstraction has 3817 states and 4658 transitions. [2021-12-28 05:26:21,484 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-28 05:26:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 4658 transitions. [2021-12-28 05:26:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-28 05:26:21,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:21,486 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-28 05:26:21,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 05:26:21,486 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-28 05:26:21,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash 713324926, now seen corresponding path program 1 times [2021-12-28 05:26:21,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:21,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361226334] [2021-12-28 05:26:21,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:21,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:26:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:26:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:26:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:26:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:26:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:26:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:26:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:26:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:26:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:26:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:26:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-28 05:26:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:21,626 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-28 05:26:21,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:21,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361226334] [2021-12-28 05:26:21,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361226334] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:21,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:21,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:21,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044202436] [2021-12-28 05:26:21,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:21,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:21,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:21,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:21,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:21,630 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-28 05:26:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:22,793 INFO L93 Difference]: Finished difference Result 3817 states and 4658 transitions. [2021-12-28 05:26:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:26:22,795 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-28 05:26:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:22,805 INFO L225 Difference]: With dead ends: 3817 [2021-12-28 05:26:22,805 INFO L226 Difference]: Without dead ends: 3815 [2021-12-28 05:26:22,806 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-28 05:26:22,807 INFO L933 BasicCegarLoop]: 1278 mSDtfsCounter, 1867 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:22,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2028 Valid, 2695 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-28 05:26:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2021-12-28 05:26:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3815. [2021-12-28 05:26:22,976 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-28 05:26:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 4655 transitions. [2021-12-28 05:26:22,983 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 4655 transitions. Word has length 144 [2021-12-28 05:26:22,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:22,983 INFO L470 AbstractCegarLoop]: Abstraction has 3815 states and 4655 transitions. [2021-12-28 05:26:22,983 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-28 05:26:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 4655 transitions. [2021-12-28 05:26:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-28 05:26:22,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:22,985 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-28 05:26:22,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 05:26:22,986 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-28 05:26:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:22,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1089934537, now seen corresponding path program 1 times [2021-12-28 05:26:22,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:22,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045714584] [2021-12-28 05:26:22,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:22,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:26:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:26:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:26:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:26:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:26:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 05:26:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-28 05:26:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:26:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,350 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-28 05:26:23,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:23,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045714584] [2021-12-28 05:26:23,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045714584] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:26:23,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200284291] [2021-12-28 05:26:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:23,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:26:23,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:26:23,352 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-28 05:26:23,353 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-28 05:26:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:23,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 05:26:23,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:26:24,004 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-28 05:26:24,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:26:24,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200284291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:24,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 05:26:24,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2021-12-28 05:26:24,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728972943] [2021-12-28 05:26:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:24,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:24,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:24,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-12-28 05:26:24,006 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-28 05:26:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:25,324 INFO L93 Difference]: Finished difference Result 3839 states and 4671 transitions. [2021-12-28 05:26:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:26:25,326 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-28 05:26:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:25,334 INFO L225 Difference]: With dead ends: 3839 [2021-12-28 05:26:25,335 INFO L226 Difference]: Without dead ends: 3837 [2021-12-28 05:26:25,336 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-28 05:26:25,336 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 1360 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:25,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 2643 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:26:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2021-12-28 05:26:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3837. [2021-12-28 05:26:25,491 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-28 05:26:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4662 transitions. [2021-12-28 05:26:25,500 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4662 transitions. Word has length 153 [2021-12-28 05:26:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:25,500 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 4662 transitions. [2021-12-28 05:26:25,500 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-28 05:26:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4662 transitions. [2021-12-28 05:26:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-28 05:26:25,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:25,502 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-28 05:26:25,524 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-28 05:26:25,724 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-28 05:26:25,725 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-28 05:26:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash -281219765, now seen corresponding path program 1 times [2021-12-28 05:26:25,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:25,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509787796] [2021-12-28 05:26:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:25,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:26:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:26:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:26:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:26:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:26:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 05:26:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-28 05:26:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:26:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:25,886 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-28 05:26:25,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:25,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509787796] [2021-12-28 05:26:25,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509787796] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:25,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:25,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:26:25,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515869991] [2021-12-28 05:26:25,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:25,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:26:25,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:25,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:26:25,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:26:25,888 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-28 05:26:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:27,401 INFO L93 Difference]: Finished difference Result 4093 states and 5002 transitions. [2021-12-28 05:26:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:26:27,411 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-28 05:26:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:27,420 INFO L225 Difference]: With dead ends: 4093 [2021-12-28 05:26:27,421 INFO L226 Difference]: Without dead ends: 4091 [2021-12-28 05:26:27,422 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-28 05:26:27,423 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 2321 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2501 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:27,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2501 Valid, 3088 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-28 05:26:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2021-12-28 05:26:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 3835. [2021-12-28 05:26:27,566 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-28 05:26:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 4653 transitions. [2021-12-28 05:26:27,575 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 4653 transitions. Word has length 156 [2021-12-28 05:26:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:27,575 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 4653 transitions. [2021-12-28 05:26:27,575 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-28 05:26:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 4653 transitions. [2021-12-28 05:26:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-28 05:26:27,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:27,577 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-28 05:26:27,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 05:26:27,578 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-28 05:26:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:27,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1200520837, now seen corresponding path program 1 times [2021-12-28 05:26:27,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:27,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226758655] [2021-12-28 05:26:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:27,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:26:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:26:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:26:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:26:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:26:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:26:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:26:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:26:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:26:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:26:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:26:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-28 05:26:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 05:26:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:27,723 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-28 05:26:27,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:27,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226758655] [2021-12-28 05:26:27,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226758655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:27,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:27,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:27,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426009992] [2021-12-28 05:26:27,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:27,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:27,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:27,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:27,725 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-28 05:26:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:28,982 INFO L93 Difference]: Finished difference Result 3835 states and 4653 transitions. [2021-12-28 05:26:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:26:28,982 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-28 05:26:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:28,989 INFO L225 Difference]: With dead ends: 3835 [2021-12-28 05:26:28,990 INFO L226 Difference]: Without dead ends: 3833 [2021-12-28 05:26:28,990 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-28 05:26:28,991 INFO L933 BasicCegarLoop]: 1273 mSDtfsCounter, 1849 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:28,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2009 Valid, 2690 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:26:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2021-12-28 05:26:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3833. [2021-12-28 05:26:29,143 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-28 05:26:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 4650 transitions. [2021-12-28 05:26:29,152 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 4650 transitions. Word has length 150 [2021-12-28 05:26:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:29,152 INFO L470 AbstractCegarLoop]: Abstraction has 3833 states and 4650 transitions. [2021-12-28 05:26:29,153 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-28 05:26:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 4650 transitions. [2021-12-28 05:26:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-28 05:26:29,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:29,155 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-28 05:26:29,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-28 05:26:29,155 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-28 05:26:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:29,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1309291226, now seen corresponding path program 2 times [2021-12-28 05:26:29,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:29,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223767929] [2021-12-28 05:26:29,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:29,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:26:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:26:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 05:26:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:26:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 05:26:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:26:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 05:26:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-28 05:26:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:26:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:26:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:29,329 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-28 05:26:29,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:29,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223767929] [2021-12-28 05:26:29,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223767929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:29,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:29,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:26:29,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381692759] [2021-12-28 05:26:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:29,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:26:29,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:26:29,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:26:29,331 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-28 05:26:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:26:31,498 INFO L93 Difference]: Finished difference Result 4109 states and 5006 transitions. [2021-12-28 05:26:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:26:31,499 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-28 05:26:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:26:31,507 INFO L225 Difference]: With dead ends: 4109 [2021-12-28 05:26:31,507 INFO L226 Difference]: Without dead ends: 4107 [2021-12-28 05:26:31,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:26:31,509 INFO L933 BasicCegarLoop]: 1306 mSDtfsCounter, 1893 mSDsluCounter, 2932 mSDsCounter, 0 mSdLazyCounter, 3171 mSolverCounterSat, 1282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 4238 SdHoareTripleChecker+Invalid, 4453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1282 IncrementalHoareTripleChecker+Valid, 3171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:26:31,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1908 Valid, 4238 Invalid, 4453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1282 Valid, 3171 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 05:26:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2021-12-28 05:26:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3845. [2021-12-28 05:26:31,673 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-28 05:26:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 4659 transitions. [2021-12-28 05:26:31,681 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 4659 transitions. Word has length 161 [2021-12-28 05:26:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:26:31,682 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 4659 transitions. [2021-12-28 05:26:31,682 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-28 05:26:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 4659 transitions. [2021-12-28 05:26:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-28 05:26:31,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:26:31,685 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-28 05:26:31,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-28 05:26:31,685 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-28 05:26:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:26:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -317173186, now seen corresponding path program 1 times [2021-12-28 05:26:31,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:26:31,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495537268] [2021-12-28 05:26:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:26:31,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:26:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:26:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:26:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:26:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 05:26:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:26:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:26:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:26:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:26:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:26:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:26:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:26:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:26:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:26:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:26:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:26:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:26:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:26:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:26:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:26:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:26:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-28 05:26:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 05:26:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 05:26:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:26:31,849 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-28 05:26:31,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:26:31,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495537268] [2021-12-28 05:26:31,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495537268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:26:31,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:26:31,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:26:31,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916242006] [2021-12-28 05:26:31,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:26:31,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:26:31,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:26:31,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:26:31,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:26:31,852 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)