./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--usb--misc--yurex.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--usb--misc--yurex.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 1df63cbd0336246e03c8a08fdd7cd62b20ae4ea405c1b7aaed1bb78f9f0fa189 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:10:46,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:10:46,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:10:46,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:10:46,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:10:46,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:10:46,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:10:46,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:10:46,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:10:46,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:10:46,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:10:46,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:10:46,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:10:46,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:10:46,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:10:46,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:10:46,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:10:46,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:10:46,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:10:46,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:10:46,779 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:10:46,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:10:46,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:10:46,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:10:46,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:10:46,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:10:46,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:10:46,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:10:46,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:10:46,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:10:46,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:10:46,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:10:46,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:10:46,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:10:46,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:10:46,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:10:46,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:10:46,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:10:46,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:10:46,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:10:46,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:10:46,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:10:46,799 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:10:46,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:10:46,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:10:46,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:10:46,835 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:10:46,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:10:46,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:10:46,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:10:46,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:10:46,837 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:10:46,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:10:46,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:10:46,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:10:46,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:10:46,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:10:46,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:10:46,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:10:46,839 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:10:46,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:10:46,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:10:46,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:10:46,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:10:46,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:10:46,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:10:46,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:10:46,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:10:46,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:10:46,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:10:46,841 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:10:46,841 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:10:46,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:10:46,842 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 -> 1df63cbd0336246e03c8a08fdd7cd62b20ae4ea405c1b7aaed1bb78f9f0fa189 [2022-07-12 17:10:47,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:10:47,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:10:47,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:10:47,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:10:47,139 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:10:47,141 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--usb--misc--yurex.ko.cil.i [2022-07-12 17:10:47,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffee7f5c9/abb5bc23f4bb46468425853068717132/FLAG51298e71e [2022-07-12 17:10:47,920 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:10:47,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2022-07-12 17:10:47,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffee7f5c9/abb5bc23f4bb46468425853068717132/FLAG51298e71e [2022-07-12 17:10:48,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffee7f5c9/abb5bc23f4bb46468425853068717132 [2022-07-12 17:10:48,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:10:48,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:10:48,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:10:48,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:10:48,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:10:48,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:10:48" (1/1) ... [2022-07-12 17:10:48,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e99a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:48, skipping insertion in model container [2022-07-12 17:10:48,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:10:48" (1/1) ... [2022-07-12 17:10:48,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:10:48,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:10:50,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259112,259125] [2022-07-12 17:10:50,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259257,259270] [2022-07-12 17:10:50,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259403,259416] [2022-07-12 17:10:50,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259568,259581] [2022-07-12 17:10:50,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259726,259739] [2022-07-12 17:10:50,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259884,259897] [2022-07-12 17:10:50,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260042,260055] [2022-07-12 17:10:50,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260202,260215] [2022-07-12 17:10:50,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260361,260374] [2022-07-12 17:10:50,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260500,260513] [2022-07-12 17:10:50,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260642,260655] [2022-07-12 17:10:50,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260791,260804] [2022-07-12 17:10:50,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260930,260943] [2022-07-12 17:10:50,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261085,261098] [2022-07-12 17:10:50,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261245,261258] [2022-07-12 17:10:50,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261396,261409] [2022-07-12 17:10:50,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261547,261560] [2022-07-12 17:10:50,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261699,261712] [2022-07-12 17:10:50,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261848,261861] [2022-07-12 17:10:50,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261996,262009] [2022-07-12 17:10:50,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262153,262166] [2022-07-12 17:10:50,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262302,262315] [2022-07-12 17:10:50,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262458,262471] [2022-07-12 17:10:50,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262611,262624] [2022-07-12 17:10:50,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262757,262770] [2022-07-12 17:10:50,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262900,262913] [2022-07-12 17:10:50,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263052,263065] [2022-07-12 17:10:50,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263198,263211] [2022-07-12 17:10:50,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263343,263356] [2022-07-12 17:10:50,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263497,263510] [2022-07-12 17:10:50,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263648,263661] [2022-07-12 17:10:50,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263803,263816] [2022-07-12 17:10:50,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263955,263968] [2022-07-12 17:10:50,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264110,264123] [2022-07-12 17:10:50,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264274,264287] [2022-07-12 17:10:50,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264430,264443] [2022-07-12 17:10:50,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264594,264607] [2022-07-12 17:10:50,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264736,264749] [2022-07-12 17:10:50,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264894,264907] [2022-07-12 17:10:50,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265061,265074] [2022-07-12 17:10:50,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265220,265233] [2022-07-12 17:10:50,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265379,265392] [2022-07-12 17:10:50,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265528,265541] [2022-07-12 17:10:50,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265675,265688] [2022-07-12 17:10:50,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265814,265827] [2022-07-12 17:10:50,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265977,265990] [2022-07-12 17:10:50,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266143,266156] [2022-07-12 17:10:50,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266307,266320] [2022-07-12 17:10:50,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266472,266485] [2022-07-12 17:10:50,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266637,266650] [2022-07-12 17:10:50,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266803,266816] [2022-07-12 17:10:50,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266968,266981] [2022-07-12 17:10:50,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267135,267148] [2022-07-12 17:10:50,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267295,267308] [2022-07-12 17:10:50,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267457,267470] [2022-07-12 17:10:50,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267616,267629] [2022-07-12 17:10:50,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267762,267775] [2022-07-12 17:10:50,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267905,267918] [2022-07-12 17:10:50,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268049,268062] [2022-07-12 17:10:50,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268192,268205] [2022-07-12 17:10:50,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268336,268349] [2022-07-12 17:10:50,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268477,268490] [2022-07-12 17:10:50,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268615,268628] [2022-07-12 17:10:50,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268773,268786] [2022-07-12 17:10:50,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268932,268945] [2022-07-12 17:10:50,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269088,269101] [2022-07-12 17:10:50,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269237,269250] [2022-07-12 17:10:50,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269389,269402] [2022-07-12 17:10:50,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269540,269553] [2022-07-12 17:10:50,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269689,269702] [2022-07-12 17:10:50,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269841,269854] [2022-07-12 17:10:50,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269989,270002] [2022-07-12 17:10:50,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270142,270155] [2022-07-12 17:10:50,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270293,270306] [2022-07-12 17:10:50,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270443,270456] [2022-07-12 17:10:50,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270590,270603] [2022-07-12 17:10:50,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270741,270754] [2022-07-12 17:10:50,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270892,270905] [2022-07-12 17:10:50,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271040,271053] [2022-07-12 17:10:50,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271206,271219] [2022-07-12 17:10:50,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271375,271388] [2022-07-12 17:10:50,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271542,271555] [2022-07-12 17:10:50,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271710,271723] [2022-07-12 17:10:50,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271860,271873] [2022-07-12 17:10:50,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272007,272020] [2022-07-12 17:10:50,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272168,272181] [2022-07-12 17:10:50,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272338,272351] [2022-07-12 17:10:50,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272500,272513] [2022-07-12 17:10:50,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:10:50,209 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:10:50,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--usb--misc--yurex.ko.cil.i[259112,259125] [2022-07-12 17:10:50,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259257,259270] [2022-07-12 17:10:50,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259403,259416] [2022-07-12 17:10:50,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259568,259581] [2022-07-12 17:10:50,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259726,259739] [2022-07-12 17:10:50,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259884,259897] [2022-07-12 17:10:50,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260042,260055] [2022-07-12 17:10:50,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260202,260215] [2022-07-12 17:10:50,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260361,260374] [2022-07-12 17:10:50,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260500,260513] [2022-07-12 17:10:50,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260642,260655] [2022-07-12 17:10:50,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260791,260804] [2022-07-12 17:10:50,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260930,260943] [2022-07-12 17:10:50,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261085,261098] [2022-07-12 17:10:50,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261245,261258] [2022-07-12 17:10:50,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261396,261409] [2022-07-12 17:10:50,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261547,261560] [2022-07-12 17:10:50,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261699,261712] [2022-07-12 17:10:50,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261848,261861] [2022-07-12 17:10:50,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261996,262009] [2022-07-12 17:10:50,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262153,262166] [2022-07-12 17:10:50,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262302,262315] [2022-07-12 17:10:50,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262458,262471] [2022-07-12 17:10:50,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262611,262624] [2022-07-12 17:10:50,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262757,262770] [2022-07-12 17:10:50,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262900,262913] [2022-07-12 17:10:50,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263052,263065] [2022-07-12 17:10:50,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263198,263211] [2022-07-12 17:10:50,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263343,263356] [2022-07-12 17:10:50,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263497,263510] [2022-07-12 17:10:50,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263648,263661] [2022-07-12 17:10:50,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263803,263816] [2022-07-12 17:10:50,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263955,263968] [2022-07-12 17:10:50,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264110,264123] [2022-07-12 17:10:50,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264274,264287] [2022-07-12 17:10:50,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264430,264443] [2022-07-12 17:10:50,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264594,264607] [2022-07-12 17:10:50,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264736,264749] [2022-07-12 17:10:50,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264894,264907] [2022-07-12 17:10:50,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265061,265074] [2022-07-12 17:10:50,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265220,265233] [2022-07-12 17:10:50,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265379,265392] [2022-07-12 17:10:50,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265528,265541] [2022-07-12 17:10:50,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265675,265688] [2022-07-12 17:10:50,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265814,265827] [2022-07-12 17:10:50,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265977,265990] [2022-07-12 17:10:50,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266143,266156] [2022-07-12 17:10:50,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266307,266320] [2022-07-12 17:10:50,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266472,266485] [2022-07-12 17:10:50,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266637,266650] [2022-07-12 17:10:50,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266803,266816] [2022-07-12 17:10:50,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266968,266981] [2022-07-12 17:10:50,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267135,267148] [2022-07-12 17:10:50,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267295,267308] [2022-07-12 17:10:50,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267457,267470] [2022-07-12 17:10:50,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267616,267629] [2022-07-12 17:10:50,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267762,267775] [2022-07-12 17:10:50,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267905,267918] [2022-07-12 17:10:50,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268049,268062] [2022-07-12 17:10:50,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268192,268205] [2022-07-12 17:10:50,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268336,268349] [2022-07-12 17:10:50,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268477,268490] [2022-07-12 17:10:50,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268615,268628] [2022-07-12 17:10:50,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268773,268786] [2022-07-12 17:10:50,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268932,268945] [2022-07-12 17:10:50,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269088,269101] [2022-07-12 17:10:50,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269237,269250] [2022-07-12 17:10:50,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269389,269402] [2022-07-12 17:10:50,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269540,269553] [2022-07-12 17:10:50,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269689,269702] [2022-07-12 17:10:50,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269841,269854] [2022-07-12 17:10:50,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269989,270002] [2022-07-12 17:10:50,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270142,270155] [2022-07-12 17:10:50,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270293,270306] [2022-07-12 17:10:50,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270443,270456] [2022-07-12 17:10:50,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270590,270603] [2022-07-12 17:10:50,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270741,270754] [2022-07-12 17:10:50,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270892,270905] [2022-07-12 17:10:50,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271040,271053] [2022-07-12 17:10:50,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271206,271219] [2022-07-12 17:10:50,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271375,271388] [2022-07-12 17:10:50,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271542,271555] [2022-07-12 17:10:50,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271710,271723] [2022-07-12 17:10:50,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271860,271873] [2022-07-12 17:10:50,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272007,272020] [2022-07-12 17:10:50,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272168,272181] [2022-07-12 17:10:50,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272338,272351] [2022-07-12 17:10:50,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272500,272513] [2022-07-12 17:10:50,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:10:50,581 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:10:50,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50 WrapperNode [2022-07-12 17:10:50,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:10:50,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:10:50,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:10:50,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:10:50,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:50,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:50,812 INFO L137 Inliner]: procedures = 508, calls = 1237, calls flagged for inlining = 228, calls inlined = 154, statements flattened = 2697 [2022-07-12 17:10:50,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:10:50,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:10:50,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:10:50,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:10:50,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:50,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:50,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:50,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:50,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:50,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:50,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:51,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:10:51,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:10:51,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:10:51,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:10:51,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (1/1) ... [2022-07-12 17:10:51,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:10:51,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:10:51,036 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 17:10:51,062 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 17:10:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:10:51,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:10:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 17:10:51,095 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 17:10:51,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:10:51,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:10:51,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:10:51,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:10:51,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 17:10:51,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 17:10:51,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2022-07-12 17:10:51,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2022-07-12 17:10:51,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:10:51,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:10:51,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:10:51,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:10:51,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:10:51,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:10:51,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:10:51,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:10:51,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:10:51,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:10:51,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:10:51,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:10:51,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:10:51,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:10:51,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:10:51,098 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 17:10:51,098 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 17:10:51,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 17:10:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:10:51,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:10:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:10:51,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:10:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:10:51,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:10:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:10:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:10:51,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:10:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 17:10:51,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 17:10:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:10:51,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:10:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 17:10:51,100 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 17:10:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:10:51,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:10:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:10:51,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:10:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-12 17:10:51,100 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-12 17:10:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:10:51,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:10:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:10:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:10:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:10:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:10:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:10:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 17:10:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:10:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 17:10:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 17:10:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 17:10:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:10:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:10:51,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 17:10:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 17:10:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2022-07-12 17:10:51,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2022-07-12 17:10:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 17:10:51,102 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 17:10:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:10:51,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:10:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:10:51,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:10:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-12 17:10:51,102 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-12 17:10:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-07-12 17:10:51,102 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-07-12 17:10:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:10:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:10:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:10:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:10:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 17:10:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 17:10:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:10:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:10:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 17:10:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 17:10:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:10:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:10:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:10:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:10:51,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:10:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:10:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 17:10:51,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 17:10:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_101 [2022-07-12 17:10:51,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_101 [2022-07-12 17:10:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:10:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 17:10:51,108 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 17:10:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:10:51,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:10:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 17:10:51,108 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 17:10:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:10:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:10:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 17:10:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 17:10:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 17:10:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 17:10:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 17:10:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 17:10:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:10:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:10:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:10:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:10:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:10:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:10:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:10:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:10:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 17:10:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 17:10:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:10:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:10:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2022-07-12 17:10:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2022-07-12 17:10:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 17:10:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 17:10:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:10:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:10:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2022-07-12 17:10:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2022-07-12 17:10:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:10:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:10:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:10:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:10:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:10:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:10:51,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:10:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-12 17:10:51,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-12 17:10:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:10:51,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:10:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:10:51,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:10:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:10:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure yurex_disconnect [2022-07-12 17:10:51,115 INFO L138 BoogieDeclarations]: Found implementation of procedure yurex_disconnect [2022-07-12 17:10:51,644 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:10:51,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:10:52,017 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:10:54,171 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:10:54,183 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:10:54,184 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 17:10:54,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:10:54 BoogieIcfgContainer [2022-07-12 17:10:54,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:10:54,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:10:54,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:10:54,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:10:54,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:10:48" (1/3) ... [2022-07-12 17:10:54,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f76fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:10:54, skipping insertion in model container [2022-07-12 17:10:54,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:10:50" (2/3) ... [2022-07-12 17:10:54,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f76fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:10:54, skipping insertion in model container [2022-07-12 17:10:54,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:10:54" (3/3) ... [2022-07-12 17:10:54,194 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2022-07-12 17:10:54,206 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:10:54,207 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-12 17:10:54,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:10:54,304 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@93b62fb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c8b6c6f [2022-07-12 17:10:54,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-12 17:10:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 976 states, 651 states have (on average 1.294930875576037) internal successors, (843), 702 states have internal predecessors, (843), 224 states have call successors, (224), 68 states have call predecessors, (224), 67 states have return successors, (219), 216 states have call predecessors, (219), 219 states have call successors, (219) [2022-07-12 17:10:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 17:10:54,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:54,324 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:10:54,325 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 31 more)] === [2022-07-12 17:10:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash 150450018, now seen corresponding path program 1 times [2022-07-12 17:10:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:54,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797625726] [2022-07-12 17:10:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:10:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:10:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:10:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:10:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:10:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:10:55,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:55,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797625726] [2022-07-12 17:10:55,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797625726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:55,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:55,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:10:55,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322784386] [2022-07-12 17:10:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:55,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:10:55,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:55,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:10:55,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:10:55,040 INFO L87 Difference]: Start difference. First operand has 976 states, 651 states have (on average 1.294930875576037) internal successors, (843), 702 states have internal predecessors, (843), 224 states have call successors, (224), 68 states have call predecessors, (224), 67 states have return successors, (219), 216 states have call predecessors, (219), 219 states have call successors, (219) 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, (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:10:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:57,039 INFO L93 Difference]: Finished difference Result 1903 states and 2593 transitions. [2022-07-12 17:10:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:10:57,041 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, (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 71 [2022-07-12 17:10:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:57,057 INFO L225 Difference]: With dead ends: 1903 [2022-07-12 17:10:57,057 INFO L226 Difference]: Without dead ends: 957 [2022-07-12 17:10:57,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:10:57,071 INFO L413 NwaCegarLoop]: 1185 mSDtfsCounter, 1754 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:57,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 2531 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 17:10:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-07-12 17:10:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2022-07-12 17:10:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 640 states have (on average 1.2328125) internal successors, (789), 686 states have internal predecessors, (789), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:10:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1225 transitions. [2022-07-12 17:10:57,171 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1225 transitions. Word has length 71 [2022-07-12 17:10:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:57,173 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1225 transitions. [2022-07-12 17:10:57,173 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, (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:10:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1225 transitions. [2022-07-12 17:10:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 17:10:57,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:57,176 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:10:57,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:10:57,177 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 31 more)] === [2022-07-12 17:10:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash 395296491, now seen corresponding path program 1 times [2022-07-12 17:10:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:57,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009437785] [2022-07-12 17:10:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:10:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:10:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:10:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:10:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:10:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:10:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:10:57,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:57,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009437785] [2022-07-12 17:10:57,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009437785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:57,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:57,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:10:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006368999] [2022-07-12 17:10:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:57,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:10:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:57,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:10:57,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:10:57,457 INFO L87 Difference]: Start difference. First operand 957 states and 1225 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, (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:10:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:10:59,289 INFO L93 Difference]: Finished difference Result 957 states and 1225 transitions. [2022-07-12 17:10:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:10:59,290 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, (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 77 [2022-07-12 17:10:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:10:59,296 INFO L225 Difference]: With dead ends: 957 [2022-07-12 17:10:59,296 INFO L226 Difference]: Without dead ends: 955 [2022-07-12 17:10:59,297 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:10:59,298 INFO L413 NwaCegarLoop]: 1165 mSDtfsCounter, 1720 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1871 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:10:59,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1871 Valid, 2491 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 17:10:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-07-12 17:10:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-07-12 17:10:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 639 states have (on average 1.2316118935837246) internal successors, (787), 684 states have internal predecessors, (787), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:10:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1223 transitions. [2022-07-12 17:10:59,349 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1223 transitions. Word has length 77 [2022-07-12 17:10:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:10:59,349 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1223 transitions. [2022-07-12 17:10:59,350 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, (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:10:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1223 transitions. [2022-07-12 17:10:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 17:10:59,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:10:59,352 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:10:59,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:10:59,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:10:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:10:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1728180818, now seen corresponding path program 1 times [2022-07-12 17:10:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:10:59,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555735713] [2022-07-12 17:10:59,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:10:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:10:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:10:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:10:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:10:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:10:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:10:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:10:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:10:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:10:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:10:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:10:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:10:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:10:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:10:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:10:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:10:59,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555735713] [2022-07-12 17:10:59,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555735713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:10:59,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:10:59,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:10:59,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556482109] [2022-07-12 17:10:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:10:59,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:10:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:10:59,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:10:59,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:10:59,590 INFO L87 Difference]: Start difference. First operand 955 states and 1223 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, (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:11:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:01,328 INFO L93 Difference]: Finished difference Result 955 states and 1223 transitions. [2022-07-12 17:11:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:01,328 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, (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 83 [2022-07-12 17:11:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:01,336 INFO L225 Difference]: With dead ends: 955 [2022-07-12 17:11:01,336 INFO L226 Difference]: Without dead ends: 953 [2022-07-12 17:11:01,337 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:11:01,338 INFO L413 NwaCegarLoop]: 1163 mSDtfsCounter, 1714 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:01,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 2489 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 17:11:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-12 17:11:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2022-07-12 17:11:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 638 states have (on average 1.2304075235109717) internal successors, (785), 682 states have internal predecessors, (785), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1221 transitions. [2022-07-12 17:11:01,379 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1221 transitions. Word has length 83 [2022-07-12 17:11:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:01,380 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1221 transitions. [2022-07-12 17:11:01,380 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, (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:11:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1221 transitions. [2022-07-12 17:11:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 17:11:01,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:01,382 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:01,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:11:01,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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 31 more)] === [2022-07-12 17:11:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2012755007, now seen corresponding path program 1 times [2022-07-12 17:11:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:01,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652497226] [2022-07-12 17:11:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:01,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:01,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652497226] [2022-07-12 17:11:01,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652497226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:01,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:01,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086313516] [2022-07-12 17:11:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:01,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:01,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:01,592 INFO L87 Difference]: Start difference. First operand 953 states and 1221 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, (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:11:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:03,362 INFO L93 Difference]: Finished difference Result 953 states and 1221 transitions. [2022-07-12 17:11:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:03,362 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, (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 89 [2022-07-12 17:11:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:03,368 INFO L225 Difference]: With dead ends: 953 [2022-07-12 17:11:03,368 INFO L226 Difference]: Without dead ends: 951 [2022-07-12 17:11:03,369 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:11:03,369 INFO L413 NwaCegarLoop]: 1161 mSDtfsCounter, 1708 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:03,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 2487 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 17:11:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-07-12 17:11:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2022-07-12 17:11:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 637 states have (on average 1.2291993720565149) internal successors, (783), 680 states have internal predecessors, (783), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1219 transitions. [2022-07-12 17:11:03,407 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1219 transitions. Word has length 89 [2022-07-12 17:11:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:03,408 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1219 transitions. [2022-07-12 17:11:03,408 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, (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:11:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1219 transitions. [2022-07-12 17:11:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 17:11:03,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:03,410 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:03,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:11:03,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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 31 more)] === [2022-07-12 17:11:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1710267306, now seen corresponding path program 1 times [2022-07-12 17:11:03,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:03,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153257489] [2022-07-12 17:11:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:03,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:03,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153257489] [2022-07-12 17:11:03,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153257489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:03,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:03,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824990840] [2022-07-12 17:11:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:03,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:03,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:03,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:03,652 INFO L87 Difference]: Start difference. First operand 951 states and 1219 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, (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:11:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:05,254 INFO L93 Difference]: Finished difference Result 951 states and 1219 transitions. [2022-07-12 17:11:05,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:05,255 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, (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 95 [2022-07-12 17:11:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:05,260 INFO L225 Difference]: With dead ends: 951 [2022-07-12 17:11:05,260 INFO L226 Difference]: Without dead ends: 949 [2022-07-12 17:11:05,261 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:11:05,262 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 1702 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:05,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 2485 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:11:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2022-07-12 17:11:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2022-07-12 17:11:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 636 states have (on average 1.2279874213836477) internal successors, (781), 678 states have internal predecessors, (781), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1217 transitions. [2022-07-12 17:11:05,299 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1217 transitions. Word has length 95 [2022-07-12 17:11:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:05,301 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1217 transitions. [2022-07-12 17:11:05,301 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, (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:11:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1217 transitions. [2022-07-12 17:11:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 17:11:05,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:05,303 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:05,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:11:05,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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 31 more)] === [2022-07-12 17:11:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1309820457, now seen corresponding path program 1 times [2022-07-12 17:11:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:05,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328910282] [2022-07-12 17:11:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:05,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328910282] [2022-07-12 17:11:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328910282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:05,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:05,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895286282] [2022-07-12 17:11:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:05,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:05,505 INFO L87 Difference]: Start difference. First operand 949 states and 1217 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, (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:11:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:07,144 INFO L93 Difference]: Finished difference Result 949 states and 1217 transitions. [2022-07-12 17:11:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:07,144 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, (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 101 [2022-07-12 17:11:07,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:07,149 INFO L225 Difference]: With dead ends: 949 [2022-07-12 17:11:07,149 INFO L226 Difference]: Without dead ends: 947 [2022-07-12 17:11:07,150 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:11:07,151 INFO L413 NwaCegarLoop]: 1157 mSDtfsCounter, 1696 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:07,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 2483 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:11:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-12 17:11:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2022-07-12 17:11:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 635 states have (on average 1.226771653543307) internal successors, (779), 676 states have internal predecessors, (779), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1215 transitions. [2022-07-12 17:11:07,205 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1215 transitions. Word has length 101 [2022-07-12 17:11:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:07,206 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1215 transitions. [2022-07-12 17:11:07,206 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, (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:11:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1215 transitions. [2022-07-12 17:11:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 17:11:07,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:07,209 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:11:07,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:11:07,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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 31 more)] === [2022-07-12 17:11:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:07,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1917796044, now seen corresponding path program 1 times [2022-07-12 17:11:07,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:07,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789910383] [2022-07-12 17:11:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:07,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:07,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789910383] [2022-07-12 17:11:07,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789910383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:07,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:07,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166954532] [2022-07-12 17:11:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:07,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:07,417 INFO L87 Difference]: Start difference. First operand 947 states and 1215 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:11:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:09,177 INFO L93 Difference]: Finished difference Result 947 states and 1215 transitions. [2022-07-12 17:11:09,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:09,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 107 [2022-07-12 17:11:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:09,183 INFO L225 Difference]: With dead ends: 947 [2022-07-12 17:11:09,183 INFO L226 Difference]: Without dead ends: 945 [2022-07-12 17:11:09,183 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:11:09,184 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 1690 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:09,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 2481 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 17:11:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-12 17:11:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2022-07-12 17:11:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 634 states have (on average 1.225552050473186) internal successors, (777), 674 states have internal predecessors, (777), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1213 transitions. [2022-07-12 17:11:09,227 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1213 transitions. Word has length 107 [2022-07-12 17:11:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:09,227 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1213 transitions. [2022-07-12 17:11:09,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:11:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1213 transitions. [2022-07-12 17:11:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 17:11:09,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:09,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:11:09,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:11:09,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 31 more)] === [2022-07-12 17:11:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash -334687362, now seen corresponding path program 1 times [2022-07-12 17:11:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:09,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696584971] [2022-07-12 17:11:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:09,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:09,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696584971] [2022-07-12 17:11:09,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696584971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:09,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:09,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567665801] [2022-07-12 17:11:09,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:09,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:09,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:09,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:09,471 INFO L87 Difference]: Start difference. First operand 945 states and 1213 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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:11:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:11,045 INFO L93 Difference]: Finished difference Result 945 states and 1213 transitions. [2022-07-12 17:11:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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 113 [2022-07-12 17:11:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:11,051 INFO L225 Difference]: With dead ends: 945 [2022-07-12 17:11:11,051 INFO L226 Difference]: Without dead ends: 943 [2022-07-12 17:11:11,052 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:11:11,053 INFO L413 NwaCegarLoop]: 1153 mSDtfsCounter, 1688 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1833 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:11,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1833 Valid, 2479 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:11:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-07-12 17:11:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2022-07-12 17:11:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 633 states have (on average 1.2243285939968405) internal successors, (775), 672 states have internal predecessors, (775), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1211 transitions. [2022-07-12 17:11:11,094 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1211 transitions. Word has length 113 [2022-07-12 17:11:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:11,095 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1211 transitions. [2022-07-12 17:11:11,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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:11:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1211 transitions. [2022-07-12 17:11:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 17:11:11,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:11,097 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:11,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:11:11,097 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 31 more)] === [2022-07-12 17:11:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash 488135713, now seen corresponding path program 1 times [2022-07-12 17:11:11,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:11,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715236669] [2022-07-12 17:11:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:11,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715236669] [2022-07-12 17:11:11,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715236669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:11,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:11,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501833844] [2022-07-12 17:11:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:11,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:11,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:11,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:11,269 INFO L87 Difference]: Start difference. First operand 943 states and 1211 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, (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:11:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:12,915 INFO L93 Difference]: Finished difference Result 943 states and 1211 transitions. [2022-07-12 17:11:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:12,915 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, (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 115 [2022-07-12 17:11:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:12,920 INFO L225 Difference]: With dead ends: 943 [2022-07-12 17:11:12,920 INFO L226 Difference]: Without dead ends: 941 [2022-07-12 17:11:12,920 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:11:12,921 INFO L413 NwaCegarLoop]: 1151 mSDtfsCounter, 1676 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:12,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 2477 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:11:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-12 17:11:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2022-07-12 17:11:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 632 states have (on average 1.2231012658227849) internal successors, (773), 670 states have internal predecessors, (773), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1209 transitions. [2022-07-12 17:11:12,959 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1209 transitions. Word has length 115 [2022-07-12 17:11:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:12,960 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1209 transitions. [2022-07-12 17:11:12,960 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, (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:11:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1209 transitions. [2022-07-12 17:11:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 17:11:12,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:12,962 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:12,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:11:12,962 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 31 more)] === [2022-07-12 17:11:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1281926017, now seen corresponding path program 1 times [2022-07-12 17:11:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:12,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798437777] [2022-07-12 17:11:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:13,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:13,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798437777] [2022-07-12 17:11:13,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798437777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:13,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:13,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290493506] [2022-07-12 17:11:13,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:13,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:13,141 INFO L87 Difference]: Start difference. First operand 941 states and 1209 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, (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:11:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:14,823 INFO L93 Difference]: Finished difference Result 941 states and 1209 transitions. [2022-07-12 17:11:14,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:14,824 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, (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 121 [2022-07-12 17:11:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:14,829 INFO L225 Difference]: With dead ends: 941 [2022-07-12 17:11:14,829 INFO L226 Difference]: Without dead ends: 939 [2022-07-12 17:11:14,830 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:11:14,830 INFO L413 NwaCegarLoop]: 1149 mSDtfsCounter, 1672 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:14,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 2475 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 17:11:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-12 17:11:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2022-07-12 17:11:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 631 states have (on average 1.2218700475435815) internal successors, (771), 668 states have internal predecessors, (771), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1207 transitions. [2022-07-12 17:11:14,889 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1207 transitions. Word has length 121 [2022-07-12 17:11:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:14,890 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1207 transitions. [2022-07-12 17:11:14,890 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, (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:11:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1207 transitions. [2022-07-12 17:11:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 17:11:14,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:14,892 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:14,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:11:14,892 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 31 more)] === [2022-07-12 17:11:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1200561438, now seen corresponding path program 1 times [2022-07-12 17:11:14,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:14,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023777448] [2022-07-12 17:11:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:15,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:15,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023777448] [2022-07-12 17:11:15,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023777448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:15,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:15,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740496315] [2022-07-12 17:11:15,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:15,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:15,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:15,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:15,151 INFO L87 Difference]: Start difference. First operand 939 states and 1207 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, (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:11:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:16,863 INFO L93 Difference]: Finished difference Result 939 states and 1207 transitions. [2022-07-12 17:11:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:16,863 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, (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 127 [2022-07-12 17:11:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:16,868 INFO L225 Difference]: With dead ends: 939 [2022-07-12 17:11:16,868 INFO L226 Difference]: Without dead ends: 937 [2022-07-12 17:11:16,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:11:16,869 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 1666 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:16,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 2473 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 17:11:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-07-12 17:11:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2022-07-12 17:11:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 630 states have (on average 1.2206349206349207) internal successors, (769), 666 states have internal predecessors, (769), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1205 transitions. [2022-07-12 17:11:16,912 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1205 transitions. Word has length 127 [2022-07-12 17:11:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:16,912 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1205 transitions. [2022-07-12 17:11:16,913 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, (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:11:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1205 transitions. [2022-07-12 17:11:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 17:11:16,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:16,915 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:11:16,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:11:16,915 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1108051758, now seen corresponding path program 1 times [2022-07-12 17:11:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:16,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729434118] [2022-07-12 17:11:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:16,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:11:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:11:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:11:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:11:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:11:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:11:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 17:11:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:11:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:11:17,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729434118] [2022-07-12 17:11:17,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729434118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:17,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:17,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:11:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816466113] [2022-07-12 17:11:17,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:17,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:11:17,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:11:17,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:11:17,243 INFO L87 Difference]: Start difference. First operand 937 states and 1205 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:11:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:20,247 INFO L93 Difference]: Finished difference Result 1858 states and 2401 transitions. [2022-07-12 17:11:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:11:20,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2022-07-12 17:11:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:20,253 INFO L225 Difference]: With dead ends: 1858 [2022-07-12 17:11:20,254 INFO L226 Difference]: Without dead ends: 961 [2022-07-12 17:11:20,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:11:20,257 INFO L413 NwaCegarLoop]: 1141 mSDtfsCounter, 1961 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 2852 mSolverCounterSat, 938 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 3789 SdHoareTripleChecker+Invalid, 3790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 938 IncrementalHoareTripleChecker+Valid, 2852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:20,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 3789 Invalid, 3790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [938 Valid, 2852 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-12 17:11:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-07-12 17:11:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 937. [2022-07-12 17:11:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 630 states have (on average 1.2190476190476192) internal successors, (768), 666 states have internal predecessors, (768), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1204 transitions. [2022-07-12 17:11:20,306 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1204 transitions. Word has length 171 [2022-07-12 17:11:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:20,307 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1204 transitions. [2022-07-12 17:11:20,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:11:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1204 transitions. [2022-07-12 17:11:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 17:11:20,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:20,309 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:11:20,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:11:20,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:20,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:20,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1107992176, now seen corresponding path program 1 times [2022-07-12 17:11:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:20,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696848354] [2022-07-12 17:11:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:20,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:11:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:11:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:11:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:11:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:11:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:11:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 17:11:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:11:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:11:20,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:20,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696848354] [2022-07-12 17:11:20,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696848354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:20,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:20,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:11:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069010346] [2022-07-12 17:11:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:20,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:11:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:11:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:11:20,576 INFO L87 Difference]: Start difference. First operand 937 states and 1204 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 17:11:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:22,896 INFO L93 Difference]: Finished difference Result 961 states and 1238 transitions. [2022-07-12 17:11:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:11:22,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 171 [2022-07-12 17:11:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:22,901 INFO L225 Difference]: With dead ends: 961 [2022-07-12 17:11:22,902 INFO L226 Difference]: Without dead ends: 959 [2022-07-12 17:11:22,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:11:22,903 INFO L413 NwaCegarLoop]: 1141 mSDtfsCounter, 1045 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:22,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 3400 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 17:11:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-12 17:11:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 935. [2022-07-12 17:11:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 629 states have (on average 1.217806041335453) internal successors, (766), 664 states have internal predecessors, (766), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1202 transitions. [2022-07-12 17:11:22,949 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1202 transitions. Word has length 171 [2022-07-12 17:11:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:22,949 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1202 transitions. [2022-07-12 17:11:22,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 17:11:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1202 transitions. [2022-07-12 17:11:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 17:11:22,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:22,951 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:22,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:11:22,952 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 31 more)] === [2022-07-12 17:11:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1944874354, now seen corresponding path program 1 times [2022-07-12 17:11:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:22,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379494795] [2022-07-12 17:11:22,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:22,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:23,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379494795] [2022-07-12 17:11:23,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379494795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:23,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:23,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540038030] [2022-07-12 17:11:23,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:23,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:23,153 INFO L87 Difference]: Start difference. First operand 935 states and 1202 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, (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:11:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:24,796 INFO L93 Difference]: Finished difference Result 935 states and 1202 transitions. [2022-07-12 17:11:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:24,796 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, (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 133 [2022-07-12 17:11:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:24,801 INFO L225 Difference]: With dead ends: 935 [2022-07-12 17:11:24,801 INFO L226 Difference]: Without dead ends: 933 [2022-07-12 17:11:24,802 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:11:24,802 INFO L413 NwaCegarLoop]: 1142 mSDtfsCounter, 1651 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:24,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 2468 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:11:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-07-12 17:11:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2022-07-12 17:11:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 628 states have (on average 1.21656050955414) internal successors, (764), 662 states have internal predecessors, (764), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1200 transitions. [2022-07-12 17:11:24,849 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1200 transitions. Word has length 133 [2022-07-12 17:11:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:24,849 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1200 transitions. [2022-07-12 17:11:24,850 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, (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:11:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1200 transitions. [2022-07-12 17:11:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-12 17:11:24,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:24,852 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:11:24,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:11:24,852 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 157610685, now seen corresponding path program 1 times [2022-07-12 17:11:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:24,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337461529] [2022-07-12 17:11:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:11:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:11:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:11:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:11:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:11:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:11:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 17:11:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 17:11:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:11:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:25,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337461529] [2022-07-12 17:11:25,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337461529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:25,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:25,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018474562] [2022-07-12 17:11:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:25,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:25,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:25,133 INFO L87 Difference]: Start difference. First operand 933 states and 1200 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:11:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:26,802 INFO L93 Difference]: Finished difference Result 1846 states and 2387 transitions. [2022-07-12 17:11:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:26,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 178 [2022-07-12 17:11:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:26,807 INFO L225 Difference]: With dead ends: 1846 [2022-07-12 17:11:26,807 INFO L226 Difference]: Without dead ends: 953 [2022-07-12 17:11:26,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:11:26,810 INFO L413 NwaCegarLoop]: 1134 mSDtfsCounter, 1922 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:26,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 2287 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 17:11:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-12 17:11:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 929. [2022-07-12 17:11:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 625 states have (on average 1.2144) internal successors, (759), 658 states have internal predecessors, (759), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1195 transitions. [2022-07-12 17:11:26,856 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1195 transitions. Word has length 178 [2022-07-12 17:11:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:26,857 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1195 transitions. [2022-07-12 17:11:26,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:11:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1195 transitions. [2022-07-12 17:11:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 17:11:26,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:26,859 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:26,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:11:26,860 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 31 more)] === [2022-07-12 17:11:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1224799676, now seen corresponding path program 1 times [2022-07-12 17:11:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:26,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031183568] [2022-07-12 17:11:26,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:26,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:27,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031183568] [2022-07-12 17:11:27,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031183568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:27,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:27,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588976771] [2022-07-12 17:11:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:27,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:27,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:27,090 INFO L87 Difference]: Start difference. First operand 929 states and 1195 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, (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:11:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:28,618 INFO L93 Difference]: Finished difference Result 929 states and 1195 transitions. [2022-07-12 17:11:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:28,618 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, (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 139 [2022-07-12 17:11:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:28,623 INFO L225 Difference]: With dead ends: 929 [2022-07-12 17:11:28,623 INFO L226 Difference]: Without dead ends: 927 [2022-07-12 17:11:28,624 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:11:28,624 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 1630 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:28,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1771 Valid, 2461 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:11:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-07-12 17:11:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2022-07-12 17:11:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 624 states have (on average 1.2131410256410255) internal successors, (757), 656 states have internal predecessors, (757), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1193 transitions. [2022-07-12 17:11:28,687 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1193 transitions. Word has length 139 [2022-07-12 17:11:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:28,687 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1193 transitions. [2022-07-12 17:11:28,688 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, (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:11:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1193 transitions. [2022-07-12 17:11:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 17:11:28,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:28,690 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:11:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:11:28,691 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 31 more)] === [2022-07-12 17:11:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash 249948283, now seen corresponding path program 1 times [2022-07-12 17:11:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:28,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825577637] [2022-07-12 17:11:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:28,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825577637] [2022-07-12 17:11:28,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825577637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:28,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:28,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:28,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754671901] [2022-07-12 17:11:28,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:28,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:28,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:28,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:28,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:28,894 INFO L87 Difference]: Start difference. First operand 927 states and 1193 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, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:11:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:30,508 INFO L93 Difference]: Finished difference Result 927 states and 1193 transitions. [2022-07-12 17:11:30,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:30,509 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, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-07-12 17:11:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:30,513 INFO L225 Difference]: With dead ends: 927 [2022-07-12 17:11:30,513 INFO L226 Difference]: Without dead ends: 925 [2022-07-12 17:11:30,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:11:30,514 INFO L413 NwaCegarLoop]: 1133 mSDtfsCounter, 1624 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:30,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 2459 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:11:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-07-12 17:11:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2022-07-12 17:11:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 623 states have (on average 1.2118780096308186) internal successors, (755), 654 states have internal predecessors, (755), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1191 transitions. [2022-07-12 17:11:30,563 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1191 transitions. Word has length 145 [2022-07-12 17:11:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:30,564 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1191 transitions. [2022-07-12 17:11:30,564 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, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:11:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1191 transitions. [2022-07-12 17:11:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 17:11:30,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:30,566 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:30,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:11:30,567 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 31 more)] === [2022-07-12 17:11:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1075121200, now seen corresponding path program 1 times [2022-07-12 17:11:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:30,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437878655] [2022-07-12 17:11:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:30,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:30,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437878655] [2022-07-12 17:11:30,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437878655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:30,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:30,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:30,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142913109] [2022-07-12 17:11:30,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:30,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:30,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:30,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:30,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:30,796 INFO L87 Difference]: Start difference. First operand 925 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:11:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:32,286 INFO L93 Difference]: Finished difference Result 925 states and 1191 transitions. [2022-07-12 17:11:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-12 17:11:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:32,290 INFO L225 Difference]: With dead ends: 925 [2022-07-12 17:11:32,290 INFO L226 Difference]: Without dead ends: 923 [2022-07-12 17:11:32,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 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:11:32,291 INFO L413 NwaCegarLoop]: 1131 mSDtfsCounter, 1618 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:32,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 2457 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:11:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-07-12 17:11:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2022-07-12 17:11:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 622 states have (on average 1.2106109324758842) internal successors, (753), 652 states have internal predecessors, (753), 219 states have call successors, (219), 67 states have call predecessors, (219), 66 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2022-07-12 17:11:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1189 transitions. [2022-07-12 17:11:32,349 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1189 transitions. Word has length 151 [2022-07-12 17:11:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:32,349 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1189 transitions. [2022-07-12 17:11:32,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:11:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1189 transitions. [2022-07-12 17:11:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 17:11:32,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:32,352 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 17:11:32,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:11:32,352 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 31 more)] === [2022-07-12 17:11:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1533945952, now seen corresponding path program 1 times [2022-07-12 17:11:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:32,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419143623] [2022-07-12 17:11:32,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:11:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:11:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:11:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:11:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:11:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 17:11:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 17:11:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:11:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-07-12 17:11:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:32,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419143623] [2022-07-12 17:11:32,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419143623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:32,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:32,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:11:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186805512] [2022-07-12 17:11:32,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:32,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:11:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:32,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:11:32,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:11:32,695 INFO L87 Difference]: Start difference. First operand 923 states and 1189 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:11:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:36,267 INFO L93 Difference]: Finished difference Result 1776 states and 2294 transitions. [2022-07-12 17:11:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:11:36,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 187 [2022-07-12 17:11:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:36,272 INFO L225 Difference]: With dead ends: 1776 [2022-07-12 17:11:36,272 INFO L226 Difference]: Without dead ends: 1147 [2022-07-12 17:11:36,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:11:36,274 INFO L413 NwaCegarLoop]: 1226 mSDtfsCounter, 1349 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 3641 mSolverCounterSat, 1054 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 4728 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1054 IncrementalHoareTripleChecker+Valid, 3641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:36,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 4728 Invalid, 4695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1054 Valid, 3641 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 17:11:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-12 17:11:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 928. [2022-07-12 17:11:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 626 states have (on average 1.20926517571885) internal successors, (757), 656 states have internal predecessors, (757), 219 states have call successors, (219), 67 states have call predecessors, (219), 67 states have return successors, (221), 215 states have call predecessors, (221), 217 states have call successors, (221) [2022-07-12 17:11:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1197 transitions. [2022-07-12 17:11:36,339 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1197 transitions. Word has length 187 [2022-07-12 17:11:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:36,340 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1197 transitions. [2022-07-12 17:11:36,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:11:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1197 transitions. [2022-07-12 17:11:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 17:11:36,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:36,343 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:36,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:11:36,343 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 31 more)] === [2022-07-12 17:11:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash -576056608, now seen corresponding path program 1 times [2022-07-12 17:11:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:36,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083373404] [2022-07-12 17:11:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:36,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:36,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083373404] [2022-07-12 17:11:36,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083373404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:36,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:36,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111293666] [2022-07-12 17:11:36,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:36,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:36,555 INFO L87 Difference]: Start difference. First operand 928 states and 1197 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:11:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:38,033 INFO L93 Difference]: Finished difference Result 928 states and 1197 transitions. [2022-07-12 17:11:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-07-12 17:11:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:38,038 INFO L225 Difference]: With dead ends: 928 [2022-07-12 17:11:38,038 INFO L226 Difference]: Without dead ends: 926 [2022-07-12 17:11:38,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:11:38,039 INFO L413 NwaCegarLoop]: 1129 mSDtfsCounter, 1612 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:38,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 2455 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:11:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-07-12 17:11:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2022-07-12 17:11:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 625 states have (on average 1.208) internal successors, (755), 654 states have internal predecessors, (755), 219 states have call successors, (219), 67 states have call predecessors, (219), 67 states have return successors, (221), 215 states have call predecessors, (221), 217 states have call successors, (221) [2022-07-12 17:11:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1195 transitions. [2022-07-12 17:11:38,099 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1195 transitions. Word has length 157 [2022-07-12 17:11:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:38,100 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 1195 transitions. [2022-07-12 17:11:38,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:11:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1195 transitions. [2022-07-12 17:11:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 17:11:38,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:38,103 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:38,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:11:38,103 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1565188194, now seen corresponding path program 1 times [2022-07-12 17:11:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:38,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121451840] [2022-07-12 17:11:38,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:11:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:38,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:38,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121451840] [2022-07-12 17:11:38,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121451840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:38,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:38,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:38,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489131623] [2022-07-12 17:11:38,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:38,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:38,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:38,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:38,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:38,305 INFO L87 Difference]: Start difference. First operand 926 states and 1195 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:11:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:39,904 INFO L93 Difference]: Finished difference Result 926 states and 1195 transitions. [2022-07-12 17:11:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:39,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-07-12 17:11:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:39,908 INFO L225 Difference]: With dead ends: 926 [2022-07-12 17:11:39,908 INFO L226 Difference]: Without dead ends: 924 [2022-07-12 17:11:39,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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:11:39,910 INFO L413 NwaCegarLoop]: 1127 mSDtfsCounter, 1606 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:39,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 2453 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 17:11:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-07-12 17:11:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2022-07-12 17:11:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 624 states have (on average 1.2067307692307692) internal successors, (753), 652 states have internal predecessors, (753), 219 states have call successors, (219), 67 states have call predecessors, (219), 67 states have return successors, (221), 215 states have call predecessors, (221), 217 states have call successors, (221) [2022-07-12 17:11:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1193 transitions. [2022-07-12 17:11:39,972 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1193 transitions. Word has length 163 [2022-07-12 17:11:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:39,973 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1193 transitions. [2022-07-12 17:11:39,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:11:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1193 transitions. [2022-07-12 17:11:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 17:11:39,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:39,976 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:11:39,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:11:39,977 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1293557537, now seen corresponding path program 1 times [2022-07-12 17:11:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:39,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118153045] [2022-07-12 17:11:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:11:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:11:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:11:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:11:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:11:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:11:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 17:11:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:11:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:11:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:11:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 17:11:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2022-07-12 17:11:40,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:40,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118153045] [2022-07-12 17:11:40,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118153045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:40,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:40,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:11:40,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383238310] [2022-07-12 17:11:40,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:40,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:11:40,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:11:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:11:40,318 INFO L87 Difference]: Start difference. First operand 924 states and 1193 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:11:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:42,357 INFO L93 Difference]: Finished difference Result 1685 states and 2151 transitions. [2022-07-12 17:11:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 207 [2022-07-12 17:11:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:42,362 INFO L225 Difference]: With dead ends: 1685 [2022-07-12 17:11:42,363 INFO L226 Difference]: Without dead ends: 944 [2022-07-12 17:11:42,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:11:42,365 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 2116 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 1195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1195 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:42,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2276 Valid, 2086 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1195 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 17:11:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-07-12 17:11:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 920. [2022-07-12 17:11:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 621 states have (on average 1.2045088566827697) internal successors, (748), 648 states have internal predecessors, (748), 219 states have call successors, (219), 67 states have call predecessors, (219), 67 states have return successors, (221), 215 states have call predecessors, (221), 217 states have call successors, (221) [2022-07-12 17:11:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1188 transitions. [2022-07-12 17:11:42,429 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1188 transitions. Word has length 207 [2022-07-12 17:11:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:42,430 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1188 transitions. [2022-07-12 17:11:42,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:11:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1188 transitions. [2022-07-12 17:11:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 17:11:42,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:42,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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:11:42,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 17:11:42,434 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:42,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1601264781, now seen corresponding path program 1 times [2022-07-12 17:11:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:42,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99401498] [2022-07-12 17:11:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:11:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:11:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:42,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99401498] [2022-07-12 17:11:42,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99401498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:42,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:42,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:42,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953560512] [2022-07-12 17:11:42,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:42,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:42,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:42,661 INFO L87 Difference]: Start difference. First operand 920 states and 1188 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:11:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:44,160 INFO L93 Difference]: Finished difference Result 920 states and 1188 transitions. [2022-07-12 17:11:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:44,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-07-12 17:11:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:44,164 INFO L225 Difference]: With dead ends: 920 [2022-07-12 17:11:44,164 INFO L226 Difference]: Without dead ends: 918 [2022-07-12 17:11:44,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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:11:44,165 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 1595 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:44,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 2432 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:11:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-07-12 17:11:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2022-07-12 17:11:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 620 states have (on average 1.2032258064516128) internal successors, (746), 646 states have internal predecessors, (746), 219 states have call successors, (219), 67 states have call predecessors, (219), 67 states have return successors, (221), 215 states have call predecessors, (221), 217 states have call successors, (221) [2022-07-12 17:11:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1186 transitions. [2022-07-12 17:11:44,251 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1186 transitions. Word has length 169 [2022-07-12 17:11:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:44,252 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1186 transitions. [2022-07-12 17:11:44,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:11:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1186 transitions. [2022-07-12 17:11:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-12 17:11:44,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:44,254 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:44,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 17:11:44,255 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 31 more)] === [2022-07-12 17:11:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash 664104994, now seen corresponding path program 1 times [2022-07-12 17:11:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:44,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846980607] [2022-07-12 17:11:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:11:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:11:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:11:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:11:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:11:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:11:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:11:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 17:11:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 17:11:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 17:11:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-07-12 17:11:44,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:44,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846980607] [2022-07-12 17:11:44,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846980607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:44,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:44,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:11:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999549002] [2022-07-12 17:11:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:11:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:44,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:11:44,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:11:44,527 INFO L87 Difference]: Start difference. First operand 918 states and 1186 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:11:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:46,935 INFO L93 Difference]: Finished difference Result 997 states and 1268 transitions. [2022-07-12 17:11:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:11:46,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2022-07-12 17:11:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:46,940 INFO L225 Difference]: With dead ends: 997 [2022-07-12 17:11:46,940 INFO L226 Difference]: Without dead ends: 995 [2022-07-12 17:11:46,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:11:46,941 INFO L413 NwaCegarLoop]: 1115 mSDtfsCounter, 1829 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 986 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 986 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:46,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 3472 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [986 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 17:11:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-12 17:11:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 969. [2022-07-12 17:11:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 654 states have (on average 1.194189602446483) internal successors, (781), 679 states have internal predecessors, (781), 226 states have call successors, (226), 78 states have call predecessors, (226), 78 states have return successors, (228), 222 states have call predecessors, (228), 224 states have call successors, (228) [2022-07-12 17:11:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1235 transitions. [2022-07-12 17:11:47,010 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1235 transitions. Word has length 203 [2022-07-12 17:11:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:47,010 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1235 transitions. [2022-07-12 17:11:47,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:11:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1235 transitions. [2022-07-12 17:11:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-12 17:11:47,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:47,013 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:47,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 17:11:47,013 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:47,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 577814734, now seen corresponding path program 1 times [2022-07-12 17:11:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:47,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114037109] [2022-07-12 17:11:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:11:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:11:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:11:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:11:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:11:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:11:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 17:11:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:11:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:11:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:11:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 17:11:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:11:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2022-07-12 17:11:47,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:47,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114037109] [2022-07-12 17:11:47,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114037109] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:11:47,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310820108] [2022-07-12 17:11:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:47,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:11:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:11:47,307 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:11:47,308 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:11:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:47,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 2025 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:11:47,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:11:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:11:48,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:11:48,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310820108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:48,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:11:48,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-12 17:11:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855099581] [2022-07-12 17:11:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:48,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:11:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:11:48,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:11:48,081 INFO L87 Difference]: Start difference. First operand 969 states and 1235 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:11:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:48,233 INFO L93 Difference]: Finished difference Result 1804 states and 2270 transitions. [2022-07-12 17:11:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:11:48,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 213 [2022-07-12 17:11:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:48,238 INFO L225 Difference]: With dead ends: 1804 [2022-07-12 17:11:48,239 INFO L226 Difference]: Without dead ends: 1021 [2022-07-12 17:11:48,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:11:48,241 INFO L413 NwaCegarLoop]: 1233 mSDtfsCounter, 1102 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:48,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1300 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 17:11:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-07-12 17:11:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1018. [2022-07-12 17:11:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 683 states have (on average 1.1874084919472914) internal successors, (811), 711 states have internal predecessors, (811), 241 states have call successors, (241), 84 states have call predecessors, (241), 84 states have return successors, (243), 235 states have call predecessors, (243), 239 states have call successors, (243) [2022-07-12 17:11:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1295 transitions. [2022-07-12 17:11:48,324 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1295 transitions. Word has length 213 [2022-07-12 17:11:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:48,324 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 1295 transitions. [2022-07-12 17:11:48,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:11:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1295 transitions. [2022-07-12 17:11:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 17:11:48,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:48,327 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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:11:48,358 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:11:48,555 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,SelfDestructingSolverStorable24 [2022-07-12 17:11:48,556 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:48,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1999876672, now seen corresponding path program 1 times [2022-07-12 17:11:48,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:48,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215685093] [2022-07-12 17:11:48,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:48,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:11:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:11:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:11:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:48,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215685093] [2022-07-12 17:11:48,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215685093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:48,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:48,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830786601] [2022-07-12 17:11:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:48,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:48,775 INFO L87 Difference]: Start difference. First operand 1018 states and 1295 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:11:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:51,911 INFO L93 Difference]: Finished difference Result 1873 states and 2381 transitions. [2022-07-12 17:11:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:11:51,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-07-12 17:11:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:51,920 INFO L225 Difference]: With dead ends: 1873 [2022-07-12 17:11:51,921 INFO L226 Difference]: Without dead ends: 1871 [2022-07-12 17:11:51,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:11:51,922 INFO L413 NwaCegarLoop]: 1305 mSDtfsCounter, 2246 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 1116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1116 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:51,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 3172 Invalid, 3237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1116 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 17:11:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-07-12 17:11:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1840. [2022-07-12 17:11:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1241 states have (on average 1.1893634165995166) internal successors, (1476), 1282 states have internal predecessors, (1476), 431 states have call successors, (431), 157 states have call predecessors, (431), 158 states have return successors, (447), 422 states have call predecessors, (447), 429 states have call successors, (447) [2022-07-12 17:11:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2354 transitions. [2022-07-12 17:11:52,079 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2354 transitions. Word has length 175 [2022-07-12 17:11:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:52,079 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 2354 transitions. [2022-07-12 17:11:52,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:11:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2354 transitions. [2022-07-12 17:11:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-12 17:11:52,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:52,082 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:52,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 17:11:52,082 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1330314272, now seen corresponding path program 1 times [2022-07-12 17:11:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:52,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835551342] [2022-07-12 17:11:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:52,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:11:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:11:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:11:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:11:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:52,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835551342] [2022-07-12 17:11:52,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835551342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:52,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211930667] [2022-07-12 17:11:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:52,295 INFO L87 Difference]: Start difference. First operand 1840 states and 2354 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:11:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:53,848 INFO L93 Difference]: Finished difference Result 1840 states and 2354 transitions. [2022-07-12 17:11:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:11:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-07-12 17:11:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:53,857 INFO L225 Difference]: With dead ends: 1840 [2022-07-12 17:11:53,858 INFO L226 Difference]: Without dead ends: 1838 [2022-07-12 17:11:53,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 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:11:53,859 INFO L413 NwaCegarLoop]: 1111 mSDtfsCounter, 1578 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:53,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 2409 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 17:11:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-07-12 17:11:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2022-07-12 17:11:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1240 states have (on average 1.1887096774193548) internal successors, (1474), 1280 states have internal predecessors, (1474), 431 states have call successors, (431), 157 states have call predecessors, (431), 158 states have return successors, (447), 422 states have call predecessors, (447), 429 states have call successors, (447) [2022-07-12 17:11:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2352 transitions. [2022-07-12 17:11:54,003 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2352 transitions. Word has length 181 [2022-07-12 17:11:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:54,004 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2352 transitions. [2022-07-12 17:11:54,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:11:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2352 transitions. [2022-07-12 17:11:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 17:11:54,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:54,007 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:11:54,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 17:11:54,007 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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 31 more)] === [2022-07-12 17:11:54,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -878657064, now seen corresponding path program 1 times [2022-07-12 17:11:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:54,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554381697] [2022-07-12 17:11:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:11:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:11:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:11:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:11:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:11:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:11:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:11:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 17:11:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 17:11:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 17:11:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 17:11:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 17:11:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 17:11:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-07-12 17:11:54,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:54,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554381697] [2022-07-12 17:11:54,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554381697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:54,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:54,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:11:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820078653] [2022-07-12 17:11:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:54,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:11:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:54,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:11:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:11:54,370 INFO L87 Difference]: Start difference. First operand 1838 states and 2352 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2022-07-12 17:11:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:11:57,613 INFO L93 Difference]: Finished difference Result 1915 states and 2454 transitions. [2022-07-12 17:11:57,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 17:11:57,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) Word has length 214 [2022-07-12 17:11:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:11:57,620 INFO L225 Difference]: With dead ends: 1915 [2022-07-12 17:11:57,620 INFO L226 Difference]: Without dead ends: 1913 [2022-07-12 17:11:57,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-07-12 17:11:57,621 INFO L413 NwaCegarLoop]: 1137 mSDtfsCounter, 1503 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 1149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1149 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:11:57,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 4147 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1149 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-12 17:11:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-07-12 17:11:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1847. [2022-07-12 17:11:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1246 states have (on average 1.1861958266452648) internal successors, (1478), 1286 states have internal predecessors, (1478), 431 states have call successors, (431), 157 states have call predecessors, (431), 162 states have return successors, (454), 426 states have call predecessors, (454), 429 states have call successors, (454) [2022-07-12 17:11:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2363 transitions. [2022-07-12 17:11:57,781 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2363 transitions. Word has length 214 [2022-07-12 17:11:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:11:57,781 INFO L495 AbstractCegarLoop]: Abstraction has 1847 states and 2363 transitions. [2022-07-12 17:11:57,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2022-07-12 17:11:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2363 transitions. [2022-07-12 17:11:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 17:11:57,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:11:57,784 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:57,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 17:11:57,785 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:11:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:11:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash -701955474, now seen corresponding path program 1 times [2022-07-12 17:11:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:11:57,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883377082] [2022-07-12 17:11:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:11:57,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:11:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:11:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:11:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:11:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:11:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:11:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:11:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:11:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:11:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:11:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:11:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:11:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:11:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:11:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:11:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:11:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:11:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:11:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:11:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:11:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:11:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:11:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:11:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:11:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:11:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:11:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:11:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:11:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:11:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 17:11:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:11:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:11:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:11:57,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883377082] [2022-07-12 17:11:57,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883377082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:11:57,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:11:57,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:11:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784233886] [2022-07-12 17:11:57,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:11:57,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:11:57,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:11:57,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:11:57,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:11:57,989 INFO L87 Difference]: Start difference. First operand 1847 states and 2363 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:12:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:00,772 INFO L93 Difference]: Finished difference Result 3551 states and 4564 transitions. [2022-07-12 17:12:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:12:00,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-07-12 17:12:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:00,785 INFO L225 Difference]: With dead ends: 3551 [2022-07-12 17:12:00,786 INFO L226 Difference]: Without dead ends: 3393 [2022-07-12 17:12:00,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:12:00,790 INFO L413 NwaCegarLoop]: 1346 mSDtfsCounter, 2215 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 1099 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2343 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1099 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:00,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2343 Valid, 3292 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1099 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 17:12:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-07-12 17:12:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3375. [2022-07-12 17:12:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3375 states, 2291 states have (on average 1.1929288520296815) internal successors, (2733), 2355 states have internal predecessors, (2733), 780 states have call successors, (780), 286 states have call predecessors, (780), 296 states have return successors, (854), 775 states have call predecessors, (854), 776 states have call successors, (854) [2022-07-12 17:12:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 4367 transitions. [2022-07-12 17:12:01,070 INFO L78 Accepts]: Start accepts. Automaton has 3375 states and 4367 transitions. Word has length 187 [2022-07-12 17:12:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:01,071 INFO L495 AbstractCegarLoop]: Abstraction has 3375 states and 4367 transitions. [2022-07-12 17:12:01,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:12:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3375 states and 4367 transitions. [2022-07-12 17:12:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-12 17:12:01,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:01,074 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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] [2022-07-12 17:12:01,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 17:12:01,074 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:12:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -429016518, now seen corresponding path program 1 times [2022-07-12 17:12:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:01,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149326054] [2022-07-12 17:12:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:12:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:12:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:12:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:12:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:12:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:12:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:12:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:12:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 17:12:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:12:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:12:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:12:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 17:12:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:12:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 17:12:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 17:12:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-12 17:12:01,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:01,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149326054] [2022-07-12 17:12:01,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149326054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:01,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:01,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:12:01,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672191461] [2022-07-12 17:12:01,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:01,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:12:01,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:01,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:12:01,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:12:01,323 INFO L87 Difference]: Start difference. First operand 3375 states and 4367 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:12:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:05,305 INFO L93 Difference]: Finished difference Result 7596 states and 10040 transitions. [2022-07-12 17:12:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:12:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 234 [2022-07-12 17:12:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:05,323 INFO L225 Difference]: With dead ends: 7596 [2022-07-12 17:12:05,323 INFO L226 Difference]: Without dead ends: 4675 [2022-07-12 17:12:05,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:12:05,333 INFO L413 NwaCegarLoop]: 1580 mSDtfsCounter, 1215 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 4607 SdHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:05,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 4607 Invalid, 3143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 17:12:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2022-07-12 17:12:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 3387. [2022-07-12 17:12:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 2299 states have (on average 1.192257503262288) internal successors, (2741), 2364 states have internal predecessors, (2741), 780 states have call successors, (780), 286 states have call predecessors, (780), 300 states have return successors, (861), 779 states have call predecessors, (861), 776 states have call successors, (861) [2022-07-12 17:12:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4382 transitions. [2022-07-12 17:12:05,676 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4382 transitions. Word has length 234 [2022-07-12 17:12:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:05,677 INFO L495 AbstractCegarLoop]: Abstraction has 3387 states and 4382 transitions. [2022-07-12 17:12:05,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:12:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4382 transitions. [2022-07-12 17:12:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-12 17:12:05,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:05,680 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:05,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 17:12:05,681 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:12:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:05,681 INFO L85 PathProgramCache]: Analyzing trace with hash 370781952, now seen corresponding path program 1 times [2022-07-12 17:12:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:05,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531081034] [2022-07-12 17:12:05,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:05,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:12:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:12:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:12:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:12:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:12:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:12:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:12:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:12:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:12:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:12:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:12:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:12:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:12:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:12:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:12:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 17:12:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 17:12:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:12:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 17:12:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-07-12 17:12:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:05,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531081034] [2022-07-12 17:12:05,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531081034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:05,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:05,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:12:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792952819] [2022-07-12 17:12:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:05,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:12:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:05,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:12:06,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:12:06,000 INFO L87 Difference]: Start difference. First operand 3387 states and 4382 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:12:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:08,816 INFO L93 Difference]: Finished difference Result 6392 states and 8277 transitions. [2022-07-12 17:12:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:12:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 228 [2022-07-12 17:12:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:08,827 INFO L225 Difference]: With dead ends: 6392 [2022-07-12 17:12:08,828 INFO L226 Difference]: Without dead ends: 3461 [2022-07-12 17:12:08,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:12:08,837 INFO L413 NwaCegarLoop]: 1104 mSDtfsCounter, 988 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 2614 mSolverCounterSat, 820 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 3434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 820 IncrementalHoareTripleChecker+Valid, 2614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:08,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 3858 Invalid, 3434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [820 Valid, 2614 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 17:12:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2022-07-12 17:12:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3399. [2022-07-12 17:12:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 2311 states have (on average 1.1912591951536131) internal successors, (2753), 2376 states have internal predecessors, (2753), 780 states have call successors, (780), 286 states have call predecessors, (780), 300 states have return successors, (861), 779 states have call predecessors, (861), 776 states have call successors, (861) [2022-07-12 17:12:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4394 transitions. [2022-07-12 17:12:09,156 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4394 transitions. Word has length 228 [2022-07-12 17:12:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:09,157 INFO L495 AbstractCegarLoop]: Abstraction has 3399 states and 4394 transitions. [2022-07-12 17:12:09,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:12:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4394 transitions. [2022-07-12 17:12:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-12 17:12:09,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:09,159 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:09,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 17:12:09,160 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:12:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1623362754, now seen corresponding path program 1 times [2022-07-12 17:12:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:09,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818431000] [2022-07-12 17:12:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:12:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:12:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:12:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:12:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:12:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:12:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:12:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:12:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:12:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:12:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 17:12:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:12:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:12:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:12:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:12:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 17:12:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 17:12:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 17:12:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 17:12:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 17:12:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 17:12:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2022-07-12 17:12:09,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:09,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818431000] [2022-07-12 17:12:09,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818431000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:12:09,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992811330] [2022-07-12 17:12:09,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:09,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:12:09,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:12:09,548 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:12:09,550 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:12:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:10,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 2193 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 17:12:10,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2022-07-12 17:12:10,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:12:10,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992811330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:10,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:12:10,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 18 [2022-07-12 17:12:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942886707] [2022-07-12 17:12:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:10,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 17:12:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 17:12:10,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2022-07-12 17:12:10,456 INFO L87 Difference]: Start difference. First operand 3399 states and 4394 transitions. Second operand has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2022-07-12 17:12:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:11,329 INFO L93 Difference]: Finished difference Result 6236 states and 7976 transitions. [2022-07-12 17:12:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 17:12:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 228 [2022-07-12 17:12:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:11,342 INFO L225 Difference]: With dead ends: 6236 [2022-07-12 17:12:11,342 INFO L226 Difference]: Without dead ends: 3695 [2022-07-12 17:12:11,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-07-12 17:12:11,350 INFO L413 NwaCegarLoop]: 1234 mSDtfsCounter, 183 mSDsluCounter, 13173 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 14407 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:11,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 14407 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 17:12:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2022-07-12 17:12:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3435. [2022-07-12 17:12:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 2339 states have (on average 1.188969645147499) internal successors, (2781), 2404 states have internal predecessors, (2781), 788 states have call successors, (788), 286 states have call predecessors, (788), 300 states have return successors, (869), 787 states have call predecessors, (869), 784 states have call successors, (869) [2022-07-12 17:12:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4438 transitions. [2022-07-12 17:12:11,702 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4438 transitions. Word has length 228 [2022-07-12 17:12:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:11,703 INFO L495 AbstractCegarLoop]: Abstraction has 3435 states and 4438 transitions. [2022-07-12 17:12:11,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2022-07-12 17:12:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4438 transitions. [2022-07-12 17:12:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-12 17:12:11,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:11,706 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:11,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 17:12:11,919 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,SelfDestructingSolverStorable31 [2022-07-12 17:12:11,920 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:12:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash 81717830, now seen corresponding path program 1 times [2022-07-12 17:12:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:11,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775488809] [2022-07-12 17:12:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:12:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:12:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:12:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:12:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:12:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:12:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:12:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:12:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:12:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:12:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:12:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:12:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:12:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 17:12:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:12:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:12:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:12:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:12:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 17:12:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-12 17:12:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-12 17:12:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 17:12:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-12 17:12:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:12,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775488809] [2022-07-12 17:12:12,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775488809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:12,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:12,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 17:12:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58793094] [2022-07-12 17:12:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:12,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 17:12:12,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:12,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 17:12:12,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:12:12,385 INFO L87 Difference]: Start difference. First operand 3435 states and 4438 transitions. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 8 states have internal predecessors, (107), 3 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-12 17:12:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:17,678 INFO L93 Difference]: Finished difference Result 7957 states and 10537 transitions. [2022-07-12 17:12:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 17:12:17,679 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 8 states have internal predecessors, (107), 3 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 249 [2022-07-12 17:12:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:17,693 INFO L225 Difference]: With dead ends: 7957 [2022-07-12 17:12:17,693 INFO L226 Difference]: Without dead ends: 4640 [2022-07-12 17:12:17,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-07-12 17:12:17,703 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 2232 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 5972 mSolverCounterSat, 1579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 8378 SdHoareTripleChecker+Invalid, 7551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1579 IncrementalHoareTripleChecker+Valid, 5972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:17,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2232 Valid, 8378 Invalid, 7551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1579 Valid, 5972 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 17:12:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-12 17:12:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 3444. [2022-07-12 17:12:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3444 states, 2346 states have (on average 1.1884057971014492) internal successors, (2788), 2411 states have internal predecessors, (2788), 789 states have call successors, (789), 286 states have call predecessors, (789), 301 states have return successors, (871), 789 states have call predecessors, (871), 785 states have call successors, (871) [2022-07-12 17:12:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 4448 transitions. [2022-07-12 17:12:18,150 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 4448 transitions. Word has length 249 [2022-07-12 17:12:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:18,150 INFO L495 AbstractCegarLoop]: Abstraction has 3444 states and 4448 transitions. [2022-07-12 17:12:18,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 8 states have internal predecessors, (107), 3 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-12 17:12:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 4448 transitions. [2022-07-12 17:12:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-12 17:12:18,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:18,154 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 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:12:18,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 17:12:18,154 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:12:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1493401337, now seen corresponding path program 1 times [2022-07-12 17:12:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:18,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260924932] [2022-07-12 17:12:18,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:18,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:12:18,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80798868] [2022-07-12 17:12:18,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:18,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:12:18,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:12:18,225 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:12:18,252 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:12:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:19,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 17:12:19,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:19,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 17:12:19,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-12 17:12:21,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-07-12 17:12:25,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-12 17:12:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-12 17:12:27,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:12:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:27,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260924932] [2022-07-12 17:12:27,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:12:27,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80798868] [2022-07-12 17:12:27,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80798868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:12:27,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:12:27,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-12 17:12:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600050302] [2022-07-12 17:12:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:12:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 17:12:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 17:12:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=363, Unknown=5, NotChecked=0, Total=420 [2022-07-12 17:12:27,862 INFO L87 Difference]: Start difference. First operand 3444 states and 4448 transitions. Second operand has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 18 states have internal predecessors, (119), 5 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (29), 6 states have call predecessors, (29), 5 states have call successors, (29) [2022-07-12 17:12:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:32,176 INFO L93 Difference]: Finished difference Result 6546 states and 8453 transitions. [2022-07-12 17:12:32,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 17:12:32,177 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 18 states have internal predecessors, (119), 5 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (29), 6 states have call predecessors, (29), 5 states have call successors, (29) Word has length 270 [2022-07-12 17:12:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:32,188 INFO L225 Difference]: With dead ends: 6546 [2022-07-12 17:12:32,188 INFO L226 Difference]: Without dead ends: 3567 [2022-07-12 17:12:32,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 244 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=97, Invalid=654, Unknown=5, NotChecked=0, Total=756 [2022-07-12 17:12:32,197 INFO L413 NwaCegarLoop]: 1277 mSDtfsCounter, 304 mSDsluCounter, 16537 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 17814 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 555 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:32,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 17814 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1090 Invalid, 0 Unknown, 555 Unchecked, 3.7s Time] [2022-07-12 17:12:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2022-07-12 17:12:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3454. [2022-07-12 17:12:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2353 states have (on average 1.186145346366341) internal successors, (2791), 2418 states have internal predecessors, (2791), 789 states have call successors, (789), 289 states have call predecessors, (789), 304 states have return successors, (871), 789 states have call predecessors, (871), 785 states have call successors, (871) [2022-07-12 17:12:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4451 transitions. [2022-07-12 17:12:32,580 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4451 transitions. Word has length 270 [2022-07-12 17:12:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:32,580 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4451 transitions. [2022-07-12 17:12:32,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 18 states have internal predecessors, (119), 5 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (29), 6 states have call predecessors, (29), 5 states have call successors, (29) [2022-07-12 17:12:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4451 transitions. [2022-07-12 17:12:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-12 17:12:32,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:32,584 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 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:12:32,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 17:12:32,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:12:32,808 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:12:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1495248379, now seen corresponding path program 1 times [2022-07-12 17:12:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:32,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980787669] [2022-07-12 17:12:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:32,900 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:12:32,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016652259] [2022-07-12 17:12:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:32,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:12:32,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:12:32,902 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:12:32,903 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:12:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:34,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 17:12:34,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 219 proven. 3 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-07-12 17:12:34,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:12:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-07-12 17:12:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:34,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980787669] [2022-07-12 17:12:34,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:12:34,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016652259] [2022-07-12 17:12:34,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016652259] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:12:34,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:12:34,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-12 17:12:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28607697] [2022-07-12 17:12:34,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:12:34,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:12:34,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:34,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:12:34,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:12:34,820 INFO L87 Difference]: Start difference. First operand 3454 states and 4451 transitions. Second operand has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 12 states have internal predecessors, (176), 5 states have call successors, (61), 2 states have call predecessors, (61), 5 states have return successors, (60), 6 states have call predecessors, (60), 5 states have call successors, (60) [2022-07-12 17:12:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:35,997 INFO L93 Difference]: Finished difference Result 7797 states and 10239 transitions. [2022-07-12 17:12:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:12:35,998 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 12 states have internal predecessors, (176), 5 states have call successors, (61), 2 states have call predecessors, (61), 5 states have return successors, (60), 6 states have call predecessors, (60), 5 states have call successors, (60) Word has length 270 [2022-07-12 17:12:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:36,012 INFO L225 Difference]: With dead ends: 7797 [2022-07-12 17:12:36,012 INFO L226 Difference]: Without dead ends: 4384 [2022-07-12 17:12:36,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:12:36,023 INFO L413 NwaCegarLoop]: 1481 mSDtfsCounter, 735 mSDsluCounter, 12686 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 14167 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:36,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 14167 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 17:12:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-07-12 17:12:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3454. [2022-07-12 17:12:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2353 states have (on average 1.1852953676158096) internal successors, (2789), 2416 states have internal predecessors, (2789), 789 states have call successors, (789), 289 states have call predecessors, (789), 304 states have return successors, (871), 789 states have call predecessors, (871), 785 states have call successors, (871) [2022-07-12 17:12:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4449 transitions. [2022-07-12 17:12:36,503 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4449 transitions. Word has length 270 [2022-07-12 17:12:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:36,503 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4449 transitions. [2022-07-12 17:12:36,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 12 states have internal predecessors, (176), 5 states have call successors, (61), 2 states have call predecessors, (61), 5 states have return successors, (60), 6 states have call predecessors, (60), 5 states have call successors, (60) [2022-07-12 17:12:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4449 transitions. [2022-07-12 17:12:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-12 17:12:36,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:36,507 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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:12:36,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 17:12:36,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:12:36,723 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:12:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1148313790, now seen corresponding path program 1 times [2022-07-12 17:12:36,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:36,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130670313] [2022-07-12 17:12:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:36,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:12:36,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056326700] [2022-07-12 17:12:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:36,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:12:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:12:36,811 INFO L229 MonitoredProcess]: Starting monitored process 6 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:12:36,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 17:12:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:12:37,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 2632 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 17:12:37,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:12:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 289 proven. 3 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-07-12 17:12:38,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:12:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-07-12 17:12:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:12:38,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130670313] [2022-07-12 17:12:38,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 17:12:38,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056326700] [2022-07-12 17:12:38,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056326700] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:12:38,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:12:38,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-12 17:12:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839946269] [2022-07-12 17:12:38,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 17:12:38,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 17:12:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:12:38,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 17:12:38,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:12:38,433 INFO L87 Difference]: Start difference. First operand 3454 states and 4449 transitions. Second operand has 14 states, 13 states have (on average 13.692307692307692) internal successors, (178), 12 states have internal predecessors, (178), 5 states have call successors, (61), 2 states have call predecessors, (61), 5 states have return successors, (60), 6 states have call predecessors, (60), 5 states have call successors, (60) [2022-07-12 17:12:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:12:39,376 INFO L93 Difference]: Finished difference Result 7784 states and 10219 transitions. [2022-07-12 17:12:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 17:12:39,376 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.692307692307692) internal successors, (178), 12 states have internal predecessors, (178), 5 states have call successors, (61), 2 states have call predecessors, (61), 5 states have return successors, (60), 6 states have call predecessors, (60), 5 states have call successors, (60) Word has length 274 [2022-07-12 17:12:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:12:39,393 INFO L225 Difference]: With dead ends: 7784 [2022-07-12 17:12:39,393 INFO L226 Difference]: Without dead ends: 4384 [2022-07-12 17:12:39,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:12:39,404 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 729 mSDsluCounter, 12683 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 14163 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:12:39,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 14163 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 17:12:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-07-12 17:12:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3454. [2022-07-12 17:12:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2353 states have (on average 1.1844453888652784) internal successors, (2787), 2414 states have internal predecessors, (2787), 789 states have call successors, (789), 289 states have call predecessors, (789), 304 states have return successors, (871), 789 states have call predecessors, (871), 785 states have call successors, (871) [2022-07-12 17:12:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4447 transitions. [2022-07-12 17:12:39,841 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4447 transitions. Word has length 274 [2022-07-12 17:12:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:12:39,841 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4447 transitions. [2022-07-12 17:12:39,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.692307692307692) internal successors, (178), 12 states have internal predecessors, (178), 5 states have call successors, (61), 2 states have call predecessors, (61), 5 states have return successors, (60), 6 states have call predecessors, (60), 5 states have call successors, (60) [2022-07-12 17:12:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4447 transitions. [2022-07-12 17:12:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-07-12 17:12:39,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:12:39,844 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:12:39,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 17:12:40,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-12 17:12:40,072 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-12 17:12:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:12:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -815079205, now seen corresponding path program 1 times [2022-07-12 17:12:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:12:40,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406536217] [2022-07-12 17:12:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:12:40,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 17:12:40,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328423404] [2022-07-12 17:12:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:12:40,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:12:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:12:40,151 INFO L229 MonitoredProcess]: Starting monitored process 7 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:12:40,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process