./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 6c24879c 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-?-6c24879 [2022-07-12 16:59:54,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:59:54,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:59:54,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:59:54,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:59:54,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:59:54,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:59:54,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:59:54,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:59:54,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:59:54,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:59:54,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:59:54,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:59:54,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:59:54,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:59:54,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:59:54,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:59:54,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:59:54,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:59:54,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:59:54,592 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:59:54,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:59:54,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:59:54,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:59:54,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:59:54,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:59:54,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:59:54,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:59:54,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:59:54,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:59:54,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:59:54,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:59:54,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:59:54,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:59:54,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:59:54,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:59:54,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:59:54,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:59:54,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:59:54,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:59:54,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:59:54,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:59:54,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:59:54,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:59:54,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:59:54,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:59:54,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:59:54,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:59:54,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:59:54,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:59:54,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:59:54,646 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:59:54,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:59:54,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:59:54,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:59:54,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:59:54,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:59:54,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:59:54,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:59:54,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:59:54,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:59:54,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:59:54,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:59:54,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:59:54,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:59:54,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:59:54,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:59:54,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:59:54,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:59:54,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:59:54,650 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:59:54,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:59:54,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:59:54,651 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-12 16:59:54,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:59:54,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:59:54,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:59:54,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:59:54,961 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:59:54,963 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-12 16:59:55,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ade4170e/e1516ef1d2864077a03f2162152619f3/FLAG2199aa29a [2022-07-12 16:59:55,784 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:59:55,784 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-12 16:59:55,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ade4170e/e1516ef1d2864077a03f2162152619f3/FLAG2199aa29a [2022-07-12 16:59:56,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ade4170e/e1516ef1d2864077a03f2162152619f3 [2022-07-12 16:59:56,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:59:56,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:59:56,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:59:56,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:59:56,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:59:56,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:59:56" (1/1) ... [2022-07-12 16:59:56,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f36c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:56, skipping insertion in model container [2022-07-12 16:59:56,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:59:56" (1/1) ... [2022-07-12 16:59:56,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:59:56,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:59:58,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:59:58,097 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:59:58,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-12 16:59:58,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:59:58,517 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:59:58,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58 WrapperNode [2022-07-12 16:59:58,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:59:58,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:59:58,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:59:58,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:59:58,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,720 INFO L137 Inliner]: procedures = 498, calls = 1418, calls flagged for inlining = 214, calls inlined = 135, statements flattened = 3214 [2022-07-12 16:59:58,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:59:58,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:59:58,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:59:58,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:59:58,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:59:58,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:59:58,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:59:58,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:59:58,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (1/1) ... [2022-07-12 16:59:58,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:59:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:59:59,020 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-12 16:59:59,041 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-12 16:59:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mark_block_bad [2022-07-12 16:59:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mark_block_bad [2022-07-12 16:59:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:59:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:59:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 16:59:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 16:59:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-07-12 16:59:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-07-12 16:59:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2022-07-12 16:59:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2022-07-12 16:59:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:59:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:59:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:59:59,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:59:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 16:59:59,067 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 16:59:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:59:59,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:59:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:59:59,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:59:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_lba [2022-07-12 16:59:59,069 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_lba [2022-07-12 16:59:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure sm_check_block [2022-07-12 16:59:59,070 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_check_block [2022-07-12 16:59:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 16:59:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure sm_release [2022-07-12 16:59:59,070 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_release [2022-07-12 16:59:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 16:59:59,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 16:59:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_init [2022-07-12 16:59:59,071 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_init [2022-07-12 16:59:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:59:59,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:59:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:59:59,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:59:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_sector [2022-07-12 16:59:59,072 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_sector [2022-07-12 16:59:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 16:59:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:59:59,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:59:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure sm_write_sector [2022-07-12 16:59:59,072 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_write_sector [2022-07-12 16:59:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_calculate_ecc [2022-07-12 16:59:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_calculate_ecc [2022-07-12 16:59:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2022-07-12 16:59:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2022-07-12 16:59:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 16:59:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure sm_remove_dev [2022-07-12 16:59:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_remove_dev [2022-07-12 16:59:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 16:59:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 16:59:59,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 16:59:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:59:59,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:59:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2022-07-12 16:59:59,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2022-07-12 16:59:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:59:59,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:59:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:59:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:59:59,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:59:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 16:59:59,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 16:59:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure sm_recheck_media [2022-07-12 16:59:59,076 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_recheck_media [2022-07-12 16:59:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 16:59:59,076 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 16:59:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:59:59,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:59:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 16:59:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 16:59:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:59:59,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:59:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_put [2022-07-12 16:59:59,081 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_put [2022-07-12 16:59:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_cis [2022-07-12 16:59:59,081 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_cis [2022-07-12 16:59:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:59:59,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:59:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:59:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:59:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:59:59,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:59:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 16:59:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 16:59:59,084 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 16:59:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_out [2022-07-12 16:59:59,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_out [2022-07-12 16:59:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:59:59,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:59:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2022-07-12 16:59:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2022-07-12 16:59:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_flush [2022-07-12 16:59:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_flush [2022-07-12 16:59:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:59:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:59:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 16:59:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 16:59:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_zone [2022-07-12 16:59:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_zone [2022-07-12 16:59:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 16:59:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 16:59:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2022-07-12 16:59:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2022-07-12 16:59:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:59:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:59:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-12 16:59:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-12 16:59:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mkoffset [2022-07-12 16:59:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mkoffset [2022-07-12 16:59:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 16:59:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 16:59:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_lba [2022-07-12 16:59:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_lba [2022-07-12 16:59:59,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:59:59,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:59:59,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:59:59,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:59:59,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 16:59:59,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:59:59,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:59:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 16:59:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:59:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure mtd_is_eccerr [2022-07-12 16:59:59,090 INFO L138 BoogieDeclarations]: Found implementation of procedure mtd_is_eccerr [2022-07-12 16:59:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 16:59:59,090 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 16:59:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:59:59,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:59:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:59:59,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:59:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_in [2022-07-12 16:59:59,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_in [2022-07-12 16:59:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 16:59:59,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 16:59:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:59:59,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:59:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:59:59,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:59:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:59:59,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:59:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_correct_data [2022-07-12 16:59:59,092 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_correct_data [2022-07-12 16:59:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:59:59,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:59:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 16:59:59,092 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 16:59:59,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:59:59,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:59:59,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 16:59:59,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:59:59,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:59:59,093 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2022-07-12 16:59:59,093 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2022-07-12 16:59:59,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:59:59,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:59:59,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:59:59,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:59:59,094 INFO L130 BoogieDeclarations]: Found specification of procedure sm_sector_valid [2022-07-12 16:59:59,094 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_sector_valid [2022-07-12 16:59:59,094 INFO L130 BoogieDeclarations]: Found specification of procedure sm_erase_block [2022-07-12 16:59:59,094 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_erase_block [2022-07-12 16:59:59,094 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-12 16:59:59,095 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-12 16:59:59,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 16:59:59,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 16:59:59,095 INFO L130 BoogieDeclarations]: Found specification of procedure sm_break_offset [2022-07-12 16:59:59,095 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_break_offset [2022-07-12 16:59:59,095 INFO L130 BoogieDeclarations]: Found specification of procedure sm_block_valid [2022-07-12 16:59:59,095 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_block_valid [2022-07-12 16:59:59,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:59:59,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:59:59,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:59:59,708 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:59:59,711 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:00:00,147 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:00:01,617 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:00:01,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:00:01,632 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 17:00:01,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:00:01 BoogieIcfgContainer [2022-07-12 17:00:01,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:00:01,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:00:01,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:00:01,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:00:01,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:59:56" (1/3) ... [2022-07-12 17:00:01,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be237a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:00:01, skipping insertion in model container [2022-07-12 17:00:01,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:59:58" (2/3) ... [2022-07-12 17:00:01,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be237a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:00:01, skipping insertion in model container [2022-07-12 17:00:01,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:00:01" (3/3) ... [2022-07-12 17:00:01,643 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2022-07-12 17:00:01,656 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:00:01,656 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-12 17:00:01,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:00:01,723 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@1a4a2a91, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6929b42e [2022-07-12 17:00:01,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-12 17:00:01,731 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-12 17:00:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 17:00:01,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:01,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] [2022-07-12 17:00:01,741 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-12 17:00:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:01,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1248621391, now seen corresponding path program 1 times [2022-07-12 17:00:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:01,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758828752] [2022-07-12 17:00:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:02,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:02,276 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-12 17:00:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:02,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758828752] [2022-07-12 17:00:02,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758828752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:02,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:02,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996138350] [2022-07-12 17:00:02,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:02,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:02,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:02,317 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-12 17:00:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:04,988 INFO L93 Difference]: Finished difference Result 2288 states and 3171 transitions. [2022-07-12 17:00:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:04,990 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-12 17:00:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:05,010 INFO L225 Difference]: With dead ends: 2288 [2022-07-12 17:00:05,010 INFO L226 Difference]: Without dead ends: 1142 [2022-07-12 17:00:05,029 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-12 17:00:05,032 INFO L413 NwaCegarLoop]: 1391 mSDtfsCounter, 2579 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 1040 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2686 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:05,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2686 Valid, 2417 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 17:00:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-12 17:00:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2022-07-12 17:00:05,144 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-12 17:00:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1514 transitions. [2022-07-12 17:00:05,154 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1514 transitions. Word has length 50 [2022-07-12 17:00:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:05,155 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1514 transitions. [2022-07-12 17:00:05,155 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-12 17:00:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1514 transitions. [2022-07-12 17:00:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 17:00:05,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:05,158 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-12 17:00:05,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:00:05,158 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-12 17:00:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash 989377887, now seen corresponding path program 1 times [2022-07-12 17:00:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:05,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878064023] [2022-07-12 17:00:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:05,316 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-12 17:00:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:05,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878064023] [2022-07-12 17:00:05,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878064023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:05,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:05,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:05,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218157193] [2022-07-12 17:00:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:05,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:05,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:05,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:05,320 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-12 17:00:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:07,565 INFO L93 Difference]: Finished difference Result 1142 states and 1514 transitions. [2022-07-12 17:00:07,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:07,565 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-12 17:00:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:07,573 INFO L225 Difference]: With dead ends: 1142 [2022-07-12 17:00:07,574 INFO L226 Difference]: Without dead ends: 1140 [2022-07-12 17:00:07,574 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-12 17:00:07,575 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 2549 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:07,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 2389 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 17:00:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-12 17:00:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-07-12 17:00:07,625 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-12 17:00:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1512 transitions. [2022-07-12 17:00:07,633 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1512 transitions. Word has length 56 [2022-07-12 17:00:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:07,634 INFO L495 AbstractCegarLoop]: Abstraction has 1140 states and 1512 transitions. [2022-07-12 17:00:07,634 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-12 17:00:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1512 transitions. [2022-07-12 17:00:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 17:00:07,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:07,644 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-12 17:00:07,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:00:07,645 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-12 17:00:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash 735069371, now seen corresponding path program 1 times [2022-07-12 17:00:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:07,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962892058] [2022-07-12 17:00:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:00:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:07,833 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-12 17:00:07,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:07,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962892058] [2022-07-12 17:00:07,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962892058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:07,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:07,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651067196] [2022-07-12 17:00:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:07,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:07,837 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-12 17:00:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:09,902 INFO L93 Difference]: Finished difference Result 1391 states and 1841 transitions. [2022-07-12 17:00:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:09,902 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-12 17:00:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:09,914 INFO L225 Difference]: With dead ends: 1391 [2022-07-12 17:00:09,914 INFO L226 Difference]: Without dead ends: 1389 [2022-07-12 17:00:09,915 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-12 17:00:09,916 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-12 17:00:09,916 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-12 17:00:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2022-07-12 17:00:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1358. [2022-07-12 17:00:09,982 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-12 17:00:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1795 transitions. [2022-07-12 17:00:09,993 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1795 transitions. Word has length 62 [2022-07-12 17:00:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:09,994 INFO L495 AbstractCegarLoop]: Abstraction has 1358 states and 1795 transitions. [2022-07-12 17:00:09,994 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-12 17:00:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1795 transitions. [2022-07-12 17:00:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 17:00:09,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:09,996 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-12 17:00:09,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:00:09,996 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-12 17:00:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash -369420907, now seen corresponding path program 1 times [2022-07-12 17:00:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:09,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182904976] [2022-07-12 17:00:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:10,162 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-12 17:00:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:10,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182904976] [2022-07-12 17:00:10,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182904976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:10,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:10,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086150456] [2022-07-12 17:00:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:10,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:10,165 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-12 17:00:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:12,232 INFO L93 Difference]: Finished difference Result 1358 states and 1795 transitions. [2022-07-12 17:00:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:12,232 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-12 17:00:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:12,240 INFO L225 Difference]: With dead ends: 1358 [2022-07-12 17:00:12,240 INFO L226 Difference]: Without dead ends: 1356 [2022-07-12 17:00:12,243 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-12 17:00:12,244 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 2537 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2640 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:12,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2640 Valid, 2385 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 17:00:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-07-12 17:00:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2022-07-12 17:00:12,320 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-12 17:00:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1793 transitions. [2022-07-12 17:00:12,328 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1793 transitions. Word has length 62 [2022-07-12 17:00:12,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:12,330 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1793 transitions. [2022-07-12 17:00:12,330 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-12 17:00:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1793 transitions. [2022-07-12 17:00:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 17:00:12,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:12,332 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-12 17:00:12,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:00:12,332 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-12 17:00:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1572676478, now seen corresponding path program 1 times [2022-07-12 17:00:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:12,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69658502] [2022-07-12 17:00:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:12,508 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-12 17:00:12,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:12,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69658502] [2022-07-12 17:00:12,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69658502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:12,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:12,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:12,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66111591] [2022-07-12 17:00:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:12,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:12,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:12,512 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-12 17:00:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:14,549 INFO L93 Difference]: Finished difference Result 1356 states and 1793 transitions. [2022-07-12 17:00:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:14,549 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-12 17:00:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:14,556 INFO L225 Difference]: With dead ends: 1356 [2022-07-12 17:00:14,557 INFO L226 Difference]: Without dead ends: 1354 [2022-07-12 17:00:14,557 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-12 17:00:14,558 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 2531 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2633 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:14,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2633 Valid, 2383 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 17:00:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2022-07-12 17:00:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2022-07-12 17:00:14,613 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-12 17:00:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1791 transitions. [2022-07-12 17:00:14,621 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1791 transitions. Word has length 68 [2022-07-12 17:00:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:14,622 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 1791 transitions. [2022-07-12 17:00:14,622 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-12 17:00:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1791 transitions. [2022-07-12 17:00:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 17:00:14,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:14,624 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-12 17:00:14,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:00:14,624 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-12 17:00:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 492776973, now seen corresponding path program 1 times [2022-07-12 17:00:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:14,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723414684] [2022-07-12 17:00:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:00:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 17:00:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:14,833 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-12 17:00:14,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:14,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723414684] [2022-07-12 17:00:14,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723414684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:14,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:14,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:00:14,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260418371] [2022-07-12 17:00:14,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:14,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:00:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:14,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:00:14,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:00:14,836 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-12 17:00:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:16,808 INFO L93 Difference]: Finished difference Result 2717 states and 3609 transitions. [2022-07-12 17:00:16,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:16,808 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-12 17:00:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:16,816 INFO L225 Difference]: With dead ends: 2717 [2022-07-12 17:00:16,817 INFO L226 Difference]: Without dead ends: 1381 [2022-07-12 17:00:16,822 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-12 17:00:16,823 INFO L413 NwaCegarLoop]: 1460 mSDtfsCounter, 1583 mSDsluCounter, 3442 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 4902 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:16,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 4902 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 17:00:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2022-07-12 17:00:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1354. [2022-07-12 17:00:16,906 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-12 17:00:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1789 transitions. [2022-07-12 17:00:16,918 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1789 transitions. Word has length 71 [2022-07-12 17:00:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:16,918 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 1789 transitions. [2022-07-12 17:00:16,919 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-12 17:00:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1789 transitions. [2022-07-12 17:00:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 17:00:16,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:16,920 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-12 17:00:16,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:00:16,920 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-12 17:00:16,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:16,921 INFO L85 PathProgramCache]: Analyzing trace with hash 492836555, now seen corresponding path program 1 times [2022-07-12 17:00:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:16,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96540294] [2022-07-12 17:00:16,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:00:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 17:00:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,027 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-12 17:00:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:17,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96540294] [2022-07-12 17:00:17,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96540294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:17,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:17,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 17:00:17,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871393055] [2022-07-12 17:00:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:17,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 17:00:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 17:00:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 17:00:17,030 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-12 17:00:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:18,428 INFO L93 Difference]: Finished difference Result 1381 states and 1831 transitions. [2022-07-12 17:00:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 17:00:18,429 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-12 17:00:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:18,436 INFO L225 Difference]: With dead ends: 1381 [2022-07-12 17:00:18,437 INFO L226 Difference]: Without dead ends: 1379 [2022-07-12 17:00:18,438 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-12 17:00:18,438 INFO L413 NwaCegarLoop]: 1466 mSDtfsCounter, 318 mSDsluCounter, 2719 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:18,438 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.3s Time] [2022-07-12 17:00:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-07-12 17:00:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1352. [2022-07-12 17:00:18,490 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-12 17:00:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1786 transitions. [2022-07-12 17:00:18,495 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1786 transitions. Word has length 71 [2022-07-12 17:00:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:18,496 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1786 transitions. [2022-07-12 17:00:18,496 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-12 17:00:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1786 transitions. [2022-07-12 17:00:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 17:00:18,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:18,498 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-12 17:00:18,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:00:18,498 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-12 17:00:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1602363486, now seen corresponding path program 1 times [2022-07-12 17:00:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:18,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747528093] [2022-07-12 17:00:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,666 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-12 17:00:18,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:18,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747528093] [2022-07-12 17:00:18,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747528093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:18,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:18,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:18,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80457918] [2022-07-12 17:00:18,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:18,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:18,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:18,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:18,669 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-12 17:00:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:20,516 INFO L93 Difference]: Finished difference Result 1352 states and 1786 transitions. [2022-07-12 17:00:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:20,517 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-12 17:00:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:20,523 INFO L225 Difference]: With dead ends: 1352 [2022-07-12 17:00:20,523 INFO L226 Difference]: Without dead ends: 1350 [2022-07-12 17:00:20,524 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-12 17:00:20,525 INFO L413 NwaCegarLoop]: 1364 mSDtfsCounter, 2516 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:20,525 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.7s Time] [2022-07-12 17:00:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2022-07-12 17:00:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2022-07-12 17:00:20,576 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-12 17:00:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1784 transitions. [2022-07-12 17:00:20,581 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1784 transitions. Word has length 74 [2022-07-12 17:00:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:20,582 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1784 transitions. [2022-07-12 17:00:20,582 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-12 17:00:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1784 transitions. [2022-07-12 17:00:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 17:00:20,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:20,586 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-12 17:00:20,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:00:20,587 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-12 17:00:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1226418991, now seen corresponding path program 1 times [2022-07-12 17:00:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:20,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641273424] [2022-07-12 17:00:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:20,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:00:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 17:00:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:20,707 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-12 17:00:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:20,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641273424] [2022-07-12 17:00:20,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641273424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:20,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:20,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:00:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93185121] [2022-07-12 17:00:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:20,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:00:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:00:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:00:20,711 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-12 17:00:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:21,527 INFO L93 Difference]: Finished difference Result 2703 states and 3588 transitions. [2022-07-12 17:00:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:00:21,527 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-12 17:00:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:21,534 INFO L225 Difference]: With dead ends: 2703 [2022-07-12 17:00:21,535 INFO L226 Difference]: Without dead ends: 1371 [2022-07-12 17:00:21,540 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-12 17:00:21,542 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 1556 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:21,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 2126 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 17:00:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-07-12 17:00:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1344. [2022-07-12 17:00:21,596 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-12 17:00:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1775 transitions. [2022-07-12 17:00:21,601 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1775 transitions. Word has length 75 [2022-07-12 17:00:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:21,602 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1775 transitions. [2022-07-12 17:00:21,602 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-12 17:00:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1775 transitions. [2022-07-12 17:00:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 17:00:21,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:21,604 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-12 17:00:21,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:00:21,605 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-12 17:00:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash 235936066, now seen corresponding path program 1 times [2022-07-12 17:00:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:21,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085848361] [2022-07-12 17:00:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:00:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 17:00:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 17:00:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:21,799 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-12 17:00:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085848361] [2022-07-12 17:00:21,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085848361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:21,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:21,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:00:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650784715] [2022-07-12 17:00:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:21,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:00:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:00:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:00:21,802 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-12 17:00:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:25,284 INFO L93 Difference]: Finished difference Result 1384 states and 1840 transitions. [2022-07-12 17:00:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 17:00:25,284 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-12 17:00:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:25,290 INFO L225 Difference]: With dead ends: 1384 [2022-07-12 17:00:25,291 INFO L226 Difference]: Without dead ends: 1382 [2022-07-12 17:00:25,291 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-12 17:00:25,292 INFO L413 NwaCegarLoop]: 1336 mSDtfsCounter, 2127 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 3989 mSolverCounterSat, 1406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1406 IncrementalHoareTripleChecker+Valid, 3989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:25,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 3106 Invalid, 5395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1406 Valid, 3989 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 17:00:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-07-12 17:00:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1342. [2022-07-12 17:00:25,370 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-12 17:00:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1773 transitions. [2022-07-12 17:00:25,376 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1773 transitions. Word has length 80 [2022-07-12 17:00:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:25,376 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 1773 transitions. [2022-07-12 17:00:25,376 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-12 17:00:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1773 transitions. [2022-07-12 17:00:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 17:00:25,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:25,380 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-12 17:00:25,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:00:25,381 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-12 17:00:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -55840951, now seen corresponding path program 1 times [2022-07-12 17:00:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:25,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466416924] [2022-07-12 17:00:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:25,511 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-12 17:00:25,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:25,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466416924] [2022-07-12 17:00:25,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466416924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:25,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:25,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410421077] [2022-07-12 17:00:25,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:25,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:25,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:25,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:25,514 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-12 17:00:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:27,191 INFO L93 Difference]: Finished difference Result 1342 states and 1773 transitions. [2022-07-12 17:00:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:27,191 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-12 17:00:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:27,196 INFO L225 Difference]: With dead ends: 1342 [2022-07-12 17:00:27,196 INFO L226 Difference]: Without dead ends: 1340 [2022-07-12 17:00:27,197 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-12 17:00:27,197 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:27,197 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.6s Time] [2022-07-12 17:00:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-07-12 17:00:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2022-07-12 17:00:27,273 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-12 17:00:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1771 transitions. [2022-07-12 17:00:27,277 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1771 transitions. Word has length 80 [2022-07-12 17:00:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:27,278 INFO L495 AbstractCegarLoop]: Abstraction has 1340 states and 1771 transitions. [2022-07-12 17:00:27,278 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-12 17:00:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1771 transitions. [2022-07-12 17:00:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 17:00:27,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:27,280 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-12 17:00:27,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:00:27,280 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-12 17:00:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -431123591, now seen corresponding path program 1 times [2022-07-12 17:00:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:27,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158792374] [2022-07-12 17:00:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:00:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:27,385 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-12 17:00:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:27,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158792374] [2022-07-12 17:00:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158792374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:27,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:27,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104590080] [2022-07-12 17:00:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:27,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:27,388 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-12 17:00:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:29,050 INFO L93 Difference]: Finished difference Result 1340 states and 1771 transitions. [2022-07-12 17:00:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:29,050 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-12 17:00:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:29,056 INFO L225 Difference]: With dead ends: 1340 [2022-07-12 17:00:29,056 INFO L226 Difference]: Without dead ends: 1338 [2022-07-12 17:00:29,056 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-12 17:00:29,057 INFO L413 NwaCegarLoop]: 1353 mSDtfsCounter, 2483 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:29,057 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.6s Time] [2022-07-12 17:00:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-07-12 17:00:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2022-07-12 17:00:29,114 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-12 17:00:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1769 transitions. [2022-07-12 17:00:29,119 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1769 transitions. Word has length 86 [2022-07-12 17:00:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:29,120 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1769 transitions. [2022-07-12 17:00:29,120 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-12 17:00:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1769 transitions. [2022-07-12 17:00:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 17:00:29,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:29,122 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-12 17:00:29,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:00:29,122 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-12 17:00:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash 902433868, now seen corresponding path program 1 times [2022-07-12 17:00:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:29,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643142656] [2022-07-12 17:00:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:29,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:00:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:00:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:29,231 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-12 17:00:29,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:29,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643142656] [2022-07-12 17:00:29,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643142656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:29,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:29,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078239865] [2022-07-12 17:00:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:29,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:29,233 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-12 17:00:32,142 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-12 17:00:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:33,033 INFO L93 Difference]: Finished difference Result 1338 states and 1769 transitions. [2022-07-12 17:00:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:33,033 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-12 17:00:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:33,038 INFO L225 Difference]: With dead ends: 1338 [2022-07-12 17:00:33,038 INFO L226 Difference]: Without dead ends: 1336 [2022-07-12 17:00:33,039 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-12 17:00:33,039 INFO L413 NwaCegarLoop]: 1351 mSDtfsCounter, 2481 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 1034 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:33,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 2365 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1430 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 17:00:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-07-12 17:00:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-07-12 17:00:33,098 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-12 17:00:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1767 transitions. [2022-07-12 17:00:33,103 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1767 transitions. Word has length 92 [2022-07-12 17:00:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:33,103 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 1767 transitions. [2022-07-12 17:00:33,103 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-12 17:00:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1767 transitions. [2022-07-12 17:00:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 17:00:33,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:33,105 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-12 17:00:33,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:00:33,106 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-12 17:00:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:33,106 INFO L85 PathProgramCache]: Analyzing trace with hash -344293265, now seen corresponding path program 1 times [2022-07-12 17:00:33,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:33,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488652606] [2022-07-12 17:00:33,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:33,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:00:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:00:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:33,225 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-12 17:00:33,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:33,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488652606] [2022-07-12 17:00:33,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488652606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:33,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:33,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:33,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724467139] [2022-07-12 17:00:33,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:33,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:33,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:33,228 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-12 17:00:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:35,253 INFO L93 Difference]: Finished difference Result 1336 states and 1767 transitions. [2022-07-12 17:00:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:35,254 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-12 17:00:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:35,259 INFO L225 Difference]: With dead ends: 1336 [2022-07-12 17:00:35,259 INFO L226 Difference]: Without dead ends: 1334 [2022-07-12 17:00:35,259 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-12 17:00:35,259 INFO L413 NwaCegarLoop]: 1349 mSDtfsCounter, 2469 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:35,260 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.9s Time] [2022-07-12 17:00:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-07-12 17:00:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2022-07-12 17:00:35,321 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-12 17:00:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1765 transitions. [2022-07-12 17:00:35,326 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1765 transitions. Word has length 94 [2022-07-12 17:00:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:35,327 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1765 transitions. [2022-07-12 17:00:35,327 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-12 17:00:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1765 transitions. [2022-07-12 17:00:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 17:00:35,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:35,329 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-12 17:00:35,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:00:35,330 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-12 17:00:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1753336582, now seen corresponding path program 1 times [2022-07-12 17:00:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:35,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537453697] [2022-07-12 17:00:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:00:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:00:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:00:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:35,442 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-12 17:00:35,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:35,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537453697] [2022-07-12 17:00:35,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537453697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:35,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:35,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:35,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371539396] [2022-07-12 17:00:35,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:35,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:35,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:35,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:35,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:35,444 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-12 17:00:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:37,556 INFO L93 Difference]: Finished difference Result 1334 states and 1765 transitions. [2022-07-12 17:00:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:37,557 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-12 17:00:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:37,562 INFO L225 Difference]: With dead ends: 1334 [2022-07-12 17:00:37,562 INFO L226 Difference]: Without dead ends: 1332 [2022-07-12 17:00:37,562 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-12 17:00:37,563 INFO L413 NwaCegarLoop]: 1347 mSDtfsCounter, 2465 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:37,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 2361 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 17:00:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-07-12 17:00:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2022-07-12 17:00:37,622 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-12 17:00:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1763 transitions. [2022-07-12 17:00:37,627 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1763 transitions. Word has length 100 [2022-07-12 17:00:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:37,627 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1763 transitions. [2022-07-12 17:00:37,628 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-12 17:00:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1763 transitions. [2022-07-12 17:00:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 17:00:37,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:37,630 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-12 17:00:37,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:00:37,630 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-12 17:00:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash 630217368, now seen corresponding path program 1 times [2022-07-12 17:00:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:37,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856271808] [2022-07-12 17:00:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:00:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:00:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:00:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:00:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:37,750 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-12 17:00:37,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:37,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856271808] [2022-07-12 17:00:37,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856271808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:37,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:37,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716457157] [2022-07-12 17:00:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:37,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:37,752 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-12 17:00:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:39,883 INFO L93 Difference]: Finished difference Result 1332 states and 1763 transitions. [2022-07-12 17:00:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:39,883 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-12 17:00:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:39,889 INFO L225 Difference]: With dead ends: 1332 [2022-07-12 17:00:39,890 INFO L226 Difference]: Without dead ends: 1330 [2022-07-12 17:00:39,890 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-12 17:00:39,891 INFO L413 NwaCegarLoop]: 1345 mSDtfsCounter, 2459 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:39,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2555 Valid, 2359 Invalid, 2463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 17:00:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2022-07-12 17:00:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-07-12 17:00:39,951 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-12 17:00:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1761 transitions. [2022-07-12 17:00:39,956 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1761 transitions. Word has length 106 [2022-07-12 17:00:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:39,956 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1761 transitions. [2022-07-12 17:00:39,956 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-12 17:00:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1761 transitions. [2022-07-12 17:00:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 17:00:39,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:39,959 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-12 17:00:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:00:39,959 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-12 17:00:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1254059172, now seen corresponding path program 1 times [2022-07-12 17:00:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:39,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659816731] [2022-07-12 17:00:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:00:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:00:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:00:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:00:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:00:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:40,084 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-12 17:00:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:40,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659816731] [2022-07-12 17:00:40,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659816731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:40,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:40,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:40,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429023833] [2022-07-12 17:00:40,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:40,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:40,087 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-12 17:00:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:42,107 INFO L93 Difference]: Finished difference Result 1330 states and 1761 transitions. [2022-07-12 17:00:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:42,108 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-12 17:00:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:42,113 INFO L225 Difference]: With dead ends: 1330 [2022-07-12 17:00:42,113 INFO L226 Difference]: Without dead ends: 1328 [2022-07-12 17:00:42,113 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-12 17:00:42,114 INFO L413 NwaCegarLoop]: 1343 mSDtfsCounter, 2453 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2548 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:42,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2548 Valid, 2357 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 17:00:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-07-12 17:00:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2022-07-12 17:00:42,181 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-12 17:00:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1759 transitions. [2022-07-12 17:00:42,185 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1759 transitions. Word has length 112 [2022-07-12 17:00:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:42,186 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1759 transitions. [2022-07-12 17:00:42,186 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-12 17:00:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1759 transitions. [2022-07-12 17:00:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 17:00:42,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:42,189 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-12 17:00:42,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:00:42,189 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-12 17:00:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1834678598, now seen corresponding path program 1 times [2022-07-12 17:00:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140603680] [2022-07-12 17:00:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:00:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:00:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:00:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:00:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:00:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:00:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:42,313 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-12 17:00:42,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140603680] [2022-07-12 17:00:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140603680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:42,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:42,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505058829] [2022-07-12 17:00:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:42,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:42,315 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-12 17:00:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:44,150 INFO L93 Difference]: Finished difference Result 1328 states and 1759 transitions. [2022-07-12 17:00:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:44,151 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-12 17:00:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:44,156 INFO L225 Difference]: With dead ends: 1328 [2022-07-12 17:00:44,156 INFO L226 Difference]: Without dead ends: 1326 [2022-07-12 17:00:44,157 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-12 17:00:44,157 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:44,157 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.7s Time] [2022-07-12 17:00:44,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-07-12 17:00:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2022-07-12 17:00:44,221 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-12 17:00:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1757 transitions. [2022-07-12 17:00:44,225 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1757 transitions. Word has length 118 [2022-07-12 17:00:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:44,226 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1757 transitions. [2022-07-12 17:00:44,226 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-12 17:00:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1757 transitions. [2022-07-12 17:00:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 17:00:44,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:44,229 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-12 17:00:44,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:00:44,229 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-12 17:00:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash -303721131, now seen corresponding path program 1 times [2022-07-12 17:00:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:44,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189826275] [2022-07-12 17:00:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:00:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 17:00:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:00:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:00:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:00:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 17:00:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 17:00:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:00:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,409 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-12 17:00:44,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:44,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189826275] [2022-07-12 17:00:44,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189826275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:44,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:44,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:00:44,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272429514] [2022-07-12 17:00:44,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:44,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:00:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:00:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:00:44,412 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-12 17:00:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:49,327 INFO L93 Difference]: Finished difference Result 2845 states and 3829 transitions. [2022-07-12 17:00:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 17:00:49,327 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-12 17:00:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:49,333 INFO L225 Difference]: With dead ends: 2845 [2022-07-12 17:00:49,334 INFO L226 Difference]: Without dead ends: 1537 [2022-07-12 17:00:49,338 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-12 17:00:49,339 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 1409 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 5554 mSolverCounterSat, 1060 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 3502 SdHoareTripleChecker+Invalid, 6614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1060 IncrementalHoareTripleChecker+Valid, 5554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:49,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 3502 Invalid, 6614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1060 Valid, 5554 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 17:00:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-07-12 17:00:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1330. [2022-07-12 17:00:49,475 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-12 17:00:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1765 transitions. [2022-07-12 17:00:49,480 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1765 transitions. Word has length 121 [2022-07-12 17:00:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:49,480 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1765 transitions. [2022-07-12 17:00:49,481 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-12 17:00:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1765 transitions. [2022-07-12 17:00:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 17:00:49,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:49,484 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-12 17:00:49,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:00:49,484 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-12 17:00:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1339404786, now seen corresponding path program 1 times [2022-07-12 17:00:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:49,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538722074] [2022-07-12 17:00:49,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:00:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 17:00:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:00:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:00:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:00:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 17:00:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 17:00:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 17:00:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 17:00:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:49,722 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-12 17:00:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:49,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538722074] [2022-07-12 17:00:49,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538722074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:49,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:49,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:00:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748042490] [2022-07-12 17:00:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:49,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:00:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:00:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:00:49,724 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-12 17:00:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:54,627 INFO L93 Difference]: Finished difference Result 2704 states and 3641 transitions. [2022-07-12 17:00:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:00:54,627 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-12 17:00:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:54,635 INFO L225 Difference]: With dead ends: 2704 [2022-07-12 17:00:54,635 INFO L226 Difference]: Without dead ends: 1390 [2022-07-12 17:00:54,641 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-12 17:00:54,641 INFO L413 NwaCegarLoop]: 1300 mSDtfsCounter, 1024 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 5235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:54,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 3205 Invalid, 5235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 17:00:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2022-07-12 17:00:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1334. [2022-07-12 17:00:54,716 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-12 17:00:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1770 transitions. [2022-07-12 17:00:54,721 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1770 transitions. Word has length 125 [2022-07-12 17:00:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:54,722 INFO L495 AbstractCegarLoop]: Abstraction has 1334 states and 1770 transitions. [2022-07-12 17:00:54,722 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-12 17:00:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1770 transitions. [2022-07-12 17:00:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 17:00:54,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:54,725 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-12 17:00:54,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:00:54,725 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-12 17:00:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 989460374, now seen corresponding path program 1 times [2022-07-12 17:00:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:54,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961334964] [2022-07-12 17:00:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:00:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:00:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:00:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:00:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:00:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:00:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:00:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:00:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:00:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:00:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:00:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:00:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:00:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:00:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:00:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:00:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:54,846 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-12 17:00:54,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:54,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961334964] [2022-07-12 17:00:54,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961334964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:54,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:54,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:54,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312298473] [2022-07-12 17:00:54,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:54,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:54,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:54,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:54,848 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-12 17:00:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:56,778 INFO L93 Difference]: Finished difference Result 1334 states and 1770 transitions. [2022-07-12 17:00:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:56,778 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-12 17:00:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:56,784 INFO L225 Difference]: With dead ends: 1334 [2022-07-12 17:00:56,785 INFO L226 Difference]: Without dead ends: 1332 [2022-07-12 17:00:56,785 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-12 17:00:56,786 INFO L413 NwaCegarLoop]: 1339 mSDtfsCounter, 2441 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:56,786 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.8s Time] [2022-07-12 17:00:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-07-12 17:00:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2022-07-12 17:00:56,856 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-12 17:00:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1768 transitions. [2022-07-12 17:00:56,861 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1768 transitions. Word has length 124 [2022-07-12 17:00:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:56,861 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1768 transitions. [2022-07-12 17:00:56,862 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-12 17:00:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1768 transitions. [2022-07-12 17:00:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 17:00:56,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:56,865 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-12 17:00:56,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:00:56,866 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-12 17:00:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1814029112, now seen corresponding path program 1 times [2022-07-12 17:00:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:56,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373421495] [2022-07-12 17:00:56,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:56,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:00:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 17:00:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:00:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:00:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:00:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 17:00:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 17:00:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:57,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:57,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:00:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 17:00:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:57,113 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-12 17:00:57,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:57,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373421495] [2022-07-12 17:00:57,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373421495] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:00:57,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348684583] [2022-07-12 17:00:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:57,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:00:57,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:00:57,119 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-12 17:00:57,150 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-12 17:00:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:57,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 17:00:57,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:00:57,721 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-12 17:00:57,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:00:57,897 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-12 17:00:57,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348684583] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:00:57,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 17:00:57,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-12 17:00:57,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605690419] [2022-07-12 17:00:57,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 17:00:57,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:00:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:00:57,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:00:57,901 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-12 17:01:03,975 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-12 17:01:06,061 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-12 17:01:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:08,820 INFO L93 Difference]: Finished difference Result 2720 states and 3668 transitions. [2022-07-12 17:01:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 17:01:08,822 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-12 17:01:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:08,830 INFO L225 Difference]: With dead ends: 2720 [2022-07-12 17:01:08,830 INFO L226 Difference]: Without dead ends: 1402 [2022-07-12 17:01:08,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2022-07-12 17:01:08,837 INFO L413 NwaCegarLoop]: 1299 mSDtfsCounter, 1285 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 7122 mSolverCounterSat, 958 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 4259 SdHoareTripleChecker+Invalid, 8082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 958 IncrementalHoareTripleChecker+Valid, 7122 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:08,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 4259 Invalid, 8082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [958 Valid, 7122 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2022-07-12 17:01:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-07-12 17:01:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1344. [2022-07-12 17:01:08,916 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-12 17:01:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1786 transitions. [2022-07-12 17:01:08,921 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1786 transitions. Word has length 126 [2022-07-12 17:01:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:08,921 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1786 transitions. [2022-07-12 17:01:08,922 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-12 17:01:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1786 transitions. [2022-07-12 17:01:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 17:01:08,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:08,925 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-12 17:01:08,955 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-12 17:01:09,151 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-12 17:01:09,151 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-12 17:01:09,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1890159087, now seen corresponding path program 1 times [2022-07-12 17:01:09,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:09,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814534374] [2022-07-12 17:01:09,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:01:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:01:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:01:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 17:01:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:01:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:01:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 17:01:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 17:01:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 17:01:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:09,316 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-12 17:01:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:09,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814534374] [2022-07-12 17:01:09,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814534374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:09,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:09,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:01:09,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272021854] [2022-07-12 17:01:09,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:09,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:01:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:01:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:01:09,318 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-12 17:01:13,246 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-12 17:01:15,329 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-12 17:01:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:17,297 INFO L93 Difference]: Finished difference Result 2830 states and 3845 transitions. [2022-07-12 17:01:17,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:01:17,298 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-12 17:01:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:17,312 INFO L225 Difference]: With dead ends: 2830 [2022-07-12 17:01:17,312 INFO L226 Difference]: Without dead ends: 1504 [2022-07-12 17:01:17,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:01:17,319 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 1077 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 3934 mSolverCounterSat, 663 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 4599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 3934 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:17,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 2985 Invalid, 4599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 3934 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2022-07-12 17:01:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-07-12 17:01:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1348. [2022-07-12 17:01:17,404 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-12 17:01:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1790 transitions. [2022-07-12 17:01:17,409 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1790 transitions. Word has length 125 [2022-07-12 17:01:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:17,409 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1790 transitions. [2022-07-12 17:01:17,410 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-12 17:01:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1790 transitions. [2022-07-12 17:01:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 17:01:17,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:17,413 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-12 17:01:17,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 17:01:17,413 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-12 17:01:17,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash -397002125, now seen corresponding path program 1 times [2022-07-12 17:01:17,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:17,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221534990] [2022-07-12 17:01:17,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:17,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:01:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:01:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:01:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 17:01:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 17:01:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:01:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 17:01:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:01:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:01:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:01:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 17:01:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:17,857 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-12 17:01:17,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:17,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221534990] [2022-07-12 17:01:17,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221534990] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:01:17,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758908883] [2022-07-12 17:01:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:17,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:01:17,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:01:17,860 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-12 17:01:17,891 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-12 17:01:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:18,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 17:01:18,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:01:18,678 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-12 17:01:18,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:01:19,049 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-12 17:01:19,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758908883] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:01:19,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 17:01:19,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 24 [2022-07-12 17:01:19,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719818284] [2022-07-12 17:01:19,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 17:01:19,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 17:01:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:19,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 17:01:19,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-12 17:01:19,051 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-12 17:01:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:34,209 INFO L93 Difference]: Finished difference Result 2822 states and 3826 transitions. [2022-07-12 17:01:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 17:01:34,210 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-12 17:01:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:34,217 INFO L225 Difference]: With dead ends: 2822 [2022-07-12 17:01:34,217 INFO L226 Difference]: Without dead ends: 1488 [2022-07-12 17:01:34,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 17:01:34,223 INFO L413 NwaCegarLoop]: 1401 mSDtfsCounter, 1345 mSDsluCounter, 6948 mSDsCounter, 0 mSdLazyCounter, 17056 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 8349 SdHoareTripleChecker+Invalid, 17733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 17056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:34,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 8349 Invalid, 17733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [677 Valid, 17056 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2022-07-12 17:01:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-12 17:01:34,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1353. [2022-07-12 17:01:34,321 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-12 17:01:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1796 transitions. [2022-07-12 17:01:34,326 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1796 transitions. Word has length 132 [2022-07-12 17:01:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:34,326 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1796 transitions. [2022-07-12 17:01:34,326 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-12 17:01:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1796 transitions. [2022-07-12 17:01:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 17:01:34,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:34,330 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-12 17:01:34,362 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-12 17:01:34,543 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-12 17:01:34,544 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-12 17:01:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1538085832, now seen corresponding path program 1 times [2022-07-12 17:01:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:34,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135066404] [2022-07-12 17:01:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:01:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:01:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:01:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:01:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:01:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:01:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:01:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:01:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:01:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:01:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:01:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:01:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:01:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:01:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:01:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:01:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:34,683 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-12 17:01:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:34,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135066404] [2022-07-12 17:01:34,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135066404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:34,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:34,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175690761] [2022-07-12 17:01:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:34,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:34,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:34,686 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-12 17:01:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:36,664 INFO L93 Difference]: Finished difference Result 1353 states and 1796 transitions. [2022-07-12 17:01:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:36,664 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-12 17:01:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:36,670 INFO L225 Difference]: With dead ends: 1353 [2022-07-12 17:01:36,670 INFO L226 Difference]: Without dead ends: 1351 [2022-07-12 17:01:36,670 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-12 17:01:36,671 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-12 17:01:36,671 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-12 17:01:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-12 17:01:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2022-07-12 17:01:36,765 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-12 17:01:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1794 transitions. [2022-07-12 17:01:36,770 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1794 transitions. Word has length 130 [2022-07-12 17:01:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:36,770 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1794 transitions. [2022-07-12 17:01:36,770 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-12 17:01:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1794 transitions. [2022-07-12 17:01:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 17:01:36,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:36,774 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-12 17:01:36,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 17:01:36,774 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-12 17:01:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash -824114156, now seen corresponding path program 1 times [2022-07-12 17:01:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:36,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399093746] [2022-07-12 17:01:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:01:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:01:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:01:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 17:01:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:01:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:01:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:01:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 17:01:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 17:01:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:37,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 17:01:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:37,171 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-12 17:01:37,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:37,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399093746] [2022-07-12 17:01:37,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399093746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:01:37,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825140167] [2022-07-12 17:01:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:37,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:01:37,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:01:37,180 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-12 17:01:37,185 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-12 17:01:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:37,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 17:01:37,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:01:38,035 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-12 17:01:38,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:01:38,593 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-12 17:01:38,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825140167] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:01:38,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 17:01:38,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 27 [2022-07-12 17:01:38,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64082852] [2022-07-12 17:01:38,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 17:01:38,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 17:01:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 17:01:38,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2022-07-12 17:01:38,598 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-12 17:01:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:56,650 INFO L93 Difference]: Finished difference Result 2773 states and 3741 transitions. [2022-07-12 17:01:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 17:01:56,651 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-12 17:01:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:56,656 INFO L225 Difference]: With dead ends: 2773 [2022-07-12 17:01:56,656 INFO L226 Difference]: Without dead ends: 1432 [2022-07-12 17:01:56,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=718, Invalid=2362, Unknown=0, NotChecked=0, Total=3080 [2022-07-12 17:01:56,662 INFO L413 NwaCegarLoop]: 1299 mSDtfsCounter, 1358 mSDsluCounter, 4506 mSDsCounter, 0 mSdLazyCounter, 11193 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 5805 SdHoareTripleChecker+Invalid, 12205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 11193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:56,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 5805 Invalid, 12205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 11193 Invalid, 0 Unknown, 0 Unchecked, 14.8s Time] [2022-07-12 17:01:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-07-12 17:01:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1366. [2022-07-12 17:01:56,750 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-12 17:01:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1815 transitions. [2022-07-12 17:01:56,754 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1815 transitions. Word has length 137 [2022-07-12 17:01:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:56,754 INFO L495 AbstractCegarLoop]: Abstraction has 1366 states and 1815 transitions. [2022-07-12 17:01:56,755 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-12 17:01:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1815 transitions. [2022-07-12 17:01:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 17:01:56,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:56,758 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-12 17:01:56,786 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-12 17:01:56,979 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-12 17:01:56,979 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-12 17:01:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1344645454, now seen corresponding path program 1 times [2022-07-12 17:01:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283579122] [2022-07-12 17:01:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:01:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:01:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 17:01:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:01:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 17:01:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 17:01:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:01:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 17:01:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 17:01:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 17:01:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 17:01:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 17:01:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 17:01:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:01:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 17:01:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:01:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:01:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 17:01:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:57,171 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-12 17:01:57,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:57,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283579122] [2022-07-12 17:01:57,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283579122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:57,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:57,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645093164] [2022-07-12 17:01:57,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:57,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:57,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:57,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:57,173 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-12 17:01:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:59,349 INFO L93 Difference]: Finished difference Result 1366 states and 1815 transitions. [2022-07-12 17:01:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:59,350 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-12 17:01:59,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:59,354 INFO L225 Difference]: With dead ends: 1366 [2022-07-12 17:01:59,354 INFO L226 Difference]: Without dead ends: 1364 [2022-07-12 17:01:59,355 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-12 17:01:59,355 INFO L413 NwaCegarLoop]: 1334 mSDtfsCounter, 2428 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:59,355 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.0s Time] [2022-07-12 17:01:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-07-12 17:01:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2022-07-12 17:01:59,462 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-12 17:01:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1813 transitions. [2022-07-12 17:01:59,465 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1813 transitions. Word has length 136 [2022-07-12 17:01:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:59,466 INFO L495 AbstractCegarLoop]: Abstraction has 1364 states and 1813 transitions. [2022-07-12 17:01:59,466 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-12 17:01:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1813 transitions. [2022-07-12 17:01:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 17:01:59,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:59,469 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-12 17:01:59,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 17:01:59,470 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-12 17:01:59,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash 502310038, now seen corresponding path program 2 times [2022-07-12 17:01:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:59,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498772451] [2022-07-12 17:01:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:59,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:01:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:01:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 17:01:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 17:01:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:01:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:01:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 17:01:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:01:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:01:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 17:01:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:02:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:02:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:00,191 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-12 17:02:00,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:00,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498772451] [2022-07-12 17:02:00,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498772451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:02:00,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441998317] [2022-07-12 17:02:00,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 17:02:00,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:02:00,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:02:00,196 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-12 17:02:00,227 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-12 17:02:00,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 17:02:00,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 17:02:00,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 17:02:00,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:02:01,516 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-12 17:02:01,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:02:03,602 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-12 17:02:03,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441998317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:02:03,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 17:02:03,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 48 [2022-07-12 17:02:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036724255] [2022-07-12 17:02:03,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 17:02:03,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-12 17:02:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:03,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-12 17:02:03,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1769, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 17:02:03,605 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-12 17:02:29,110 WARN L233 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 92 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 17:02:42,436 WARN L233 SmtUtils]: Spent 5.28s 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-12 17:03:42,751 WARN L233 SmtUtils]: Spent 26.69s 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)