./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 f4b24e32 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-?-f4b24e3 [2022-07-14 04:41:39,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:41:39,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:41:39,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:41:39,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:41:39,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:41:39,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:41:39,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:41:39,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:41:39,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:41:39,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:41:39,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:41:39,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:41:39,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:41:39,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:41:39,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:41:39,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:41:39,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:41:39,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:41:39,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:41:39,561 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:41:39,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:41:39,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:41:39,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:41:39,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:41:39,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:41:39,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:41:39,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:41:39,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:41:39,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:41:39,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:41:39,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:41:39,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:41:39,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:41:39,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:41:39,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:41:39,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:41:39,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:41:39,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:41:39,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:41:39,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:41:39,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:41:39,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:41:39,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:41:39,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:41:39,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:41:39,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:41:39,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:41:39,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:41:39,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:41:39,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:41:39,596 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:41:39,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:41:39,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:41:39,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:41:39,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:41:39,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:41:39,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:41:39,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:41:39,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:41:39,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:41:39,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:41:39,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:41:39,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:41:39,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:41:39,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:41:39,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:41:39,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:41:39,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:41:39,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:41:39,600 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:41:39,600 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:41:39,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:41:39,600 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-14 04:41:39,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:41:39,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:41:39,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:41:39,820 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:41:39,821 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:41:39,822 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-14 04:41:39,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea166a6a/a9586e592c6b456eb4af8cbaf395bb53/FLAG271ddb25c [2022-07-14 04:41:40,489 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:41:40,489 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-14 04:41:40,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea166a6a/a9586e592c6b456eb4af8cbaf395bb53/FLAG271ddb25c [2022-07-14 04:41:40,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea166a6a/a9586e592c6b456eb4af8cbaf395bb53 [2022-07-14 04:41:40,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:41:40,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:41:40,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:41:40,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:41:40,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:41:40,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:41:40" (1/1) ... [2022-07-14 04:41:40,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd3ce42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:40, skipping insertion in model container [2022-07-14 04:41:40,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:41:40" (1/1) ... [2022-07-14 04:41:40,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:41:41,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:41:42,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260078,260091] [2022-07-14 04:41:42,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260223,260236] [2022-07-14 04:41:42,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260369,260382] [2022-07-14 04:41:42,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260534,260547] [2022-07-14 04:41:42,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260692,260705] [2022-07-14 04:41:42,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[260850,260863] [2022-07-14 04:41:42,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261008,261021] [2022-07-14 04:41:42,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261168,261181] [2022-07-14 04:41:42,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261327,261340] [2022-07-14 04:41:42,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261466,261479] [2022-07-14 04:41:42,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261608,261621] [2022-07-14 04:41:42,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261757,261770] [2022-07-14 04:41:42,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[261896,261909] [2022-07-14 04:41:42,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262051,262064] [2022-07-14 04:41:42,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262211,262224] [2022-07-14 04:41:42,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262362,262375] [2022-07-14 04:41:42,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262513,262526] [2022-07-14 04:41:42,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262665,262678] [2022-07-14 04:41:42,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262814,262827] [2022-07-14 04:41:42,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262962,262975] [2022-07-14 04:41:42,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263119,263132] [2022-07-14 04:41:42,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263268,263281] [2022-07-14 04:41:42,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263424,263437] [2022-07-14 04:41:42,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263577,263590] [2022-07-14 04:41:42,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263723,263736] [2022-07-14 04:41:42,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:41:42,770 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:41:42,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262814,262827] [2022-07-14 04:41:42,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[262962,262975] [2022-07-14 04:41:42,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263119,263132] [2022-07-14 04:41:42,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263424,263437] [2022-07-14 04:41:42,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263577,263590] [2022-07-14 04:41:42,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263723,263736] [2022-07-14 04:41:42,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[263866,263879] [2022-07-14 04:41:42,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264018,264031] [2022-07-14 04:41:42,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[264164,264177] [2022-07-14 04:41:42,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265240,265253] [2022-07-14 04:41:42,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265396,265409] [2022-07-14 04:41:42,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265560,265573] [2022-07-14 04:41:42,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265702,265715] [2022-07-14 04:41:42,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[265860,265873] [2022-07-14 04:41:42,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266027,266040] [2022-07-14 04:41:42,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266186,266199] [2022-07-14 04:41:42,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266345,266358] [2022-07-14 04:41:42,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266494,266507] [2022-07-14 04:41:42,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266641,266654] [2022-07-14 04:41:42,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266780,266793] [2022-07-14 04:41:42,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[266943,266956] [2022-07-14 04:41:42,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267109,267122] [2022-07-14 04:41:42,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267273,267286] [2022-07-14 04:41:42,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267438,267451] [2022-07-14 04:41:42,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267603,267616] [2022-07-14 04:41:42,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267769,267782] [2022-07-14 04:41:42,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[267934,267947] [2022-07-14 04:41:42,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268101,268114] [2022-07-14 04:41:42,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268261,268274] [2022-07-14 04:41:42,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268423,268436] [2022-07-14 04:41:42,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268582,268595] [2022-07-14 04:41:42,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268728,268741] [2022-07-14 04:41:42,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[268871,268884] [2022-07-14 04:41:42,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[269015,269028] [2022-07-14 04:41:42,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:42,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-14 04:41:43,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271556,271569] [2022-07-14 04:41:43,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271707,271720] [2022-07-14 04:41:43,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[271858,271871] [2022-07-14 04:41:43,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272006,272019] [2022-07-14 04:41:43,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272172,272185] [2022-07-14 04:41:43,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272341,272354] [2022-07-14 04:41:43,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272508,272521] [2022-07-14 04:41:43,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272676,272689] [2022-07-14 04:41:43,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272826,272839] [2022-07-14 04:41:43,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[272973,272986] [2022-07-14 04:41:43,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273134,273147] [2022-07-14 04:41:43,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273304,273317] [2022-07-14 04:41:43,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i[273466,273479] [2022-07-14 04:41:43,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:41:43,113 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:41:43,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43 WrapperNode [2022-07-14 04:41:43,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:41:43,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:41:43,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:41:43,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:41:43,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,297 INFO L137 Inliner]: procedures = 498, calls = 1418, calls flagged for inlining = 214, calls inlined = 135, statements flattened = 3214 [2022-07-14 04:41:43,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:41:43,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:41:43,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:41:43,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:41:43,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:41:43,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:41:43,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:41:43,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:41:43,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (1/1) ... [2022-07-14 04:41:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:41:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:41:43,528 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-14 04:41:43,555 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-14 04:41:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mark_block_bad [2022-07-14 04:41:43,573 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mark_block_bad [2022-07-14 04:41:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:41:43,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:41:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:41:43,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:41:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-07-14 04:41:43,574 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-07-14 04:41:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2022-07-14 04:41:43,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2022-07-14 04:41:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:41:43,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:41:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:41:43,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:41:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 04:41:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 04:41:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:41:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:41:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:41:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:41:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_lba [2022-07-14 04:41:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_lba [2022-07-14 04:41:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure sm_check_block [2022-07-14 04:41:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_check_block [2022-07-14 04:41:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-14 04:41:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure sm_release [2022-07-14 04:41:43,576 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_release [2022-07-14 04:41:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:41:43,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:41:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_init [2022-07-14 04:41:43,576 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_init [2022-07-14 04:41:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:41:43,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:41:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:41:43,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:41:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_sector [2022-07-14 04:41:43,577 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_sector [2022-07-14 04:41:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:41:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:41:43,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:41:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure sm_write_sector [2022-07-14 04:41:43,577 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_write_sector [2022-07-14 04:41:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_calculate_ecc [2022-07-14 04:41:43,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_calculate_ecc [2022-07-14 04:41:43,578 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2022-07-14 04:41:43,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2022-07-14 04:41:43,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:41:43,578 INFO L130 BoogieDeclarations]: Found specification of procedure sm_remove_dev [2022-07-14 04:41:43,578 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_remove_dev [2022-07-14 04:41:43,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:41:43,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:41:43,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:41:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:41:43,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:41:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2022-07-14 04:41:43,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2022-07-14 04:41:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:41:43,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:41:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:41:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:41:43,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:41:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:41:43,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:41:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure sm_recheck_media [2022-07-14 04:41:43,580 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_recheck_media [2022-07-14 04:41:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:41:43,580 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:41:43,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:41:43,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:41:43,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:41:43,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:41:43,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:41:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:41:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_put [2022-07-14 04:41:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_put [2022-07-14 04:41:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_cis [2022-07-14 04:41:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_cis [2022-07-14 04:41:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:41:43,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:41:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:41:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:41:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:41:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:41:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:41:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 04:41:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 04:41:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_out [2022-07-14 04:41:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_out [2022-07-14 04:41:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:41:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:41:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2022-07-14 04:41:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2022-07-14 04:41:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_flush [2022-07-14 04:41:43,588 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_flush [2022-07-14 04:41:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:41:43,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:41:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-14 04:41:43,588 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-14 04:41:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_zone [2022-07-14 04:41:43,588 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_zone [2022-07-14 04:41:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:41:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:41:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2022-07-14 04:41:43,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2022-07-14 04:41:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:41:43,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:41:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-14 04:41:43,589 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-14 04:41:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mkoffset [2022-07-14 04:41:43,589 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mkoffset [2022-07-14 04:41:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 04:41:43,589 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 04:41:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_lba [2022-07-14 04:41:43,590 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_lba [2022-07-14 04:41:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:41:43,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:41:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:41:43,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:41:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:41:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:41:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:41:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:41:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:41:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure mtd_is_eccerr [2022-07-14 04:41:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure mtd_is_eccerr [2022-07-14 04:41:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 04:41:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 04:41:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:41:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:41:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:41:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:41:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_in [2022-07-14 04:41:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_in [2022-07-14 04:41:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:41:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:41:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:41:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:41:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:41:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:41:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:41:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:41:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_correct_data [2022-07-14 04:41:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_correct_data [2022-07-14 04:41:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:41:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:41:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:41:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:41:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:41:43,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:41:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:41:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:41:43,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:41:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2022-07-14 04:41:43,594 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2022-07-14 04:41:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:41:43,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:41:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:41:43,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:41:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure sm_sector_valid [2022-07-14 04:41:43,595 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_sector_valid [2022-07-14 04:41:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure sm_erase_block [2022-07-14 04:41:43,595 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_erase_block [2022-07-14 04:41:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-14 04:41:43,595 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-14 04:41:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:41:43,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:41:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure sm_break_offset [2022-07-14 04:41:43,595 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_break_offset [2022-07-14 04:41:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure sm_block_valid [2022-07-14 04:41:43,596 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_block_valid [2022-07-14 04:41:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:41:43,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:41:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:41:44,022 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:41:44,026 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:41:44,497 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:41:45,582 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:41:45,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:41:45,598 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 04:41:45,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:41:45 BoogieIcfgContainer [2022-07-14 04:41:45,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:41:45,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:41:45,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:41:45,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:41:45,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:41:40" (1/3) ... [2022-07-14 04:41:45,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aca8115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:41:45, skipping insertion in model container [2022-07-14 04:41:45,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:41:43" (2/3) ... [2022-07-14 04:41:45,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aca8115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:41:45, skipping insertion in model container [2022-07-14 04:41:45,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:41:45" (3/3) ... [2022-07-14 04:41:45,609 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2022-07-14 04:41:45,619 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:41:45,620 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-14 04:41:45,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:41:45,683 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@fabb3f6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13c1865f [2022-07-14 04:41:45,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-14 04:41:45,690 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-14 04:41:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 04:41:45,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:45,697 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-14 04:41:45,698 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-14 04:41:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1248621391, now seen corresponding path program 1 times [2022-07-14 04:41:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:45,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350978654] [2022-07-14 04:41:45,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:41:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:41:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:41:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:41:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:41:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,138 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-14 04:41:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:46,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350978654] [2022-07-14 04:41:46,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350978654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:46,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:46,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166709525] [2022-07-14 04:41:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:46,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:46,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:46,174 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-14 04:41:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:48,282 INFO L93 Difference]: Finished difference Result 2288 states and 3171 transitions. [2022-07-14 04:41:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:48,289 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-14 04:41:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:48,314 INFO L225 Difference]: With dead ends: 2288 [2022-07-14 04:41:48,314 INFO L226 Difference]: Without dead ends: 1142 [2022-07-14 04:41:48,324 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-14 04:41:48,327 INFO L413 NwaCegarLoop]: 1391 mSDtfsCounter, 2579 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 1040 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:48,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2686 Valid, 2417 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-14 04:41:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-14 04:41:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2022-07-14 04:41:48,430 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-14 04:41:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1514 transitions. [2022-07-14 04:41:48,443 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1514 transitions. Word has length 50 [2022-07-14 04:41:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:48,445 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1514 transitions. [2022-07-14 04:41:48,445 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-14 04:41:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1514 transitions. [2022-07-14 04:41:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 04:41:48,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:48,451 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-14 04:41:48,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:41:48,452 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-14 04:41:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 989377887, now seen corresponding path program 1 times [2022-07-14 04:41:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:48,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517806947] [2022-07-14 04:41:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:41:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:41:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:41:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:41:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:41:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:41:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:48,625 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-14 04:41:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:48,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517806947] [2022-07-14 04:41:48,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517806947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:48,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:48,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717500204] [2022-07-14 04:41:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:48,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:48,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:48,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:48,629 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-14 04:41:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:50,517 INFO L93 Difference]: Finished difference Result 1142 states and 1514 transitions. [2022-07-14 04:41:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:50,517 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-14 04:41:50,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:50,522 INFO L225 Difference]: With dead ends: 1142 [2022-07-14 04:41:50,522 INFO L226 Difference]: Without dead ends: 1140 [2022-07-14 04:41:50,523 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-14 04:41:50,524 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 2549 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:50,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 2389 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-14 04:41:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-14 04:41:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-07-14 04:41:50,554 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-14 04:41:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1512 transitions. [2022-07-14 04:41:50,560 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1512 transitions. Word has length 56 [2022-07-14 04:41:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:50,561 INFO L495 AbstractCegarLoop]: Abstraction has 1140 states and 1512 transitions. [2022-07-14 04:41:50,561 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-14 04:41:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1512 transitions. [2022-07-14 04:41:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 04:41:50,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:50,563 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-14 04:41:50,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:41:50,563 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-14 04:41:50,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 735069371, now seen corresponding path program 1 times [2022-07-14 04:41:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:50,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601991496] [2022-07-14 04:41:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:41:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:50,696 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-14 04:41:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:50,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601991496] [2022-07-14 04:41:50,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601991496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:50,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:50,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67007296] [2022-07-14 04:41:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:50,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:50,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:50,699 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-14 04:41:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:52,741 INFO L93 Difference]: Finished difference Result 1391 states and 1841 transitions. [2022-07-14 04:41:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:52,741 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-14 04:41:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:52,751 INFO L225 Difference]: With dead ends: 1391 [2022-07-14 04:41:52,751 INFO L226 Difference]: Without dead ends: 1389 [2022-07-14 04:41:52,753 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-14 04:41:52,756 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-14 04:41:52,758 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-14 04:41:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2022-07-14 04:41:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1358. [2022-07-14 04:41:52,802 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-14 04:41:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1795 transitions. [2022-07-14 04:41:52,811 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1795 transitions. Word has length 62 [2022-07-14 04:41:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:52,812 INFO L495 AbstractCegarLoop]: Abstraction has 1358 states and 1795 transitions. [2022-07-14 04:41:52,812 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-14 04:41:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1795 transitions. [2022-07-14 04:41:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 04:41:52,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:52,816 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-14 04:41:52,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:41:52,817 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-14 04:41:52,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash -369420907, now seen corresponding path program 1 times [2022-07-14 04:41:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:52,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24443691] [2022-07-14 04:41:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:52,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:41:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:41:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:41:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:41:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:41:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:41:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:41:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,965 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-14 04:41:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:52,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24443691] [2022-07-14 04:41:52,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24443691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:52,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:52,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697685753] [2022-07-14 04:41:52,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:52,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:52,967 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-14 04:41:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:54,710 INFO L93 Difference]: Finished difference Result 1358 states and 1795 transitions. [2022-07-14 04:41:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:54,710 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-14 04:41:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:54,716 INFO L225 Difference]: With dead ends: 1358 [2022-07-14 04:41:54,716 INFO L226 Difference]: Without dead ends: 1356 [2022-07-14 04:41:54,718 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-14 04:41:54,720 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 2537 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:54,721 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.6s Time] [2022-07-14 04:41:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-07-14 04:41:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2022-07-14 04:41:54,763 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-14 04:41:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1793 transitions. [2022-07-14 04:41:54,769 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1793 transitions. Word has length 62 [2022-07-14 04:41:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:54,770 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1793 transitions. [2022-07-14 04:41:54,771 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-14 04:41:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1793 transitions. [2022-07-14 04:41:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 04:41:54,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:54,772 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-14 04:41:54,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:41:54,773 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-14 04:41:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1572676478, now seen corresponding path program 1 times [2022-07-14 04:41:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:54,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238681634] [2022-07-14 04:41:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:54,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:41:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:41:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:41:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:41:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:41:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:41:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:41:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:41:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:54,932 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-14 04:41:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:54,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238681634] [2022-07-14 04:41:54,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238681634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:54,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:54,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110412955] [2022-07-14 04:41:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:54,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:54,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:54,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:54,935 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-14 04:41:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:56,773 INFO L93 Difference]: Finished difference Result 1356 states and 1793 transitions. [2022-07-14 04:41:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:56,773 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-14 04:41:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:56,780 INFO L225 Difference]: With dead ends: 1356 [2022-07-14 04:41:56,780 INFO L226 Difference]: Without dead ends: 1354 [2022-07-14 04:41:56,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:41:56,781 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 2531 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:56,781 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.7s Time] [2022-07-14 04:41:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2022-07-14 04:41:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2022-07-14 04:41:56,841 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-14 04:41:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1791 transitions. [2022-07-14 04:41:56,846 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1791 transitions. Word has length 68 [2022-07-14 04:41:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:56,846 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 1791 transitions. [2022-07-14 04:41:56,846 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-14 04:41:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1791 transitions. [2022-07-14 04:41:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 04:41:56,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:56,847 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-14 04:41:56,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:41:56,848 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-14 04:41:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash 492776973, now seen corresponding path program 1 times [2022-07-14 04:41:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:56,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011238488] [2022-07-14 04:41:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:41:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:41:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,975 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-14 04:41:56,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:56,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011238488] [2022-07-14 04:41:56,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011238488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:56,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:56,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:41:56,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205239069] [2022-07-14 04:41:56,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:56,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:41:56,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:41:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:41:56,977 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-14 04:41:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:58,617 INFO L93 Difference]: Finished difference Result 2717 states and 3609 transitions. [2022-07-14 04:41:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:58,618 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-14 04:41:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:58,624 INFO L225 Difference]: With dead ends: 2717 [2022-07-14 04:41:58,624 INFO L226 Difference]: Without dead ends: 1381 [2022-07-14 04:41:58,629 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-14 04:41:58,629 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 1583 mSDsluCounter, 3445 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 4906 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:58,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 4906 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 04:41:58,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2022-07-14 04:41:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1354. [2022-07-14 04:41:58,678 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-14 04:41:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1789 transitions. [2022-07-14 04:41:58,688 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1789 transitions. Word has length 71 [2022-07-14 04:41:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:58,689 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 1789 transitions. [2022-07-14 04:41:58,689 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-14 04:41:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1789 transitions. [2022-07-14 04:41:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 04:41:58,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:58,690 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-14 04:41:58,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:41:58,690 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-14 04:41:58,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash 492836555, now seen corresponding path program 1 times [2022-07-14 04:41:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:58,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403843232] [2022-07-14 04:41:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:41:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:41:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:58,810 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-14 04:41:58,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:58,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403843232] [2022-07-14 04:41:58,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403843232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:58,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:58,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 04:41:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095437900] [2022-07-14 04:41:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:58,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 04:41:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 04:41:58,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 04:41:58,812 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-14 04:42:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:00,082 INFO L93 Difference]: Finished difference Result 1381 states and 1831 transitions. [2022-07-14 04:42:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 04:42:00,095 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-14 04:42:00,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:00,102 INFO L225 Difference]: With dead ends: 1381 [2022-07-14 04:42:00,102 INFO L226 Difference]: Without dead ends: 1379 [2022-07-14 04:42:00,103 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-14 04:42:00,105 INFO L413 NwaCegarLoop]: 1466 mSDtfsCounter, 318 mSDsluCounter, 2719 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 4185 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.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:00,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 4185 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 04:42:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-07-14 04:42:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1352. [2022-07-14 04:42:00,156 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-14 04:42:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1786 transitions. [2022-07-14 04:42:00,163 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1786 transitions. Word has length 71 [2022-07-14 04:42:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:00,164 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1786 transitions. [2022-07-14 04:42:00,164 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-14 04:42:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1786 transitions. [2022-07-14 04:42:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 04:42:00,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:00,171 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-14 04:42:00,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:42:00,171 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-14 04:42:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1602363486, now seen corresponding path program 1 times [2022-07-14 04:42:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:00,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056464835] [2022-07-14 04:42:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:00,285 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-14 04:42:00,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:00,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056464835] [2022-07-14 04:42:00,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056464835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:00,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:00,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582977673] [2022-07-14 04:42:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:00,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:00,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:00,287 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-14 04:42:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:01,965 INFO L93 Difference]: Finished difference Result 1352 states and 1786 transitions. [2022-07-14 04:42:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:01,965 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-14 04:42:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:01,970 INFO L225 Difference]: With dead ends: 1352 [2022-07-14 04:42:01,970 INFO L226 Difference]: Without dead ends: 1350 [2022-07-14 04:42:01,971 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-14 04:42:01,971 INFO L413 NwaCegarLoop]: 1364 mSDtfsCounter, 2516 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:01,972 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.6s Time] [2022-07-14 04:42:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2022-07-14 04:42:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2022-07-14 04:42:02,008 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-14 04:42:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1784 transitions. [2022-07-14 04:42:02,012 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1784 transitions. Word has length 74 [2022-07-14 04:42:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:02,012 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1784 transitions. [2022-07-14 04:42:02,013 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-14 04:42:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1784 transitions. [2022-07-14 04:42:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-14 04:42:02,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:02,015 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-14 04:42:02,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:42:02,016 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-14 04:42:02,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1226418991, now seen corresponding path program 1 times [2022-07-14 04:42:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:02,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552292873] [2022-07-14 04:42:02,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:42:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:42:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,099 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-14 04:42:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:02,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552292873] [2022-07-14 04:42:02,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552292873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:02,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:02,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 04:42:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059026280] [2022-07-14 04:42:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:02,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 04:42:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 04:42:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 04:42:02,101 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-14 04:42:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:02,826 INFO L93 Difference]: Finished difference Result 2703 states and 3588 transitions. [2022-07-14 04:42:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 04:42:02,827 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-14 04:42:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:02,832 INFO L225 Difference]: With dead ends: 2703 [2022-07-14 04:42:02,832 INFO L226 Difference]: Without dead ends: 1371 [2022-07-14 04:42:02,836 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-14 04:42:02,837 INFO L413 NwaCegarLoop]: 1455 mSDtfsCounter, 1556 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 2128 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.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:02,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 2128 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 04:42:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-07-14 04:42:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1344. [2022-07-14 04:42:02,874 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-14 04:42:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1775 transitions. [2022-07-14 04:42:02,878 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1775 transitions. Word has length 75 [2022-07-14 04:42:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:02,878 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1775 transitions. [2022-07-14 04:42:02,879 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-14 04:42:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1775 transitions. [2022-07-14 04:42:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 04:42:02,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:02,880 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-14 04:42:02,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:42:02,880 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-14 04:42:02,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash 235936066, now seen corresponding path program 1 times [2022-07-14 04:42:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:02,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132752543] [2022-07-14 04:42:02,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:02,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:03,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:42:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:42:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:42:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:03,037 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-14 04:42:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:03,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132752543] [2022-07-14 04:42:03,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132752543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:03,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:03,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:42:03,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886670857] [2022-07-14 04:42:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:03,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:42:03,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:42:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:42:03,039 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-14 04:42:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:06,523 INFO L93 Difference]: Finished difference Result 1384 states and 1840 transitions. [2022-07-14 04:42:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 04:42:06,523 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-14 04:42:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:06,529 INFO L225 Difference]: With dead ends: 1384 [2022-07-14 04:42:06,530 INFO L226 Difference]: Without dead ends: 1382 [2022-07-14 04:42:06,531 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-14 04:42:06,531 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-14 04:42:06,531 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-14 04:42:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-07-14 04:42:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1342. [2022-07-14 04:42:06,575 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-14 04:42:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1773 transitions. [2022-07-14 04:42:06,579 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1773 transitions. Word has length 80 [2022-07-14 04:42:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:06,579 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 1773 transitions. [2022-07-14 04:42:06,579 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-14 04:42:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1773 transitions. [2022-07-14 04:42:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 04:42:06,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:06,581 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-14 04:42:06,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:42:06,581 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-14 04:42:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash -55840951, now seen corresponding path program 1 times [2022-07-14 04:42:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:06,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632432563] [2022-07-14 04:42:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:06,706 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-14 04:42:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632432563] [2022-07-14 04:42:06,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632432563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:06,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:06,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770122429] [2022-07-14 04:42:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:06,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:06,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:06,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:06,716 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-14 04:42:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:08,359 INFO L93 Difference]: Finished difference Result 1342 states and 1773 transitions. [2022-07-14 04:42:08,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:08,360 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-14 04:42:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:08,368 INFO L225 Difference]: With dead ends: 1342 [2022-07-14 04:42:08,368 INFO L226 Difference]: Without dead ends: 1340 [2022-07-14 04:42:08,369 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-14 04:42:08,370 INFO L413 NwaCegarLoop]: 1355 mSDtfsCounter, 2489 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:08,370 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.5s Time] [2022-07-14 04:42:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-07-14 04:42:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2022-07-14 04:42:08,433 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-14 04:42:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1771 transitions. [2022-07-14 04:42:08,439 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1771 transitions. Word has length 80 [2022-07-14 04:42:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:08,439 INFO L495 AbstractCegarLoop]: Abstraction has 1340 states and 1771 transitions. [2022-07-14 04:42:08,440 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-14 04:42:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1771 transitions. [2022-07-14 04:42:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 04:42:08,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:08,462 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-14 04:42:08,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:42:08,462 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-14 04:42:08,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:08,462 INFO L85 PathProgramCache]: Analyzing trace with hash -431123591, now seen corresponding path program 1 times [2022-07-14 04:42:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:08,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224541951] [2022-07-14 04:42:08,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:08,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:42:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:08,596 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-14 04:42:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:08,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224541951] [2022-07-14 04:42:08,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224541951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:08,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:08,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:08,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022287706] [2022-07-14 04:42:08,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:08,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:08,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:08,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:08,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:08,598 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-14 04:42:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:10,206 INFO L93 Difference]: Finished difference Result 1340 states and 1771 transitions. [2022-07-14 04:42:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:10,206 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-14 04:42:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:10,211 INFO L225 Difference]: With dead ends: 1340 [2022-07-14 04:42:10,211 INFO L226 Difference]: Without dead ends: 1338 [2022-07-14 04:42:10,212 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-14 04:42:10,213 INFO L413 NwaCegarLoop]: 1353 mSDtfsCounter, 2483 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:10,216 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.5s Time] [2022-07-14 04:42:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-07-14 04:42:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2022-07-14 04:42:10,288 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-14 04:42:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1769 transitions. [2022-07-14 04:42:10,292 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1769 transitions. Word has length 86 [2022-07-14 04:42:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:10,292 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1769 transitions. [2022-07-14 04:42:10,292 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-14 04:42:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1769 transitions. [2022-07-14 04:42:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-14 04:42:10,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:10,294 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-14 04:42:10,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:42:10,294 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-14 04:42:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash 902433868, now seen corresponding path program 1 times [2022-07-14 04:42:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:10,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683624633] [2022-07-14 04:42:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:42:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:42:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:10,399 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-14 04:42:10,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683624633] [2022-07-14 04:42:10,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683624633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:10,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:10,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381251514] [2022-07-14 04:42:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:10,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:10,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:10,401 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-14 04:42:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:12,094 INFO L93 Difference]: Finished difference Result 1338 states and 1769 transitions. [2022-07-14 04:42:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:12,094 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-14 04:42:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:12,100 INFO L225 Difference]: With dead ends: 1338 [2022-07-14 04:42:12,100 INFO L226 Difference]: Without dead ends: 1336 [2022-07-14 04:42:12,101 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-14 04:42:12,101 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.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:12,101 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.6s Time] [2022-07-14 04:42:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-07-14 04:42:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-07-14 04:42:12,148 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-14 04:42:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1767 transitions. [2022-07-14 04:42:12,152 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1767 transitions. Word has length 92 [2022-07-14 04:42:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:12,152 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 1767 transitions. [2022-07-14 04:42:12,152 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-14 04:42:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1767 transitions. [2022-07-14 04:42:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:42:12,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:12,154 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-14 04:42:12,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:42:12,154 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-14 04:42:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -344293265, now seen corresponding path program 1 times [2022-07-14 04:42:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:12,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978942589] [2022-07-14 04:42:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:42:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:42:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:12,258 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-14 04:42:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:12,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978942589] [2022-07-14 04:42:12,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978942589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:12,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:12,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:12,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283872493] [2022-07-14 04:42:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:12,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:12,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:12,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:12,261 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-14 04:42:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:13,920 INFO L93 Difference]: Finished difference Result 1336 states and 1767 transitions. [2022-07-14 04:42:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:13,920 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-14 04:42:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:13,925 INFO L225 Difference]: With dead ends: 1336 [2022-07-14 04:42:13,925 INFO L226 Difference]: Without dead ends: 1334 [2022-07-14 04:42:13,926 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-14 04:42:13,926 INFO L413 NwaCegarLoop]: 1349 mSDtfsCounter, 2469 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:13,927 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.5s Time] [2022-07-14 04:42:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-07-14 04:42:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2022-07-14 04:42:13,977 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-14 04:42:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1765 transitions. [2022-07-14 04:42:13,981 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1765 transitions. Word has length 94 [2022-07-14 04:42:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:13,981 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1765 transitions. [2022-07-14 04:42:13,982 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-14 04:42:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1765 transitions. [2022-07-14 04:42:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:42:13,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:13,984 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-14 04:42:13,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:42:13,984 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-14 04:42:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1753336582, now seen corresponding path program 1 times [2022-07-14 04:42:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882659728] [2022-07-14 04:42:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:42:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:42:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:42:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:14,135 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-14 04:42:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:14,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882659728] [2022-07-14 04:42:14,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882659728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:14,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:14,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039954492] [2022-07-14 04:42:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:14,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:14,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:14,137 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-14 04:42:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:15,779 INFO L93 Difference]: Finished difference Result 1334 states and 1765 transitions. [2022-07-14 04:42:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:15,780 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-14 04:42:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:15,786 INFO L225 Difference]: With dead ends: 1334 [2022-07-14 04:42:15,786 INFO L226 Difference]: Without dead ends: 1332 [2022-07-14 04:42:15,787 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-14 04:42:15,788 INFO L413 NwaCegarLoop]: 1347 mSDtfsCounter, 2465 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 2361 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-14 04:42:15,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 2361 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 04:42:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-07-14 04:42:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2022-07-14 04:42:15,854 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-14 04:42:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1763 transitions. [2022-07-14 04:42:15,858 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1763 transitions. Word has length 100 [2022-07-14 04:42:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:15,859 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1763 transitions. [2022-07-14 04:42:15,859 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-14 04:42:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1763 transitions. [2022-07-14 04:42:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:42:15,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:15,861 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-14 04:42:15,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:42:15,861 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-14 04:42:15,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash 630217368, now seen corresponding path program 1 times [2022-07-14 04:42:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:15,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146803819] [2022-07-14 04:42:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:42:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:42:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:42:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:42:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:15,965 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-14 04:42:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:15,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146803819] [2022-07-14 04:42:15,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146803819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:15,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:15,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213806780] [2022-07-14 04:42:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:15,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:15,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:15,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:15,967 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-14 04:42:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:17,807 INFO L93 Difference]: Finished difference Result 1332 states and 1763 transitions. [2022-07-14 04:42:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:17,807 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-14 04:42:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:17,812 INFO L225 Difference]: With dead ends: 1332 [2022-07-14 04:42:17,813 INFO L226 Difference]: Without dead ends: 1330 [2022-07-14 04:42:17,813 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-14 04:42:17,814 INFO L413 NwaCegarLoop]: 1345 mSDtfsCounter, 2459 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:17,814 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.7s Time] [2022-07-14 04:42:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2022-07-14 04:42:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-07-14 04:42:17,868 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-14 04:42:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1761 transitions. [2022-07-14 04:42:17,871 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1761 transitions. Word has length 106 [2022-07-14 04:42:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:17,872 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1761 transitions. [2022-07-14 04:42:17,872 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-14 04:42:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1761 transitions. [2022-07-14 04:42:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-14 04:42:17,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:17,873 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-14 04:42:17,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:42:17,874 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-14 04:42:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1254059172, now seen corresponding path program 1 times [2022-07-14 04:42:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:17,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672417461] [2022-07-14 04:42:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:42:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:42:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:42:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:42:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:42:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,971 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-14 04:42:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:17,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672417461] [2022-07-14 04:42:17,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672417461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:17,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:17,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59463010] [2022-07-14 04:42:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:17,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:17,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:17,973 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-14 04:42:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:19,592 INFO L93 Difference]: Finished difference Result 1330 states and 1761 transitions. [2022-07-14 04:42:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:19,593 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-14 04:42:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:19,598 INFO L225 Difference]: With dead ends: 1330 [2022-07-14 04:42:19,598 INFO L226 Difference]: Without dead ends: 1328 [2022-07-14 04:42:19,598 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-14 04:42:19,599 INFO L413 NwaCegarLoop]: 1343 mSDtfsCounter, 2453 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:19,599 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.5s Time] [2022-07-14 04:42:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-07-14 04:42:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2022-07-14 04:42:19,645 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-14 04:42:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1759 transitions. [2022-07-14 04:42:19,648 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1759 transitions. Word has length 112 [2022-07-14 04:42:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:19,649 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1759 transitions. [2022-07-14 04:42:19,649 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-14 04:42:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1759 transitions. [2022-07-14 04:42:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-14 04:42:19,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:19,651 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-14 04:42:19,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:42:19,651 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-14 04:42:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1834678598, now seen corresponding path program 1 times [2022-07-14 04:42:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:19,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786604108] [2022-07-14 04:42:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:42:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:42:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:42:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:42:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:42:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:42:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:19,769 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-14 04:42:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:19,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786604108] [2022-07-14 04:42:19,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786604108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:19,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:19,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531676250] [2022-07-14 04:42:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:19,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:19,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:19,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:19,771 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-14 04:42:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:21,530 INFO L93 Difference]: Finished difference Result 1328 states and 1759 transitions. [2022-07-14 04:42:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:21,530 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-14 04:42:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:21,535 INFO L225 Difference]: With dead ends: 1328 [2022-07-14 04:42:21,536 INFO L226 Difference]: Without dead ends: 1326 [2022-07-14 04:42:21,536 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-14 04:42:21,538 INFO L413 NwaCegarLoop]: 1341 mSDtfsCounter, 2447 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:21,538 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.6s Time] [2022-07-14 04:42:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-07-14 04:42:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2022-07-14 04:42:21,587 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-14 04:42:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1757 transitions. [2022-07-14 04:42:21,591 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1757 transitions. Word has length 118 [2022-07-14 04:42:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:21,592 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1757 transitions. [2022-07-14 04:42:21,592 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-14 04:42:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1757 transitions. [2022-07-14 04:42:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-14 04:42:21,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:21,594 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-14 04:42:21,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:42:21,594 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-14 04:42:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash -303721131, now seen corresponding path program 1 times [2022-07-14 04:42:21,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:21,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903197111] [2022-07-14 04:42:21,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:21,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:42:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:42:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:42:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:42:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:42:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 04:42:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:42:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:42:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:21,763 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-14 04:42:21,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:21,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903197111] [2022-07-14 04:42:21,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903197111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:21,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:21,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:42:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566145673] [2022-07-14 04:42:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:21,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:42:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:21,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:42:21,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:42:21,766 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-14 04:42:24,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:42:28,252 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-14 04:42:30,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 04:42:32,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 04:42:36,041 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-14 04:42:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:36,912 INFO L93 Difference]: Finished difference Result 2845 states and 3829 transitions. [2022-07-14 04:42:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 04:42:36,913 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-14 04:42:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:36,919 INFO L225 Difference]: With dead ends: 2845 [2022-07-14 04:42:36,919 INFO L226 Difference]: Without dead ends: 1537 [2022-07-14 04:42:36,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:42:36,924 INFO L413 NwaCegarLoop]: 1386 mSDtfsCounter, 1409 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 5524 mSolverCounterSat, 1060 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 3497 SdHoareTripleChecker+Invalid, 6589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1060 IncrementalHoareTripleChecker+Valid, 5524 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:36,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 3497 Invalid, 6589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1060 Valid, 5524 Invalid, 5 Unknown, 0 Unchecked, 14.9s Time] [2022-07-14 04:42:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-07-14 04:42:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1330. [2022-07-14 04:42:37,013 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-14 04:42:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1765 transitions. [2022-07-14 04:42:37,017 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1765 transitions. Word has length 121 [2022-07-14 04:42:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:37,018 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1765 transitions. [2022-07-14 04:42:37,018 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-14 04:42:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1765 transitions. [2022-07-14 04:42:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-14 04:42:37,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:37,021 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-14 04:42:37,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:42:37,022 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-14 04:42:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:37,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1339404786, now seen corresponding path program 1 times [2022-07-14 04:42:37,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:37,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102508237] [2022-07-14 04:42:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:37,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:42:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:42:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:42:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:42:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:42:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 04:42:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:42:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:42:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:42:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:37,260 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-14 04:42:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102508237] [2022-07-14 04:42:37,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102508237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:37,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:37,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:42:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642770203] [2022-07-14 04:42:37,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:37,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:42:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:42:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:42:37,262 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-14 04:42:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:42,168 INFO L93 Difference]: Finished difference Result 2704 states and 3641 transitions. [2022-07-14 04:42:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 04:42:42,169 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-14 04:42:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:42,177 INFO L225 Difference]: With dead ends: 2704 [2022-07-14 04:42:42,177 INFO L226 Difference]: Without dead ends: 1390 [2022-07-14 04:42:42,185 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-14 04:42:42,186 INFO L413 NwaCegarLoop]: 1297 mSDtfsCounter, 1024 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 4560 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 5217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 4560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:42,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 3202 Invalid, 5217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 4560 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-14 04:42:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2022-07-14 04:42:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1334. [2022-07-14 04:42:42,261 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-14 04:42:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1770 transitions. [2022-07-14 04:42:42,265 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1770 transitions. Word has length 125 [2022-07-14 04:42:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:42,266 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1770 transitions. [2022-07-14 04:42:42,266 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-14 04:42:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1770 transitions. [2022-07-14 04:42:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-14 04:42:42,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:42,269 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-14 04:42:42,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:42:42,270 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-14 04:42:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 989460374, now seen corresponding path program 1 times [2022-07-14 04:42:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:42,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311914952] [2022-07-14 04:42:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:42:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:42:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:42:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:42:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:42:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:42:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:42:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:42:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:42:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:42:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:42:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:42:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:42:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:42:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:42:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:42,420 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-14 04:42:42,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:42,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311914952] [2022-07-14 04:42:42,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311914952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:42,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:42,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:42,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729312444] [2022-07-14 04:42:42,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:42,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:42,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:42,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:42,425 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-14 04:42:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:44,483 INFO L93 Difference]: Finished difference Result 1334 states and 1770 transitions. [2022-07-14 04:42:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:44,483 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-14 04:42:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:44,487 INFO L225 Difference]: With dead ends: 1334 [2022-07-14 04:42:44,488 INFO L226 Difference]: Without dead ends: 1332 [2022-07-14 04:42:44,488 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-14 04:42:44,488 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-14 04:42:44,489 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-14 04:42:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-07-14 04:42:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2022-07-14 04:42:44,541 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-14 04:42:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1768 transitions. [2022-07-14 04:42:44,545 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1768 transitions. Word has length 124 [2022-07-14 04:42:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:44,545 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1768 transitions. [2022-07-14 04:42:44,545 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-14 04:42:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1768 transitions. [2022-07-14 04:42:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 04:42:44,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:44,551 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-14 04:42:44,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:42:44,551 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-14 04:42:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1814029112, now seen corresponding path program 1 times [2022-07-14 04:42:44,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:44,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255210070] [2022-07-14 04:42:44,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:44,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:42:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:42:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:42:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:42:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:42:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 04:42:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:42:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:42:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:42:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:44,789 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-14 04:42:44,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:44,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255210070] [2022-07-14 04:42:44,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255210070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:42:44,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074521477] [2022-07-14 04:42:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:44,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:42:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:42:44,792 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-14 04:42:44,794 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-14 04:42:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:45,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 04:42:45,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:42:45,290 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-14 04:42:45,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:42:45,454 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-14 04:42:45,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074521477] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:42:45,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:42:45,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-14 04:42:45,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869160373] [2022-07-14 04:42:45,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:42:45,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 04:42:45,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 04:42:45,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:42:45,455 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-14 04:42:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:52,054 INFO L93 Difference]: Finished difference Result 2720 states and 3668 transitions. [2022-07-14 04:42:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 04:42:52,056 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-14 04:42:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:52,063 INFO L225 Difference]: With dead ends: 2720 [2022-07-14 04:42:52,063 INFO L226 Difference]: Without dead ends: 1402 [2022-07-14 04:42:52,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2022-07-14 04:42:52,069 INFO L413 NwaCegarLoop]: 1298 mSDtfsCounter, 1285 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 7116 mSolverCounterSat, 958 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:52,069 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.0s Time] [2022-07-14 04:42:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-07-14 04:42:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1344. [2022-07-14 04:42:52,134 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-14 04:42:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1786 transitions. [2022-07-14 04:42:52,138 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1786 transitions. Word has length 126 [2022-07-14 04:42:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:52,139 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1786 transitions. [2022-07-14 04:42:52,140 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-14 04:42:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1786 transitions. [2022-07-14 04:42:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-14 04:42:52,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:52,143 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-14 04:42:52,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 04:42:52,362 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-14 04:42:52,363 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-14 04:42:52,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1890159087, now seen corresponding path program 1 times [2022-07-14 04:42:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:52,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309477465] [2022-07-14 04:42:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:42:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:42:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:42:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:42:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:42:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 04:42:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:42:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:42:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:52,526 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-14 04:42:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:52,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309477465] [2022-07-14 04:42:52,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309477465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:52,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:52,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:42:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604137163] [2022-07-14 04:42:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:52,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:42:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:42:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:42:52,528 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-14 04:42:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:56,545 INFO L93 Difference]: Finished difference Result 2830 states and 3845 transitions. [2022-07-14 04:42:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:42:56,546 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-14 04:42:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:56,553 INFO L225 Difference]: With dead ends: 2830 [2022-07-14 04:42:56,553 INFO L226 Difference]: Without dead ends: 1504 [2022-07-14 04:42:56,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:42:56,558 INFO L413 NwaCegarLoop]: 1313 mSDtfsCounter, 1077 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 3931 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 2984 SdHoareTripleChecker+Invalid, 4594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 3931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:56,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 2984 Invalid, 4594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 3931 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-14 04:42:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-07-14 04:42:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1348. [2022-07-14 04:42:56,617 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-14 04:42:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1790 transitions. [2022-07-14 04:42:56,641 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1790 transitions. Word has length 125 [2022-07-14 04:42:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:56,641 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1790 transitions. [2022-07-14 04:42:56,642 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-14 04:42:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1790 transitions. [2022-07-14 04:42:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:42:56,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:56,644 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-14 04:42:56,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:42:56,644 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-14 04:42:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -397002125, now seen corresponding path program 1 times [2022-07-14 04:42:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:56,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710386713] [2022-07-14 04:42:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:42:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:42:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:42:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:42:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:42:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:42:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:42:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:42:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:42:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:56,958 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-14 04:42:56,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:56,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710386713] [2022-07-14 04:42:56,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710386713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:42:56,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125201943] [2022-07-14 04:42:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:56,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:42:56,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:42:56,959 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-14 04:42:56,960 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-14 04:42:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:57,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 04:42:57,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:42:57,645 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-14 04:42:57,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:42:58,029 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-14 04:42:58,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125201943] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:42:58,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:42:58,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 24 [2022-07-14 04:42:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010923644] [2022-07-14 04:42:58,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:42:58,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 04:42:58,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:58,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 04:42:58,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-14 04:42:58,032 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-14 04:43:04,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:16,652 INFO L93 Difference]: Finished difference Result 2822 states and 3826 transitions. [2022-07-14 04:43:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 04:43:16,653 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-14 04:43:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:16,659 INFO L225 Difference]: With dead ends: 2822 [2022-07-14 04:43:16,659 INFO L226 Difference]: Without dead ends: 1488 [2022-07-14 04:43:16,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-07-14 04:43:16,664 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 1345 mSDsluCounter, 6948 mSDsCounter, 0 mSdLazyCounter, 17070 mSolverCounterSat, 677 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 8350 SdHoareTripleChecker+Invalid, 17748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 17070 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:16,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 8350 Invalid, 17748 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [677 Valid, 17070 Invalid, 1 Unknown, 0 Unchecked, 17.7s Time] [2022-07-14 04:43:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-14 04:43:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1353. [2022-07-14 04:43:16,734 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-14 04:43:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1796 transitions. [2022-07-14 04:43:16,737 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1796 transitions. Word has length 132 [2022-07-14 04:43:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:16,738 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1796 transitions. [2022-07-14 04:43:16,738 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-14 04:43:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1796 transitions. [2022-07-14 04:43:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-14 04:43:16,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:16,740 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-14 04:43:16,763 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-14 04:43:16,946 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-14 04:43:16,946 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-14 04:43:16,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1538085832, now seen corresponding path program 1 times [2022-07-14 04:43:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:16,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131173554] [2022-07-14 04:43:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:16,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:43:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:43:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:43:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:43:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:43:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:43:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:43:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:43:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:43:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:43:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:43:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:43:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:43:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:43:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:43:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:43:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:43:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:43:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:17,096 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-14 04:43:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:17,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131173554] [2022-07-14 04:43:17,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131173554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:17,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:17,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:43:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239448916] [2022-07-14 04:43:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:17,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:43:17,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:43:17,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:43:17,098 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-14 04:43:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:19,098 INFO L93 Difference]: Finished difference Result 1353 states and 1796 transitions. [2022-07-14 04:43:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:43:19,098 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-14 04:43:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:19,102 INFO L225 Difference]: With dead ends: 1353 [2022-07-14 04:43:19,102 INFO L226 Difference]: Without dead ends: 1351 [2022-07-14 04:43:19,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:43:19,103 INFO L413 NwaCegarLoop]: 1336 mSDtfsCounter, 2434 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:19,104 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.8s Time] [2022-07-14 04:43:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-14 04:43:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2022-07-14 04:43:19,171 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-14 04:43:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1794 transitions. [2022-07-14 04:43:19,174 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1794 transitions. Word has length 130 [2022-07-14 04:43:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:19,175 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1794 transitions. [2022-07-14 04:43:19,175 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-14 04:43:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1794 transitions. [2022-07-14 04:43:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-14 04:43:19,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:19,177 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-14 04:43:19,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 04:43:19,178 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-14 04:43:19,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:19,178 INFO L85 PathProgramCache]: Analyzing trace with hash -824114156, now seen corresponding path program 1 times [2022-07-14 04:43:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:19,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259820832] [2022-07-14 04:43:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:43:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:43:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:43:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 04:43:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:43:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:43:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:43:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:43:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:43:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:43:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:43:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:43:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:19,533 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-14 04:43:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259820832] [2022-07-14 04:43:19,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259820832] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:43:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935159118] [2022-07-14 04:43:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:19,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:43:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:43:19,535 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-14 04:43:19,536 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-14 04:43:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:20,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 04:43:20,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:43:20,240 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-14 04:43:20,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:43:20,751 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-14 04:43:20,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935159118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:43:20,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:43:20,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 27 [2022-07-14 04:43:20,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082780593] [2022-07-14 04:43:20,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:43:20,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 04:43:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:20,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 04:43:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2022-07-14 04:43:20,754 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-14 04:43:34,438 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-14 04:43:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:44,076 INFO L93 Difference]: Finished difference Result 2773 states and 3741 transitions. [2022-07-14 04:43:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-14 04:43:44,076 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-14 04:43:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:44,081 INFO L225 Difference]: With dead ends: 2773 [2022-07-14 04:43:44,081 INFO L226 Difference]: Without dead ends: 1432 [2022-07-14 04:43:44,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=718, Invalid=2362, Unknown=0, NotChecked=0, Total=3080 [2022-07-14 04:43:44,086 INFO L413 NwaCegarLoop]: 1298 mSDtfsCounter, 1358 mSDsluCounter, 4506 mSDsCounter, 0 mSdLazyCounter, 11180 mSolverCounterSat, 1012 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 5804 SdHoareTripleChecker+Invalid, 12193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 11180 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:44,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 5804 Invalid, 12193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1012 Valid, 11180 Invalid, 1 Unknown, 0 Unchecked, 20.0s Time] [2022-07-14 04:43:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-07-14 04:43:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1366. [2022-07-14 04:43:44,156 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-14 04:43:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1815 transitions. [2022-07-14 04:43:44,160 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1815 transitions. Word has length 137 [2022-07-14 04:43:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:44,160 INFO L495 AbstractCegarLoop]: Abstraction has 1366 states and 1815 transitions. [2022-07-14 04:43:44,160 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-14 04:43:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1815 transitions. [2022-07-14 04:43:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-14 04:43:44,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:44,163 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-14 04:43:44,185 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-14 04:43:44,375 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-14 04:43:44,375 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-14 04:43:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1344645454, now seen corresponding path program 1 times [2022-07-14 04:43:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:44,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368334409] [2022-07-14 04:43:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:43:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:43:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 04:43:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 04:43:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 04:43:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 04:43:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:43:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 04:43:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 04:43:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 04:43:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 04:43:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:43:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:43:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:43:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:43:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:43:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:43:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 04:43:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 04:43:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:44,517 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-14 04:43:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368334409] [2022-07-14 04:43:44,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368334409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:44,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:44,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:43:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056733723] [2022-07-14 04:43:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:44,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:43:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:43:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:43:44,519 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-14 04:43:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:46,897 INFO L93 Difference]: Finished difference Result 1366 states and 1815 transitions. [2022-07-14 04:43:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:43:46,897 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-14 04:43:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:46,902 INFO L225 Difference]: With dead ends: 1366 [2022-07-14 04:43:46,902 INFO L226 Difference]: Without dead ends: 1364 [2022-07-14 04:43:46,902 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-14 04:43:46,903 INFO L413 NwaCegarLoop]: 1334 mSDtfsCounter, 2428 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:46,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2519 Valid, 2345 Invalid, 2453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 04:43:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-07-14 04:43:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2022-07-14 04:43:46,974 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-14 04:43:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1813 transitions. [2022-07-14 04:43:46,977 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1813 transitions. Word has length 136 [2022-07-14 04:43:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:46,978 INFO L495 AbstractCegarLoop]: Abstraction has 1364 states and 1813 transitions. [2022-07-14 04:43:46,978 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-14 04:43:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1813 transitions. [2022-07-14 04:43:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 04:43:46,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:46,980 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-14 04:43:46,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 04:43:46,981 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-14 04:43:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash 502310038, now seen corresponding path program 2 times [2022-07-14 04:43:46,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:46,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647995334] [2022-07-14 04:43:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:43:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:43:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:43:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 04:43:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:43:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:43:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:43:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:43:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:43:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:43:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 04:43:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:43:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:47,611 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-14 04:43:47,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:47,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647995334] [2022-07-14 04:43:47,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647995334] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:43:47,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181728443] [2022-07-14 04:43:47,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 04:43:47,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:43:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:43:47,613 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-14 04:43:47,615 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-14 04:43:48,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 04:43:48,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 04:43:48,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 04:43:48,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:43:48,837 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-14 04:43:48,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:43:51,623 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-14 04:43:51,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181728443] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:43:51,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:43:51,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 48 [2022-07-14 04:43:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068752361] [2022-07-14 04:43:51,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:43:51,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-14 04:43:51,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:51,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-14 04:43:51,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1769, Unknown=0, NotChecked=0, Total=2256 [2022-07-14 04:43:51,626 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-14 04:44:04,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:24,961 WARN L233 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 86 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 04:45:25,814 WARN L233 SmtUtils]: Spent 27.64s 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-14 04:45:43,418 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-14 04:45:45,540 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-14 04:45:47,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 04:45:49,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 04:45:51,931 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 []