./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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---drivers--mtd--sm_ftl.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 66513110c58cbfd09ef37c44af5b1d4813bd7e87bef538ae0fb21419e856753a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 04:01:57,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:01:57,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:01:57,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:01:57,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:01:57,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:01:57,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:01:57,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:01:57,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:01:57,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:01:57,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:01:57,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:01:57,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:01:57,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:01:57,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:01:57,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:01:57,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:01:57,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:01:57,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:01:57,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:01:57,950 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:01:57,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:01:57,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:01:57,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:01:57,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:01:57,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:01:57,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:01:57,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:01:57,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:01:57,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:01:57,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:01:57,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:01:57,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:01:57,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:01:57,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:01:57,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:01:57,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:01:57,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:01:57,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:01:57,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:01:57,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:01:57,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:01:57,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:01:58,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:01:58,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:01:58,003 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:01:58,003 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:01:58,004 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:01:58,004 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:01:58,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:01:58,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:01:58,005 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:01:58,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:01:58,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:01:58,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:01:58,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:01:58,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:01:58,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:01:58,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:01:58,007 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:01:58,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:01:58,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:01:58,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:01:58,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:01:58,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:01:58,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:01:58,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:01:58,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:01:58,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:01:58,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:01:58,010 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:01:58,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:01:58,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:01:58,010 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 -> 66513110c58cbfd09ef37c44af5b1d4813bd7e87bef538ae0fb21419e856753a [2022-07-20 04:01:58,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:01:58,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:01:58,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:01:58,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:01:58,253 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:01:58,254 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---drivers--mtd--sm_ftl.ko.cil.i [2022-07-20 04:01:58,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deda2bd8e/43faee9686cb4b2ea285fe8e001511af/FLAGf493c83a3 [2022-07-20 04:01:58,980 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:01:58,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2022-07-20 04:01:59,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deda2bd8e/43faee9686cb4b2ea285fe8e001511af/FLAGf493c83a3 [2022-07-20 04:01:59,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deda2bd8e/43faee9686cb4b2ea285fe8e001511af [2022-07-20 04:01:59,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:01:59,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:01:59,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:01:59,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:01:59,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:01:59,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:01:59" (1/1) ... [2022-07-20 04:01:59,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655fdb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:01:59, skipping insertion in model container [2022-07-20 04:01:59,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:01:59" (1/1) ... [2022-07-20 04:01:59,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:01:59,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:02:01,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260078,260091] [2022-07-20 04:02:01,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260223,260236] [2022-07-20 04:02:01,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260369,260382] [2022-07-20 04:02:01,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260534,260547] [2022-07-20 04:02:01,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260692,260705] [2022-07-20 04:02:01,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260850,260863] [2022-07-20 04:02:01,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261008,261021] [2022-07-20 04:02:01,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261168,261181] [2022-07-20 04:02:01,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261327,261340] [2022-07-20 04:02:01,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261466,261479] [2022-07-20 04:02:01,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261608,261621] [2022-07-20 04:02:01,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261757,261770] [2022-07-20 04:02:01,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261896,261909] [2022-07-20 04:02:01,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262051,262064] [2022-07-20 04:02:01,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262211,262224] [2022-07-20 04:02:01,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262362,262375] [2022-07-20 04:02:01,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262513,262526] [2022-07-20 04:02:01,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262665,262678] [2022-07-20 04:02:01,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262814,262827] [2022-07-20 04:02:01,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262962,262975] [2022-07-20 04:02:01,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263119,263132] [2022-07-20 04:02:01,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263268,263281] [2022-07-20 04:02:01,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263424,263437] [2022-07-20 04:02:01,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263577,263590] [2022-07-20 04:02:01,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263723,263736] [2022-07-20 04:02:01,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263866,263879] [2022-07-20 04:02:01,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264018,264031] [2022-07-20 04:02:01,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264164,264177] [2022-07-20 04:02:01,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264309,264322] [2022-07-20 04:02:01,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264463,264476] [2022-07-20 04:02:01,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264614,264627] [2022-07-20 04:02:01,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264769,264782] [2022-07-20 04:02:01,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264921,264934] [2022-07-20 04:02:01,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265076,265089] [2022-07-20 04:02:01,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265240,265253] [2022-07-20 04:02:01,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265396,265409] [2022-07-20 04:02:01,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265560,265573] [2022-07-20 04:02:01,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265702,265715] [2022-07-20 04:02:01,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265860,265873] [2022-07-20 04:02:01,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266027,266040] [2022-07-20 04:02:01,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266186,266199] [2022-07-20 04:02:01,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266345,266358] [2022-07-20 04:02:01,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266494,266507] [2022-07-20 04:02:01,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266641,266654] [2022-07-20 04:02:01,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266780,266793] [2022-07-20 04:02:01,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266943,266956] [2022-07-20 04:02:01,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267109,267122] [2022-07-20 04:02:01,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267273,267286] [2022-07-20 04:02:01,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267438,267451] [2022-07-20 04:02:01,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267603,267616] [2022-07-20 04:02:01,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267769,267782] [2022-07-20 04:02:01,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267934,267947] [2022-07-20 04:02:01,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268101,268114] [2022-07-20 04:02:01,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268261,268274] [2022-07-20 04:02:01,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268423,268436] [2022-07-20 04:02:01,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268582,268595] [2022-07-20 04:02:01,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268728,268741] [2022-07-20 04:02:01,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268871,268884] [2022-07-20 04:02:01,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269015,269028] [2022-07-20 04:02:01,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269158,269171] [2022-07-20 04:02:01,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269302,269315] [2022-07-20 04:02:01,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269443,269456] [2022-07-20 04:02:01,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269581,269594] [2022-07-20 04:02:01,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269739,269752] [2022-07-20 04:02:01,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269898,269911] [2022-07-20 04:02:01,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270054,270067] [2022-07-20 04:02:01,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270203,270216] [2022-07-20 04:02:01,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270355,270368] [2022-07-20 04:02:01,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270506,270519] [2022-07-20 04:02:01,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270655,270668] [2022-07-20 04:02:01,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270807,270820] [2022-07-20 04:02:01,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270955,270968] [2022-07-20 04:02:01,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271108,271121] [2022-07-20 04:02:01,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271259,271272] [2022-07-20 04:02:01,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271409,271422] [2022-07-20 04:02:01,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271556,271569] [2022-07-20 04:02:01,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271707,271720] [2022-07-20 04:02:01,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271858,271871] [2022-07-20 04:02:01,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272006,272019] [2022-07-20 04:02:01,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272172,272185] [2022-07-20 04:02:01,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272341,272354] [2022-07-20 04:02:01,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272508,272521] [2022-07-20 04:02:01,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272676,272689] [2022-07-20 04:02:01,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272826,272839] [2022-07-20 04:02:01,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272973,272986] [2022-07-20 04:02:01,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273134,273147] [2022-07-20 04:02:01,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273304,273317] [2022-07-20 04:02:01,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273466,273479] [2022-07-20 04:02:01,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:02:01,174 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:02:01,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260078,260091] [2022-07-20 04:02:01,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260223,260236] [2022-07-20 04:02:01,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260369,260382] [2022-07-20 04:02:01,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260534,260547] [2022-07-20 04:02:01,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260692,260705] [2022-07-20 04:02:01,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260850,260863] [2022-07-20 04:02:01,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261008,261021] [2022-07-20 04:02:01,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261168,261181] [2022-07-20 04:02:01,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261327,261340] [2022-07-20 04:02:01,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261466,261479] [2022-07-20 04:02:01,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261608,261621] [2022-07-20 04:02:01,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261757,261770] [2022-07-20 04:02:01,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261896,261909] [2022-07-20 04:02:01,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262051,262064] [2022-07-20 04:02:01,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262211,262224] [2022-07-20 04:02:01,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262362,262375] [2022-07-20 04:02:01,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262513,262526] [2022-07-20 04:02:01,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262665,262678] [2022-07-20 04:02:01,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262814,262827] [2022-07-20 04:02:01,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262962,262975] [2022-07-20 04:02:01,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263119,263132] [2022-07-20 04:02:01,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263268,263281] [2022-07-20 04:02:01,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263424,263437] [2022-07-20 04:02:01,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263577,263590] [2022-07-20 04:02:01,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263723,263736] [2022-07-20 04:02:01,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263866,263879] [2022-07-20 04:02:01,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264018,264031] [2022-07-20 04:02:01,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264164,264177] [2022-07-20 04:02:01,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264309,264322] [2022-07-20 04:02:01,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264463,264476] [2022-07-20 04:02:01,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264614,264627] [2022-07-20 04:02:01,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264769,264782] [2022-07-20 04:02:01,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264921,264934] [2022-07-20 04:02:01,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265076,265089] [2022-07-20 04:02:01,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265240,265253] [2022-07-20 04:02:01,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265396,265409] [2022-07-20 04:02:01,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265560,265573] [2022-07-20 04:02:01,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265702,265715] [2022-07-20 04:02:01,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265860,265873] [2022-07-20 04:02:01,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266027,266040] [2022-07-20 04:02:01,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266186,266199] [2022-07-20 04:02:01,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266345,266358] [2022-07-20 04:02:01,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266494,266507] [2022-07-20 04:02:01,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266641,266654] [2022-07-20 04:02:01,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266780,266793] [2022-07-20 04:02:01,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266943,266956] [2022-07-20 04:02:01,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267109,267122] [2022-07-20 04:02:01,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267273,267286] [2022-07-20 04:02:01,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267438,267451] [2022-07-20 04:02:01,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267603,267616] [2022-07-20 04:02:01,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267769,267782] [2022-07-20 04:02:01,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267934,267947] [2022-07-20 04:02:01,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268101,268114] [2022-07-20 04:02:01,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268261,268274] [2022-07-20 04:02:01,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268423,268436] [2022-07-20 04:02:01,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268582,268595] [2022-07-20 04:02:01,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268728,268741] [2022-07-20 04:02:01,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268871,268884] [2022-07-20 04:02:01,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269015,269028] [2022-07-20 04:02:01,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269158,269171] [2022-07-20 04:02:01,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269302,269315] [2022-07-20 04:02:01,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269443,269456] [2022-07-20 04:02:01,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269581,269594] [2022-07-20 04:02:01,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269739,269752] [2022-07-20 04:02:01,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269898,269911] [2022-07-20 04:02:01,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270054,270067] [2022-07-20 04:02:01,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270203,270216] [2022-07-20 04:02:01,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270355,270368] [2022-07-20 04:02:01,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270506,270519] [2022-07-20 04:02:01,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270655,270668] [2022-07-20 04:02:01,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270807,270820] [2022-07-20 04:02:01,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[270955,270968] [2022-07-20 04:02:01,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271108,271121] [2022-07-20 04:02:01,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271259,271272] [2022-07-20 04:02:01,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271409,271422] [2022-07-20 04:02:01,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271556,271569] [2022-07-20 04:02:01,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271707,271720] [2022-07-20 04:02:01,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271858,271871] [2022-07-20 04:02:01,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272006,272019] [2022-07-20 04:02:01,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272172,272185] [2022-07-20 04:02:01,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272341,272354] [2022-07-20 04:02:01,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272508,272521] [2022-07-20 04:02:01,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272676,272689] [2022-07-20 04:02:01,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272826,272839] [2022-07-20 04:02:01,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272973,272986] [2022-07-20 04:02:01,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273134,273147] [2022-07-20 04:02:01,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273304,273317] [2022-07-20 04:02:01,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273466,273479] [2022-07-20 04:02:01,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:02:01,581 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:02:01,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01 WrapperNode [2022-07-20 04:02:01,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:02:01,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:02:01,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:02:01,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:02:01,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:01,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:01,833 INFO L137 Inliner]: procedures = 498, calls = 1418, calls flagged for inlining = 214, calls inlined = 135, statements flattened = 3214 [2022-07-20 04:02:01,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:02:01,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:02:01,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:02:01,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:02:01,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:01,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:01,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:01,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:01,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:01,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:01,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:02,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:02:02,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:02:02,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:02:02,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:02:02,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (1/1) ... [2022-07-20 04:02:02,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:02:02,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:02:02,052 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) [2022-07-20 04:02:02,064 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 [2022-07-20 04:02:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mark_block_bad [2022-07-20 04:02:02,107 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mark_block_bad [2022-07-20 04:02:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:02:02,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:02:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 04:02:02,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 04:02:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-07-20 04:02:02,108 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-07-20 04:02:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2022-07-20 04:02:02,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2022-07-20 04:02:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:02:02,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:02:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:02:02,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:02:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 04:02:02,109 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 04:02:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:02:02,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:02:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:02:02,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:02:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_lba [2022-07-20 04:02:02,110 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_lba [2022-07-20 04:02:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure sm_check_block [2022-07-20 04:02:02,111 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_check_block [2022-07-20 04:02:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-20 04:02:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure sm_release [2022-07-20 04:02:02,111 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_release [2022-07-20 04:02:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:02:02,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:02:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_init [2022-07-20 04:02:02,112 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_init [2022-07-20 04:02:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:02:02,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:02:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:02:02,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:02:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_sector [2022-07-20 04:02:02,113 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_sector [2022-07-20 04:02:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:02:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:02:02,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:02:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure sm_write_sector [2022-07-20 04:02:02,113 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_write_sector [2022-07-20 04:02:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_calculate_ecc [2022-07-20 04:02:02,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_calculate_ecc [2022-07-20 04:02:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2022-07-20 04:02:02,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2022-07-20 04:02:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 04:02:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure sm_remove_dev [2022-07-20 04:02:02,114 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_remove_dev [2022-07-20 04:02:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 04:02:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:02:02,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:02:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:02:02,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:02:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2022-07-20 04:02:02,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2022-07-20 04:02:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:02:02,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:02:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:02:02,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:02:02,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:02:02,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-20 04:02:02,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-20 04:02:02,117 INFO L130 BoogieDeclarations]: Found specification of procedure sm_recheck_media [2022-07-20 04:02:02,117 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_recheck_media [2022-07-20 04:02:02,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 04:02:02,118 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 04:02:02,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:02:02,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:02:02,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 04:02:02,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 04:02:02,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:02:02,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:02:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_put [2022-07-20 04:02:02,122 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_put [2022-07-20 04:02:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_cis [2022-07-20 04:02:02,122 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_cis [2022-07-20 04:02:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:02:02,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:02:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:02:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:02:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:02:02,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:02:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:02:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 04:02:02,128 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 04:02:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_out [2022-07-20 04:02:02,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_out [2022-07-20 04:02:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:02:02,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:02:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2022-07-20 04:02:02,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2022-07-20 04:02:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_flush [2022-07-20 04:02:02,129 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_flush [2022-07-20 04:02:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:02:02,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:02:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-20 04:02:02,130 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-20 04:02:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_zone [2022-07-20 04:02:02,130 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_zone [2022-07-20 04:02:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 04:02:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 04:02:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2022-07-20 04:02:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2022-07-20 04:02:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:02:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:02:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-20 04:02:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-20 04:02:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mkoffset [2022-07-20 04:02:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mkoffset [2022-07-20 04:02:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 04:02:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 04:02:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_lba [2022-07-20 04:02:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_lba [2022-07-20 04:02:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:02:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:02:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:02:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:02:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:02:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:02:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:02:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:02:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:02:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure mtd_is_eccerr [2022-07-20 04:02:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure mtd_is_eccerr [2022-07-20 04:02:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-20 04:02:02,135 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-20 04:02:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:02:02,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:02:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:02:02,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:02:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_in [2022-07-20 04:02:02,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_in [2022-07-20 04:02:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 04:02:02,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 04:02:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:02:02,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:02:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:02:02,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:02:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:02:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:02:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_correct_data [2022-07-20 04:02:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_correct_data [2022-07-20 04:02:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:02:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:02:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 04:02:02,138 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 04:02:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:02:02,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:02:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:02:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:02:02,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:02:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2022-07-20 04:02:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2022-07-20 04:02:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:02:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:02:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:02:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:02:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure sm_sector_valid [2022-07-20 04:02:02,140 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_sector_valid [2022-07-20 04:02:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure sm_erase_block [2022-07-20 04:02:02,140 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_erase_block [2022-07-20 04:02:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-20 04:02:02,140 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-20 04:02:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:02:02,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:02:02,141 INFO L130 BoogieDeclarations]: Found specification of procedure sm_break_offset [2022-07-20 04:02:02,141 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_break_offset [2022-07-20 04:02:02,141 INFO L130 BoogieDeclarations]: Found specification of procedure sm_block_valid [2022-07-20 04:02:02,141 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_block_valid [2022-07-20 04:02:02,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:02:02,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:02:02,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:02:02,660 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:02:02,662 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:02:03,179 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:02:04,630 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:02:04,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:02:04,653 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 04:02:04,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:02:04 BoogieIcfgContainer [2022-07-20 04:02:04,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:02:04,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:02:04,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:02:04,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:02:04,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:01:59" (1/3) ... [2022-07-20 04:02:04,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334353c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:02:04, skipping insertion in model container [2022-07-20 04:02:04,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:02:01" (2/3) ... [2022-07-20 04:02:04,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334353c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:02:04, skipping insertion in model container [2022-07-20 04:02:04,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:02:04" (3/3) ... [2022-07-20 04:02:04,666 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2022-07-20 04:02:04,677 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:02:04,678 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-20 04:02:04,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:02:04,767 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d6872a1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3da0b333 [2022-07-20 04:02:04,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-20 04:02:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 1158 states, 802 states have (on average 1.3291770573566084) internal successors, (1066), 853 states have internal predecessors, (1066), 251 states have call successors, (251), 78 states have call predecessors, (251), 77 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) [2022-07-20 04:02:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 04:02:04,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:04,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:04,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:02:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1248621391, now seen corresponding path program 1 times [2022-07-20 04:02:04,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:04,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495908950] [2022-07-20 04:02:04,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:05,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:05,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:05,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:05,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:05,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495908950] [2022-07-20 04:02:05,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495908950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:05,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:05,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:05,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802125453] [2022-07-20 04:02:05,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:05,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:05,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:05,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:05,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:05,313 INFO L87 Difference]: Start difference. First operand has 1158 states, 802 states have (on average 1.3291770573566084) internal successors, (1066), 853 states have internal predecessors, (1066), 251 states have call successors, (251), 78 states have call predecessors, (251), 77 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 04:02:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:07,767 INFO L93 Difference]: Finished difference Result 2288 states and 3171 transitions. [2022-07-20 04:02:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:07,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-07-20 04:02:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:07,786 INFO L225 Difference]: With dead ends: 2288 [2022-07-20 04:02:07,786 INFO L226 Difference]: Without dead ends: 1142 [2022-07-20 04:02:07,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:02:07,797 INFO L413 NwaCegarLoop]: 1391 mSDtfsCounter, 2579 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 1040 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2686 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:07,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2686 Valid, 2417 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 04:02:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-20 04:02:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2022-07-20 04:02:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 792 states have (on average 1.2878787878787878) internal successors, (1020), 840 states have internal predecessors, (1020), 248 states have call successors, (248), 77 states have call predecessors, (248), 76 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2022-07-20 04:02:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1514 transitions. [2022-07-20 04:02:07,910 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1514 transitions. Word has length 50 [2022-07-20 04:02:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:07,911 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1514 transitions. [2022-07-20 04:02:07,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 04:02:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1514 transitions. [2022-07-20 04:02:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 04:02:07,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:07,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:07,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:02:07,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:02:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash 989377887, now seen corresponding path program 1 times [2022-07-20 04:02:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:07,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310269672] [2022-07-20 04:02:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:08,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:08,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310269672] [2022-07-20 04:02:08,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310269672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:08,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:08,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323882786] [2022-07-20 04:02:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:08,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:08,084 INFO L87 Difference]: Start difference. First operand 1142 states and 1514 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-20 04:02:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:10,188 INFO L93 Difference]: Finished difference Result 1142 states and 1514 transitions. [2022-07-20 04:02:10,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:10,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2022-07-20 04:02:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:10,197 INFO L225 Difference]: With dead ends: 1142 [2022-07-20 04:02:10,197 INFO L226 Difference]: Without dead ends: 1140 [2022-07-20 04:02:10,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:02:10,199 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 2549 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:10,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 2389 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 04:02:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-20 04:02:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-07-20 04:02:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 791 states have (on average 1.2869785082174463) internal successors, (1018), 838 states have internal predecessors, (1018), 248 states have call successors, (248), 77 states have call predecessors, (248), 76 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2022-07-20 04:02:10,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1512 transitions. [2022-07-20 04:02:10,256 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1512 transitions. Word has length 56 [2022-07-20 04:02:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:10,256 INFO L495 AbstractCegarLoop]: Abstraction has 1140 states and 1512 transitions. [2022-07-20 04:02:10,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-20 04:02:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1512 transitions. [2022-07-20 04:02:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 04:02:10,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:10,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:10,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:02:10,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_mutex__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 25 more)] === [2022-07-20 04:02:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash 735069371, now seen corresponding path program 1 times [2022-07-20 04:02:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:10,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059764514] [2022-07-20 04:02:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:10,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:02:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:02:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:02:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:02:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:02:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:10,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059764514] [2022-07-20 04:02:10,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059764514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:10,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:10,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:10,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763020933] [2022-07-20 04:02:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:10,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:10,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:10,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:10,420 INFO L87 Difference]: Start difference. First operand 1140 states and 1512 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-20 04:02:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:12,466 INFO L93 Difference]: Finished difference Result 1391 states and 1841 transitions. [2022-07-20 04:02:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:12,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2022-07-20 04:02:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:12,477 INFO L225 Difference]: With dead ends: 1391 [2022-07-20 04:02:12,478 INFO L226 Difference]: Without dead ends: 1389 [2022-07-20 04:02:12,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:02:12,482 INFO L413 NwaCegarLoop]: 1696 mSDtfsCounter, 1113 mSDsluCounter, 3707 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 5403 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:12,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 5403 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:02:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2022-07-20 04:02:12,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1358. [2022-07-20 04:02:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 942 states have (on average 1.2898089171974523) internal successors, (1215), 994 states have internal predecessors, (1215), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1795 transitions. [2022-07-20 04:02:12,568 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1795 transitions. Word has length 62 [2022-07-20 04:02:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:12,569 INFO L495 AbstractCegarLoop]: Abstraction has 1358 states and 1795 transitions. [2022-07-20 04:02:12,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-20 04:02:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1795 transitions. [2022-07-20 04:02:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 04:02:12,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:12,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:12,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:02:12,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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 25 more)] === [2022-07-20 04:02:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash -369420907, now seen corresponding path program 1 times [2022-07-20 04:02:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:12,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281518049] [2022-07-20 04:02:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:12,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:12,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281518049] [2022-07-20 04:02:12,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281518049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:12,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:12,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:12,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693759557] [2022-07-20 04:02:12,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:12,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:12,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:12,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:12,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:12,723 INFO L87 Difference]: Start difference. First operand 1358 states and 1795 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 04:02:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:14,757 INFO L93 Difference]: Finished difference Result 1358 states and 1795 transitions. [2022-07-20 04:02:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 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 62 [2022-07-20 04:02:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:14,765 INFO L225 Difference]: With dead ends: 1358 [2022-07-20 04:02:14,765 INFO L226 Difference]: Without dead ends: 1356 [2022-07-20 04:02:14,766 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:14,767 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 2537 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2640 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:14,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2640 Valid, 2385 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:02:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-07-20 04:02:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2022-07-20 04:02:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 941 states have (on average 1.2890541976620615) internal successors, (1213), 992 states have internal predecessors, (1213), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1793 transitions. [2022-07-20 04:02:14,827 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1793 transitions. Word has length 62 [2022-07-20 04:02:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:14,827 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1793 transitions. [2022-07-20 04:02:14,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 04:02:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1793 transitions. [2022-07-20 04:02:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 04:02:14,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:14,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:14,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:02:14,830 INFO L420 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 25 more)] === [2022-07-20 04:02:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1572676478, now seen corresponding path program 1 times [2022-07-20 04:02:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:14,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661032368] [2022-07-20 04:02:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:14,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661032368] [2022-07-20 04:02:14,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661032368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:14,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:14,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457098847] [2022-07-20 04:02:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:14,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:14,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:14,954 INFO L87 Difference]: Start difference. First operand 1356 states and 1793 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 04:02:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:16,986 INFO L93 Difference]: Finished difference Result 1356 states and 1793 transitions. [2022-07-20 04:02:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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 68 [2022-07-20 04:02:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:16,993 INFO L225 Difference]: With dead ends: 1356 [2022-07-20 04:02:16,993 INFO L226 Difference]: Without dead ends: 1354 [2022-07-20 04:02:16,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:02:16,995 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 2531 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2633 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:16,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2633 Valid, 2383 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:02:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2022-07-20 04:02:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2022-07-20 04:02:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 940 states have (on average 1.2882978723404255) internal successors, (1211), 990 states have internal predecessors, (1211), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1791 transitions. [2022-07-20 04:02:17,057 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1791 transitions. Word has length 68 [2022-07-20 04:02:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:17,058 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 1791 transitions. [2022-07-20 04:02:17,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 04:02:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1791 transitions. [2022-07-20 04:02:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 04:02:17,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:17,061 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:17,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:02:17,062 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:02:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash 492776973, now seen corresponding path program 1 times [2022-07-20 04:02:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:17,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91472538] [2022-07-20 04:02:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:02:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:02:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:02:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:02:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:02:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:02:17,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:17,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91472538] [2022-07-20 04:02:17,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91472538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:17,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:17,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:02:17,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118922642] [2022-07-20 04:02:17,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:17,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:02:17,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:02:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:02:17,256 INFO L87 Difference]: Start difference. First operand 1354 states and 1791 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 04:02:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:19,134 INFO L93 Difference]: Finished difference Result 2717 states and 3609 transitions. [2022-07-20 04:02:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2022-07-20 04:02:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:19,146 INFO L225 Difference]: With dead ends: 2717 [2022-07-20 04:02:19,146 INFO L226 Difference]: Without dead ends: 1381 [2022-07-20 04:02:19,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:02:19,155 INFO L413 NwaCegarLoop]: 1463 mSDtfsCounter, 1583 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 4914 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:19,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 4914 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-20 04:02:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2022-07-20 04:02:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1354. [2022-07-20 04:02:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 940 states have (on average 1.2861702127659576) internal successors, (1209), 990 states have internal predecessors, (1209), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1789 transitions. [2022-07-20 04:02:19,222 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1789 transitions. Word has length 71 [2022-07-20 04:02:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:19,222 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 1789 transitions. [2022-07-20 04:02:19,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 04:02:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1789 transitions. [2022-07-20 04:02:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 04:02:19,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:19,224 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:19,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:02:19,225 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:02:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:19,225 INFO L85 PathProgramCache]: Analyzing trace with hash 492836555, now seen corresponding path program 1 times [2022-07-20 04:02:19,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:19,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026790556] [2022-07-20 04:02:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:19,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:02:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:02:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:02:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:02:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:02:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:02:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:19,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026790556] [2022-07-20 04:02:19,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026790556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:19,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:19,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 04:02:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193242642] [2022-07-20 04:02:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:19,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 04:02:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 04:02:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 04:02:19,343 INFO L87 Difference]: Start difference. First operand 1354 states and 1789 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-20 04:02:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:20,801 INFO L93 Difference]: Finished difference Result 1381 states and 1831 transitions. [2022-07-20 04:02:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 04:02:20,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2022-07-20 04:02:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:20,811 INFO L225 Difference]: With dead ends: 1381 [2022-07-20 04:02:20,811 INFO L226 Difference]: Without dead ends: 1379 [2022-07-20 04:02:20,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:02:20,812 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 318 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 4181 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:20,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 4181 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 04:02:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-07-20 04:02:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1352. [2022-07-20 04:02:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 939 states have (on average 1.2843450479233227) internal successors, (1206), 988 states have internal predecessors, (1206), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1786 transitions. [2022-07-20 04:02:20,864 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1786 transitions. Word has length 71 [2022-07-20 04:02:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:20,865 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1786 transitions. [2022-07-20 04:02:20,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-20 04:02:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1786 transitions. [2022-07-20 04:02:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 04:02:20,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:20,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:20,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 04:02:20,867 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 25 more)] === [2022-07-20 04:02:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1602363486, now seen corresponding path program 1 times [2022-07-20 04:02:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:20,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528028710] [2022-07-20 04:02:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:21,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:21,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528028710] [2022-07-20 04:02:21,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528028710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:21,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:21,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785183928] [2022-07-20 04:02:21,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:21,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:21,010 INFO L87 Difference]: Start difference. First operand 1352 states and 1786 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 04:02:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:22,871 INFO L93 Difference]: Finished difference Result 1352 states and 1786 transitions. [2022-07-20 04:02:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:22,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 74 [2022-07-20 04:02:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:22,878 INFO L225 Difference]: With dead ends: 1352 [2022-07-20 04:02:22,878 INFO L226 Difference]: Without dead ends: 1350 [2022-07-20 04:02:22,879 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:22,880 INFO L413 NwaCegarLoop]: 1364 mSDtfsCounter, 2516 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2617 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:22,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2617 Valid, 2378 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 04:02:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2022-07-20 04:02:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2022-07-20 04:02:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 938 states have (on average 1.2835820895522387) internal successors, (1204), 986 states have internal predecessors, (1204), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1784 transitions. [2022-07-20 04:02:22,939 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1784 transitions. Word has length 74 [2022-07-20 04:02:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:22,939 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1784 transitions. [2022-07-20 04:02:22,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 04:02:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1784 transitions. [2022-07-20 04:02:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-20 04:02:22,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:22,941 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:22,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 04:02:22,943 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:02:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1226418991, now seen corresponding path program 1 times [2022-07-20 04:02:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:22,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040948900] [2022-07-20 04:02:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:02:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:02:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:02:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:02:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:02:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:02:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:23,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040948900] [2022-07-20 04:02:23,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040948900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:23,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:23,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 04:02:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366800234] [2022-07-20 04:02:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:23,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 04:02:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 04:02:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 04:02:23,067 INFO L87 Difference]: Start difference. First operand 1350 states and 1784 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 04:02:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:23,930 INFO L93 Difference]: Finished difference Result 2703 states and 3588 transitions. [2022-07-20 04:02:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 04:02:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2022-07-20 04:02:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:23,937 INFO L225 Difference]: With dead ends: 2703 [2022-07-20 04:02:23,937 INFO L226 Difference]: Without dead ends: 1371 [2022-07-20 04:02:23,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 04:02:23,943 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 1556 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:23,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 2126 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 04:02:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-07-20 04:02:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1344. [2022-07-20 04:02:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 933 states have (on average 1.2808145766345123) internal successors, (1195), 980 states have internal predecessors, (1195), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1775 transitions. [2022-07-20 04:02:24,032 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1775 transitions. Word has length 75 [2022-07-20 04:02:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:24,032 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1775 transitions. [2022-07-20 04:02:24,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 04:02:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1775 transitions. [2022-07-20 04:02:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-20 04:02:24,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:24,034 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:24,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:02:24,035 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_assert_linux_kernel_locking_mutex__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 25 more)] === [2022-07-20 04:02:24,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash 235936066, now seen corresponding path program 1 times [2022-07-20 04:02:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:24,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060041536] [2022-07-20 04:02:24,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:24,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:02:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:02:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:02:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:02:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:02:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:02:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:02:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:24,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060041536] [2022-07-20 04:02:24,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060041536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:24,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:24,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:02:24,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844262582] [2022-07-20 04:02:24,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:24,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:02:24,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:02:24,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:02:24,222 INFO L87 Difference]: Start difference. First operand 1344 states and 1775 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 04:02:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:27,777 INFO L93 Difference]: Finished difference Result 1384 states and 1840 transitions. [2022-07-20 04:02:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 04:02:27,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 80 [2022-07-20 04:02:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:27,784 INFO L225 Difference]: With dead ends: 1384 [2022-07-20 04:02:27,785 INFO L226 Difference]: Without dead ends: 1382 [2022-07-20 04:02:27,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-20 04:02:27,786 INFO L413 NwaCegarLoop]: 1338 mSDtfsCounter, 2127 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 3999 mSolverCounterSat, 1406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 5405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1406 IncrementalHoareTripleChecker+Valid, 3999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:27,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 3108 Invalid, 5405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1406 Valid, 3999 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-20 04:02:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-07-20 04:02:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1342. [2022-07-20 04:02:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 932 states have (on average 1.2800429184549356) internal successors, (1193), 978 states have internal predecessors, (1193), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1773 transitions. [2022-07-20 04:02:27,851 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1773 transitions. Word has length 80 [2022-07-20 04:02:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:27,851 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 1773 transitions. [2022-07-20 04:02:27,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 04:02:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1773 transitions. [2022-07-20 04:02:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-20 04:02:27,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:27,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:27,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:02:27,853 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 25 more)] === [2022-07-20 04:02:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash -55840951, now seen corresponding path program 1 times [2022-07-20 04:02:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:27,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864949676] [2022-07-20 04:02:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:27,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:28,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:28,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864949676] [2022-07-20 04:02:28,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864949676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:28,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:28,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:28,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263834454] [2022-07-20 04:02:28,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:28,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:28,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:28,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:28,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:28,004 INFO L87 Difference]: Start difference. First operand 1342 states and 1773 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 04:02:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:29,901 INFO L93 Difference]: Finished difference Result 1342 states and 1773 transitions. [2022-07-20 04:02:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:29,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 80 [2022-07-20 04:02:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:29,907 INFO L225 Difference]: With dead ends: 1342 [2022-07-20 04:02:29,907 INFO L226 Difference]: Without dead ends: 1340 [2022-07-20 04:02:29,907 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:29,908 INFO L413 NwaCegarLoop]: 1355 mSDtfsCounter, 2489 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:29,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 2369 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 04:02:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-07-20 04:02:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2022-07-20 04:02:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 931 states have (on average 1.2792696025778731) internal successors, (1191), 976 states have internal predecessors, (1191), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1771 transitions. [2022-07-20 04:02:29,970 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1771 transitions. Word has length 80 [2022-07-20 04:02:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:29,970 INFO L495 AbstractCegarLoop]: Abstraction has 1340 states and 1771 transitions. [2022-07-20 04:02:29,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 04:02:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1771 transitions. [2022-07-20 04:02:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-20 04:02:29,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:29,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:29,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 04:02:29,972 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 25 more)] === [2022-07-20 04:02:29,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash -431123591, now seen corresponding path program 1 times [2022-07-20 04:02:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:29,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88517998] [2022-07-20 04:02:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:02:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:30,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:30,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88517998] [2022-07-20 04:02:30,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88517998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:30,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:30,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601795119] [2022-07-20 04:02:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:30,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:30,101 INFO L87 Difference]: Start difference. First operand 1340 states and 1771 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:02:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:31,911 INFO L93 Difference]: Finished difference Result 1340 states and 1771 transitions. [2022-07-20 04:02:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:31,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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 86 [2022-07-20 04:02:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:31,918 INFO L225 Difference]: With dead ends: 1340 [2022-07-20 04:02:31,918 INFO L226 Difference]: Without dead ends: 1338 [2022-07-20 04:02:31,919 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:31,919 INFO L413 NwaCegarLoop]: 1353 mSDtfsCounter, 2483 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:31,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 2367 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-20 04:02:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-07-20 04:02:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2022-07-20 04:02:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 930 states have (on average 1.278494623655914) internal successors, (1189), 974 states have internal predecessors, (1189), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1769 transitions. [2022-07-20 04:02:31,997 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1769 transitions. Word has length 86 [2022-07-20 04:02:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:31,998 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1769 transitions. [2022-07-20 04:02:31,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:02:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1769 transitions. [2022-07-20 04:02:32,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-20 04:02:32,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:32,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:32,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:02:32,004 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 25 more)] === [2022-07-20 04:02:32,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:32,004 INFO L85 PathProgramCache]: Analyzing trace with hash 902433868, now seen corresponding path program 1 times [2022-07-20 04:02:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:32,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221763131] [2022-07-20 04:02:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:02:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:02:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221763131] [2022-07-20 04:02:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221763131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:32,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:32,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065336237] [2022-07-20 04:02:32,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:32,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:32,134 INFO L87 Difference]: Start difference. First operand 1338 states and 1769 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 04:02:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:33,764 INFO L93 Difference]: Finished difference Result 1338 states and 1769 transitions. [2022-07-20 04:02:33,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:33,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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 92 [2022-07-20 04:02:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:33,770 INFO L225 Difference]: With dead ends: 1338 [2022-07-20 04:02:33,771 INFO L226 Difference]: Without dead ends: 1336 [2022-07-20 04:02:33,771 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:33,772 INFO L413 NwaCegarLoop]: 1351 mSDtfsCounter, 2481 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:33,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 2365 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-20 04:02:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-07-20 04:02:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-07-20 04:02:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 929 states have (on average 1.2777179763186222) internal successors, (1187), 972 states have internal predecessors, (1187), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1767 transitions. [2022-07-20 04:02:33,837 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1767 transitions. Word has length 92 [2022-07-20 04:02:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:33,837 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 1767 transitions. [2022-07-20 04:02:33,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 04:02:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1767 transitions. [2022-07-20 04:02:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 04:02:33,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:33,839 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:33,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:02:33,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 25 more)] === [2022-07-20 04:02:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash -344293265, now seen corresponding path program 1 times [2022-07-20 04:02:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:33,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697395530] [2022-07-20 04:02:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:02:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:02:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:33,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697395530] [2022-07-20 04:02:33,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697395530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:33,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:33,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709637032] [2022-07-20 04:02:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:33,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:33,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:33,958 INFO L87 Difference]: Start difference. First operand 1336 states and 1767 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 04:02:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:35,680 INFO L93 Difference]: Finished difference Result 1336 states and 1767 transitions. [2022-07-20 04:02:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:35,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-20 04:02:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:35,685 INFO L225 Difference]: With dead ends: 1336 [2022-07-20 04:02:35,685 INFO L226 Difference]: Without dead ends: 1334 [2022-07-20 04:02:35,685 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:35,686 INFO L413 NwaCegarLoop]: 1349 mSDtfsCounter, 2469 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:35,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2567 Valid, 2363 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-20 04:02:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-07-20 04:02:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2022-07-20 04:02:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 928 states have (on average 1.2769396551724137) internal successors, (1185), 970 states have internal predecessors, (1185), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1765 transitions. [2022-07-20 04:02:35,751 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1765 transitions. Word has length 94 [2022-07-20 04:02:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:35,752 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1765 transitions. [2022-07-20 04:02:35,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 04:02:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1765 transitions. [2022-07-20 04:02:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-20 04:02:35,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:35,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:35,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 04:02:35,755 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 25 more)] === [2022-07-20 04:02:35,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1753336582, now seen corresponding path program 1 times [2022-07-20 04:02:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:35,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157643794] [2022-07-20 04:02:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:02:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:02:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:02:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:35,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:35,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157643794] [2022-07-20 04:02:35,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157643794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:35,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:35,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602861687] [2022-07-20 04:02:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:35,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:35,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:35,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:35,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:35,872 INFO L87 Difference]: Start difference. First operand 1334 states and 1765 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 04:02:38,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 04:02:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:39,993 INFO L93 Difference]: Finished difference Result 1334 states and 1765 transitions. [2022-07-20 04:02:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:39,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-20 04:02:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:39,998 INFO L225 Difference]: With dead ends: 1334 [2022-07-20 04:02:39,998 INFO L226 Difference]: Without dead ends: 1332 [2022-07-20 04:02:39,999 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:39,999 INFO L413 NwaCegarLoop]: 1347 mSDtfsCounter, 2465 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 1034 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:40,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 2361 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1430 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 04:02:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-07-20 04:02:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2022-07-20 04:02:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 927 states have (on average 1.2761596548004315) internal successors, (1183), 968 states have internal predecessors, (1183), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1763 transitions. [2022-07-20 04:02:40,067 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1763 transitions. Word has length 100 [2022-07-20 04:02:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:40,067 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1763 transitions. [2022-07-20 04:02:40,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 04:02:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1763 transitions. [2022-07-20 04:02:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 04:02:40,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:40,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:02:40,070 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 25 more)] === [2022-07-20 04:02:40,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash 630217368, now seen corresponding path program 1 times [2022-07-20 04:02:40,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:40,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691933269] [2022-07-20 04:02:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:02:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:02:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:02:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:02:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:40,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:40,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691933269] [2022-07-20 04:02:40,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691933269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:40,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:40,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893363007] [2022-07-20 04:02:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:40,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:40,205 INFO L87 Difference]: Start difference. First operand 1332 states and 1763 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:02:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:42,193 INFO L93 Difference]: Finished difference Result 1332 states and 1763 transitions. [2022-07-20 04:02:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:42,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-20 04:02:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:42,199 INFO L225 Difference]: With dead ends: 1332 [2022-07-20 04:02:42,199 INFO L226 Difference]: Without dead ends: 1330 [2022-07-20 04:02:42,200 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:42,200 INFO L413 NwaCegarLoop]: 1345 mSDtfsCounter, 2459 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2555 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 2463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:42,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2555 Valid, 2359 Invalid, 2463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:02:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2022-07-20 04:02:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-07-20 04:02:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 926 states have (on average 1.275377969762419) internal successors, (1181), 966 states have internal predecessors, (1181), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1761 transitions. [2022-07-20 04:02:42,273 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1761 transitions. Word has length 106 [2022-07-20 04:02:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:42,273 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1761 transitions. [2022-07-20 04:02:42,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:02:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1761 transitions. [2022-07-20 04:02:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-20 04:02:42,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:42,276 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:42,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:02:42,276 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 25 more)] === [2022-07-20 04:02:42,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1254059172, now seen corresponding path program 1 times [2022-07-20 04:02:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:42,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207846528] [2022-07-20 04:02:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:02:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:02:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:02:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:02:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:02:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:42,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:42,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207846528] [2022-07-20 04:02:42,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207846528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:42,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:42,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:42,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191465061] [2022-07-20 04:02:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:42,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:42,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:42,404 INFO L87 Difference]: Start difference. First operand 1330 states and 1761 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 04:02:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:44,382 INFO L93 Difference]: Finished difference Result 1330 states and 1761 transitions. [2022-07-20 04:02:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:44,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 112 [2022-07-20 04:02:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:44,386 INFO L225 Difference]: With dead ends: 1330 [2022-07-20 04:02:44,386 INFO L226 Difference]: Without dead ends: 1328 [2022-07-20 04:02:44,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:02:44,387 INFO L413 NwaCegarLoop]: 1343 mSDtfsCounter, 2453 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2548 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:44,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2548 Valid, 2357 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:02:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-07-20 04:02:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2022-07-20 04:02:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 925 states have (on average 1.2745945945945947) internal successors, (1179), 964 states have internal predecessors, (1179), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1759 transitions. [2022-07-20 04:02:44,454 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1759 transitions. Word has length 112 [2022-07-20 04:02:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:44,454 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1759 transitions. [2022-07-20 04:02:44,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 04:02:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1759 transitions. [2022-07-20 04:02:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-20 04:02:44,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:44,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:44,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 04:02:44,457 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 25 more)] === [2022-07-20 04:02:44,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1834678598, now seen corresponding path program 1 times [2022-07-20 04:02:44,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:44,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799457314] [2022-07-20 04:02:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:44,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:02:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:02:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:02:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:02:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:02:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 04:02:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:44,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:44,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799457314] [2022-07-20 04:02:44,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799457314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:44,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:44,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025491418] [2022-07-20 04:02:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:44,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:44,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:44,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:44,589 INFO L87 Difference]: Start difference. First operand 1328 states and 1759 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:02:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:46,609 INFO L93 Difference]: Finished difference Result 1328 states and 1759 transitions. [2022-07-20 04:02:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 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 118 [2022-07-20 04:02:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:46,617 INFO L225 Difference]: With dead ends: 1328 [2022-07-20 04:02:46,617 INFO L226 Difference]: Without dead ends: 1326 [2022-07-20 04:02:46,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:02:46,618 INFO L413 NwaCegarLoop]: 1341 mSDtfsCounter, 2447 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:46,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2541 Valid, 2355 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:02:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-07-20 04:02:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2022-07-20 04:02:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 924 states have (on average 1.2738095238095237) internal successors, (1177), 962 states have internal predecessors, (1177), 291 states have call successors, (291), 102 states have call predecessors, (291), 101 states have return successors, (289), 287 states have call predecessors, (289), 289 states have call successors, (289) [2022-07-20 04:02:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1757 transitions. [2022-07-20 04:02:46,708 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1757 transitions. Word has length 118 [2022-07-20 04:02:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:46,708 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1757 transitions. [2022-07-20 04:02:46,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:02:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1757 transitions. [2022-07-20 04:02:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-20 04:02:46,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:46,711 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:46,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 04:02:46,712 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:02:46,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:46,712 INFO L85 PathProgramCache]: Analyzing trace with hash -303721131, now seen corresponding path program 1 times [2022-07-20 04:02:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:46,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520361597] [2022-07-20 04:02:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:02:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:02:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:02:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:02:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:02:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:02:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:02:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:02:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 04:02:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:02:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:02:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:02:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:46,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520361597] [2022-07-20 04:02:46,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520361597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:46,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:46,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:02:46,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356768238] [2022-07-20 04:02:46,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:46,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:02:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:46,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:02:46,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:02:46,940 INFO L87 Difference]: Start difference. First operand 1326 states and 1757 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 04:02:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:51,908 INFO L93 Difference]: Finished difference Result 2845 states and 3829 transitions. [2022-07-20 04:02:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 04:02:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 121 [2022-07-20 04:02:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:51,915 INFO L225 Difference]: With dead ends: 2845 [2022-07-20 04:02:51,915 INFO L226 Difference]: Without dead ends: 1537 [2022-07-20 04:02:51,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-07-20 04:02:51,920 INFO L413 NwaCegarLoop]: 1391 mSDtfsCounter, 1409 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 5566 mSolverCounterSat, 1060 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 6626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1060 IncrementalHoareTripleChecker+Valid, 5566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:51,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 3503 Invalid, 6626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1060 Valid, 5566 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-20 04:02:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-07-20 04:02:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1330. [2022-07-20 04:02:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 927 states have (on average 1.2729234088457388) internal successors, (1180), 965 states have internal predecessors, (1180), 291 states have call successors, (291), 102 states have call predecessors, (291), 102 states have return successors, (294), 288 states have call predecessors, (294), 289 states have call successors, (294) [2022-07-20 04:02:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1765 transitions. [2022-07-20 04:02:51,996 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1765 transitions. Word has length 121 [2022-07-20 04:02:51,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:51,996 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1765 transitions. [2022-07-20 04:02:51,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 04:02:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1765 transitions. [2022-07-20 04:02:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-20 04:02:51,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:51,999 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:51,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 04:02:52,000 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:02:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1339404786, now seen corresponding path program 1 times [2022-07-20 04:02:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:52,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249422840] [2022-07-20 04:02:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:02:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:02:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:02:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:02:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:02:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:02:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:02:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:02:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 04:02:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:02:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 04:02:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 04:02:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:02:52,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:52,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249422840] [2022-07-20 04:02:52,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249422840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:52,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:52,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:02:52,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172926343] [2022-07-20 04:02:52,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:52,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:02:52,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:52,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:02:52,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:02:52,207 INFO L87 Difference]: Start difference. First operand 1330 states and 1765 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:02:57,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:57,280 INFO L93 Difference]: Finished difference Result 2704 states and 3641 transitions. [2022-07-20 04:02:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:02:57,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2022-07-20 04:02:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:57,287 INFO L225 Difference]: With dead ends: 2704 [2022-07-20 04:02:57,287 INFO L226 Difference]: Without dead ends: 1390 [2022-07-20 04:02:57,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-20 04:02:57,296 INFO L413 NwaCegarLoop]: 1300 mSDtfsCounter, 1024 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 5235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:57,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 3205 Invalid, 5235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-20 04:02:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2022-07-20 04:02:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1334. [2022-07-20 04:02:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 930 states have (on average 1.2731182795698925) internal successors, (1184), 969 states have internal predecessors, (1184), 291 states have call successors, (291), 102 states have call predecessors, (291), 103 states have return successors, (295), 288 states have call predecessors, (295), 289 states have call successors, (295) [2022-07-20 04:02:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1770 transitions. [2022-07-20 04:02:57,406 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1770 transitions. Word has length 125 [2022-07-20 04:02:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:57,407 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1770 transitions. [2022-07-20 04:02:57,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:02:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1770 transitions. [2022-07-20 04:02:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-20 04:02:57,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:57,412 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:02:57,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:02:57,412 INFO L420 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 25 more)] === [2022-07-20 04:02:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash 989460374, now seen corresponding path program 1 times [2022-07-20 04:02:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:57,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959209178] [2022-07-20 04:02:57,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:57,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:02:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:02:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:02:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:02:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:02:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:02:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:02:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:02:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:02:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:02:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:02:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:02:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:02:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:02:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:02:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 04:02:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:02:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:02:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:57,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959209178] [2022-07-20 04:02:57,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959209178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:02:57,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:02:57,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:02:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381557610] [2022-07-20 04:02:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:02:57,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:02:57,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:02:57,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:02:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:02:57,536 INFO L87 Difference]: Start difference. First operand 1334 states and 1770 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:02:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:02:59,532 INFO L93 Difference]: Finished difference Result 1334 states and 1770 transitions. [2022-07-20 04:02:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:02:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 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 124 [2022-07-20 04:02:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:02:59,539 INFO L225 Difference]: With dead ends: 1334 [2022-07-20 04:02:59,539 INFO L226 Difference]: Without dead ends: 1332 [2022-07-20 04:02:59,540 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:02:59,541 INFO L413 NwaCegarLoop]: 1339 mSDtfsCounter, 2441 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:02:59,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 2353 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:02:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-07-20 04:02:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2022-07-20 04:02:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 929 states have (on average 1.2723358449946178) internal successors, (1182), 967 states have internal predecessors, (1182), 291 states have call successors, (291), 102 states have call predecessors, (291), 103 states have return successors, (295), 288 states have call predecessors, (295), 289 states have call successors, (295) [2022-07-20 04:02:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1768 transitions. [2022-07-20 04:02:59,650 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1768 transitions. Word has length 124 [2022-07-20 04:02:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:02:59,650 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1768 transitions. [2022-07-20 04:02:59,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:02:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1768 transitions. [2022-07-20 04:02:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 04:02:59,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:02:59,653 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-20 04:02:59,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:02:59,654 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:02:59,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:02:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1814029112, now seen corresponding path program 1 times [2022-07-20 04:02:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:02:59,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493834523] [2022-07-20 04:02:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:02:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:02:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:02:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:02:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:02:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:02:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:02:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:02:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:02:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:02:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:02:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 04:02:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:02:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:02:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:02:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:02:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:02:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:02:59,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:02:59,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493834523] [2022-07-20 04:02:59,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493834523] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:02:59,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595618295] [2022-07-20 04:02:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:02:59,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:02:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:02:59,959 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) [2022-07-20 04:02:59,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 04:03:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:00,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 04:03:00,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:03:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-20 04:03:00,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:03:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:03:00,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595618295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:03:00,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 04:03:00,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-20 04:03:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310189384] [2022-07-20 04:03:00,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 04:03:00,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:03:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:03:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:03:00,771 INFO L87 Difference]: Start difference. First operand 1332 states and 1768 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 10 states have internal predecessors, (85), 2 states have call successors, (25), 6 states have call predecessors, (25), 5 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 04:03:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:07,768 INFO L93 Difference]: Finished difference Result 2720 states and 3668 transitions. [2022-07-20 04:03:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 04:03:07,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 10 states have internal predecessors, (85), 2 states have call successors, (25), 6 states have call predecessors, (25), 5 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 126 [2022-07-20 04:03:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:07,777 INFO L225 Difference]: With dead ends: 2720 [2022-07-20 04:03:07,778 INFO L226 Difference]: Without dead ends: 1402 [2022-07-20 04:03:07,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2022-07-20 04:03:07,785 INFO L413 NwaCegarLoop]: 1298 mSDtfsCounter, 1285 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 7116 mSolverCounterSat, 958 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 4258 SdHoareTripleChecker+Invalid, 8074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 958 IncrementalHoareTripleChecker+Valid, 7116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:07,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 4258 Invalid, 8074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [958 Valid, 7116 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-20 04:03:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-07-20 04:03:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1344. [2022-07-20 04:03:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 940 states have (on average 1.275531914893617) internal successors, (1199), 978 states have internal predecessors, (1199), 291 states have call successors, (291), 103 states have call predecessors, (291), 104 states have return successors, (296), 288 states have call predecessors, (296), 289 states have call successors, (296) [2022-07-20 04:03:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1786 transitions. [2022-07-20 04:03:07,917 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1786 transitions. Word has length 126 [2022-07-20 04:03:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:07,918 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1786 transitions. [2022-07-20 04:03:07,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 10 states have internal predecessors, (85), 2 states have call successors, (25), 6 states have call predecessors, (25), 5 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 04:03:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1786 transitions. [2022-07-20 04:03:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-20 04:03:07,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:07,921 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:03:07,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 04:03:08,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-20 04:03:08,140 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:03:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1890159087, now seen corresponding path program 1 times [2022-07-20 04:03:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:08,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547954276] [2022-07-20 04:03:08,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:03:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:03:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:03:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:03:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:03:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:03:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:03:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 04:03:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:03:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 04:03:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:03:08,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:08,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547954276] [2022-07-20 04:03:08,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547954276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:08,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:08,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:03:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162113658] [2022-07-20 04:03:08,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:08,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:03:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:08,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:03:08,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:03:08,333 INFO L87 Difference]: Start difference. First operand 1344 states and 1786 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, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:03:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:12,238 INFO L93 Difference]: Finished difference Result 2830 states and 3845 transitions. [2022-07-20 04:03:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:03:12,239 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, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 125 [2022-07-20 04:03:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:12,245 INFO L225 Difference]: With dead ends: 2830 [2022-07-20 04:03:12,246 INFO L226 Difference]: Without dead ends: 1504 [2022-07-20 04:03:12,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:03:12,251 INFO L413 NwaCegarLoop]: 1316 mSDtfsCounter, 1077 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 4609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:12,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 2987 Invalid, 4609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-20 04:03:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-07-20 04:03:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1348. [2022-07-20 04:03:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 944 states have (on average 1.2743644067796611) internal successors, (1203), 982 states have internal predecessors, (1203), 291 states have call successors, (291), 103 states have call predecessors, (291), 104 states have return successors, (296), 288 states have call predecessors, (296), 289 states have call successors, (296) [2022-07-20 04:03:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1790 transitions. [2022-07-20 04:03:12,331 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1790 transitions. Word has length 125 [2022-07-20 04:03:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:12,331 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1790 transitions. [2022-07-20 04:03:12,331 INFO L496 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, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:03:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1790 transitions. [2022-07-20 04:03:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-20 04:03:12,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:12,334 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:03:12,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:03:12,334 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:03:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -397002125, now seen corresponding path program 1 times [2022-07-20 04:03:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:12,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795548788] [2022-07-20 04:03:12,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:12,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:03:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:03:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:03:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:03:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:03:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:03:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:03:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:03:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:03:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 04:03:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:03:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:03:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795548788] [2022-07-20 04:03:12,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795548788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:03:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355988506] [2022-07-20 04:03:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:12,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:03:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:03:12,701 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) [2022-07-20 04:03:12,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 04:03:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:13,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 04:03:13,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:03:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 04:03:13,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:03:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-20 04:03:14,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355988506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:03:14,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 04:03:14,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 24 [2022-07-20 04:03:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371872031] [2022-07-20 04:03:14,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 04:03:14,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 04:03:14,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 04:03:14,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-20 04:03:14,003 INFO L87 Difference]: Start difference. First operand 1348 states and 1790 transitions. Second operand has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 18 states have internal predecessors, (147), 5 states have call successors, (47), 6 states have call predecessors, (47), 6 states have return successors, (45), 6 states have call predecessors, (45), 5 states have call successors, (45) [2022-07-20 04:03:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:30,300 INFO L93 Difference]: Finished difference Result 2822 states and 3826 transitions. [2022-07-20 04:03:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 04:03:30,301 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 18 states have internal predecessors, (147), 5 states have call successors, (47), 6 states have call predecessors, (47), 6 states have return successors, (45), 6 states have call predecessors, (45), 5 states have call successors, (45) Word has length 132 [2022-07-20 04:03:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:30,308 INFO L225 Difference]: With dead ends: 2822 [2022-07-20 04:03:30,308 INFO L226 Difference]: Without dead ends: 1488 [2022-07-20 04:03:30,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-07-20 04:03:30,313 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 1345 mSDsluCounter, 6948 mSDsCounter, 0 mSdLazyCounter, 17071 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 8350 SdHoareTripleChecker+Invalid, 17748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 17071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:30,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 8350 Invalid, 17748 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [677 Valid, 17071 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2022-07-20 04:03:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-20 04:03:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1353. [2022-07-20 04:03:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 949 states have (on average 1.2750263435194942) internal successors, (1210), 987 states have internal predecessors, (1210), 291 states have call successors, (291), 103 states have call predecessors, (291), 104 states have return successors, (295), 288 states have call predecessors, (295), 289 states have call successors, (295) [2022-07-20 04:03:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1796 transitions. [2022-07-20 04:03:30,408 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1796 transitions. Word has length 132 [2022-07-20 04:03:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:30,408 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1796 transitions. [2022-07-20 04:03:30,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 18 states have internal predecessors, (147), 5 states have call successors, (47), 6 states have call predecessors, (47), 6 states have return successors, (45), 6 states have call predecessors, (45), 5 states have call successors, (45) [2022-07-20 04:03:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1796 transitions. [2022-07-20 04:03:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-20 04:03:30,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:30,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:03:30,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 04:03:30,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 04:03:30,624 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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 25 more)] === [2022-07-20 04:03:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1538085832, now seen corresponding path program 1 times [2022-07-20 04:03:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:30,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168557005] [2022-07-20 04:03:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:03:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:03:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:03:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:03:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:03:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:03:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:03:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:03:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:03:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:03:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:03:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:03:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:03:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:03:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:03:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 04:03:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:03:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 04:03:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:03:30,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:30,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168557005] [2022-07-20 04:03:30,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168557005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:03:30,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:03:30,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:03:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748550359] [2022-07-20 04:03:30,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:03:30,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:03:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:03:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:03:30,780 INFO L87 Difference]: Start difference. First operand 1353 states and 1796 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 04:03:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:32,835 INFO L93 Difference]: Finished difference Result 1353 states and 1796 transitions. [2022-07-20 04:03:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:03:32,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 130 [2022-07-20 04:03:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:03:32,841 INFO L225 Difference]: With dead ends: 1353 [2022-07-20 04:03:32,841 INFO L226 Difference]: Without dead ends: 1351 [2022-07-20 04:03:32,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:03:32,842 INFO L413 NwaCegarLoop]: 1336 mSDtfsCounter, 2434 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2526 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:03:32,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2526 Valid, 2347 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:03:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-20 04:03:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2022-07-20 04:03:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 948 states have (on average 1.2742616033755274) internal successors, (1208), 985 states have internal predecessors, (1208), 291 states have call successors, (291), 103 states have call predecessors, (291), 104 states have return successors, (295), 288 states have call predecessors, (295), 289 states have call successors, (295) [2022-07-20 04:03:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1794 transitions. [2022-07-20 04:03:32,944 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1794 transitions. Word has length 130 [2022-07-20 04:03:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:03:32,945 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1794 transitions. [2022-07-20 04:03:32,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 04:03:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1794 transitions. [2022-07-20 04:03:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-20 04:03:32,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:03:32,948 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:03:32,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:03:32,948 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:03:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:03:32,949 INFO L85 PathProgramCache]: Analyzing trace with hash -824114156, now seen corresponding path program 1 times [2022-07-20 04:03:32,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:03:32,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902007931] [2022-07-20 04:03:32,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:32,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:03:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:03:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:03:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:03:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:03:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:03:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 04:03:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:03:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:03:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:03:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:03:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:03:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:03:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 04:03:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:03:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:03:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 04:03:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:03:33,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:03:33,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902007931] [2022-07-20 04:03:33,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902007931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:03:33,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324067911] [2022-07-20 04:03:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:03:33,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:03:33,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:03:33,396 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) [2022-07-20 04:03:33,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 04:03:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:03:33,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 04:03:34,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:03:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-20 04:03:34,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:03:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:03:34,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324067911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:03:34,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 04:03:34,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 27 [2022-07-20 04:03:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459473704] [2022-07-20 04:03:34,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 04:03:34,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 04:03:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:03:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 04:03:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2022-07-20 04:03:34,772 INFO L87 Difference]: Start difference. First operand 1351 states and 1794 transitions. Second operand has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 22 states have internal predecessors, (102), 2 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 04:03:48,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 04:03:50,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 04:03:52,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 04:03:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:03:59,993 INFO L93 Difference]: Finished difference Result 2773 states and 3741 transitions. [2022-07-20 04:03:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 04:03:59,994 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 22 states have internal predecessors, (102), 2 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 137 [2022-07-20 04:03:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:00,000 INFO L225 Difference]: With dead ends: 2773 [2022-07-20 04:04:00,000 INFO L226 Difference]: Without dead ends: 1432 [2022-07-20 04:04:00,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=718, Invalid=2362, Unknown=0, NotChecked=0, Total=3080 [2022-07-20 04:04:00,006 INFO L413 NwaCegarLoop]: 1296 mSDtfsCounter, 1358 mSDsluCounter, 4506 mSDsCounter, 0 mSdLazyCounter, 11152 mSolverCounterSat, 1012 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 5802 SdHoareTripleChecker+Invalid, 12167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 11152 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:00,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 5802 Invalid, 12167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 11152 Invalid, 3 Unknown, 0 Unchecked, 21.4s Time] [2022-07-20 04:04:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-07-20 04:04:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1366. [2022-07-20 04:04:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 963 states have (on average 1.2762201453790238) internal successors, (1229), 1000 states have internal predecessors, (1229), 291 states have call successors, (291), 103 states have call predecessors, (291), 104 states have return successors, (295), 288 states have call predecessors, (295), 289 states have call successors, (295) [2022-07-20 04:04:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1815 transitions. [2022-07-20 04:04:00,132 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1815 transitions. Word has length 137 [2022-07-20 04:04:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:00,133 INFO L495 AbstractCegarLoop]: Abstraction has 1366 states and 1815 transitions. [2022-07-20 04:04:00,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 22 states have internal predecessors, (102), 2 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 04:04:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1815 transitions. [2022-07-20 04:04:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-20 04:04:00,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:00,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:04:00,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 04:04:00,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:04:00,351 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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 25 more)] === [2022-07-20 04:04:00,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1344645454, now seen corresponding path program 1 times [2022-07-20 04:04:00,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:00,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8469989] [2022-07-20 04:04:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:00,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:04:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:04:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:04:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 04:04:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 04:04:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-20 04:04:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:04:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 04:04:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-20 04:04:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-20 04:04:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 04:04:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 04:04:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:04:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:04:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 04:04:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:04:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 04:04:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 04:04:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 04:04:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:00,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8469989] [2022-07-20 04:04:00,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8469989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:04:00,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:04:00,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:04:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380057925] [2022-07-20 04:04:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:04:00,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:04:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:04:00,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:04:00,483 INFO L87 Difference]: Start difference. First operand 1366 states and 1815 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 04:04:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:04:02,482 INFO L93 Difference]: Finished difference Result 1366 states and 1815 transitions. [2022-07-20 04:04:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:04:02,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 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 136 [2022-07-20 04:04:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:04:02,486 INFO L225 Difference]: With dead ends: 1366 [2022-07-20 04:04:02,487 INFO L226 Difference]: Without dead ends: 1364 [2022-07-20 04:04:02,487 INFO L412 NwaCegarLoop]: 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 [2022-07-20 04:04:02,487 INFO L413 NwaCegarLoop]: 1334 mSDtfsCounter, 2428 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2519 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 2453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:04:02,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2519 Valid, 2345 Invalid, 2453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 04:04:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-07-20 04:04:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2022-07-20 04:04:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 962 states have (on average 1.2754677754677755) internal successors, (1227), 998 states have internal predecessors, (1227), 291 states have call successors, (291), 103 states have call predecessors, (291), 104 states have return successors, (295), 288 states have call predecessors, (295), 289 states have call successors, (295) [2022-07-20 04:04:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1813 transitions. [2022-07-20 04:04:02,613 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1813 transitions. Word has length 136 [2022-07-20 04:04:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:04:02,614 INFO L495 AbstractCegarLoop]: Abstraction has 1364 states and 1813 transitions. [2022-07-20 04:04:02,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 04:04:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1813 transitions. [2022-07-20 04:04:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-20 04:04:02,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:04:02,617 INFO L195 NwaCegarLoop]: trace histogram [12, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:04:02,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 04:04:02,618 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-20 04:04:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:04:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash 502310038, now seen corresponding path program 2 times [2022-07-20 04:04:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:04:02,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888796339] [2022-07-20 04:04:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:04:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:04:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:04:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:04:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:04:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:04:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:04:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 04:04:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 04:04:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:04:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:04:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:04:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:04:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:04:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:04:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 04:04:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:02,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:04:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 04:04:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:04:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:04:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:04:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:04:03,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888796339] [2022-07-20 04:04:03,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888796339] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:04:03,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39764206] [2022-07-20 04:04:03,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 04:04:03,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:04:03,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:04:03,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:04:03,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 04:04:04,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 04:04:04,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 04:04:04,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 04:04:04,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:04:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-20 04:04:04,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:04:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 04:04:06,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39764206] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:04:06,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 04:04:06,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 48 [2022-07-20 04:04:06,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855396003] [2022-07-20 04:04:06,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 04:04:06,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-20 04:04:06,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:04:06,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-20 04:04:06,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1769, Unknown=0, NotChecked=0, Total=2256 [2022-07-20 04:04:06,982 INFO L87 Difference]: Start difference. First operand 1364 states and 1813 transitions. Second operand has 48 states, 48 states have (on average 2.5625) internal successors, (123), 43 states have internal predecessors, (123), 2 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 04:05:45,337 WARN L233 SmtUtils]: Spent 29.77s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 04:05:56,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 04:05:58,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []