./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--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-?-eb692b5 [2022-07-20 04:12:42,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:12:42,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:12:42,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:12:42,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:12:42,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:12:42,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:12:42,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:12:42,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:12:42,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:12:42,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:12:42,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:12:42,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:12:42,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:12:42,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:12:42,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:12:42,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:12:42,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:12:42,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:12:42,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:12:42,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:12:42,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:12:42,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:12:42,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:12:42,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:12:42,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:12:42,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:12:42,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:12:42,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:12:42,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:12:42,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:12:42,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:12:42,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:12:42,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:12:42,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:12:42,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:12:42,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:12:42,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:12:42,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:12:42,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:12:42,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:12:42,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:12:42,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:12:42,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:12:42,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:12:42,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:12:42,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:12:42,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:12:42,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:12:42,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:12:42,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:12:42,962 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:12:42,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:12:42,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:12:42,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:12:42,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:12:42,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:12:42,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:12:42,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:12:42,964 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:12:42,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:12:42,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:12:42,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:12:42,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:12:42,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:12:42,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:12:42,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:12:42,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:12:42,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:12:42,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:12:42,967 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:12:42,967 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:12:42,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:12:42,967 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-20 04:12:43,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:12:43,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:12:43,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:12:43,220 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:12:43,221 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:12:43,222 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-20 04:12:43,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eddf39303/f334ed25d0b94f938dacf778e502f05a/FLAG595cb804f [2022-07-20 04:12:43,942 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:12:43,944 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-20 04:12:43,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eddf39303/f334ed25d0b94f938dacf778e502f05a/FLAG595cb804f [2022-07-20 04:12:44,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eddf39303/f334ed25d0b94f938dacf778e502f05a [2022-07-20 04:12:44,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:12:44,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:12:44,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:12:44,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:12:44,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:12:44,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:44,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a3f457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44, skipping insertion in model container [2022-07-20 04:12:44,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:44,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:12:44,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:12:46,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259568,259581] [2022-07-20 04:12:46,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259726,259739] [2022-07-20 04:12:46,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259884,259897] [2022-07-20 04:12:46,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260042,260055] [2022-07-20 04:12:46,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260202,260215] [2022-07-20 04:12:46,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260361,260374] [2022-07-20 04:12:46,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260500,260513] [2022-07-20 04:12:46,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260642,260655] [2022-07-20 04:12:46,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260791,260804] [2022-07-20 04:12:46,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260930,260943] [2022-07-20 04:12:46,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261085,261098] [2022-07-20 04:12:46,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261245,261258] [2022-07-20 04:12:46,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261396,261409] [2022-07-20 04:12:46,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261547,261560] [2022-07-20 04:12:46,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261699,261712] [2022-07-20 04:12:46,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262458,262471] [2022-07-20 04:12:46,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262611,262624] [2022-07-20 04:12:46,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262757,262770] [2022-07-20 04:12:46,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262900,262913] [2022-07-20 04:12:46,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263052,263065] [2022-07-20 04:12:46,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263198,263211] [2022-07-20 04:12:46,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263343,263356] [2022-07-20 04:12:46,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263497,263510] [2022-07-20 04:12:46,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263648,263661] [2022-07-20 04:12:46,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263803,263816] [2022-07-20 04:12:46,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263955,263968] [2022-07-20 04:12:46,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264110,264123] [2022-07-20 04:12:46,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264274,264287] [2022-07-20 04:12:46,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264430,264443] [2022-07-20 04:12:46,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264594,264607] [2022-07-20 04:12:46,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264736,264749] [2022-07-20 04:12:46,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264894,264907] [2022-07-20 04:12:46,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265061,265074] [2022-07-20 04:12:46,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265220,265233] [2022-07-20 04:12:46,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265379,265392] [2022-07-20 04:12:46,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265528,265541] [2022-07-20 04:12:46,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265675,265688] [2022-07-20 04:12:46,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265814,265827] [2022-07-20 04:12:46,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265977,265990] [2022-07-20 04:12:46,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266143,266156] [2022-07-20 04:12:46,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266307,266320] [2022-07-20 04:12:46,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266472,266485] [2022-07-20 04:12:46,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266637,266650] [2022-07-20 04:12:46,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266803,266816] [2022-07-20 04:12:46,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266968,266981] [2022-07-20 04:12:46,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267135,267148] [2022-07-20 04:12:46,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269237,269250] [2022-07-20 04:12:46,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269389,269402] [2022-07-20 04:12:46,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269540,269553] [2022-07-20 04:12:46,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269689,269702] [2022-07-20 04:12:46,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269841,269854] [2022-07-20 04:12:46,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269989,270002] [2022-07-20 04:12:46,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271375,271388] [2022-07-20 04:12:46,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271542,271555] [2022-07-20 04:12:46,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271710,271723] [2022-07-20 04:12:46,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271860,271873] [2022-07-20 04:12:46,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272007,272020] [2022-07-20 04:12:46,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272168,272181] [2022-07-20 04:12:46,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272338,272351] [2022-07-20 04:12:46,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272500,272513] [2022-07-20 04:12:46,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:12:46,122 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:12:46,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260642,260655] [2022-07-20 04:12:46,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260791,260804] [2022-07-20 04:12:46,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260930,260943] [2022-07-20 04:12:46,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262757,262770] [2022-07-20 04:12:46,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262900,262913] [2022-07-20 04:12:46,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263052,263065] [2022-07-20 04:12:46,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263198,263211] [2022-07-20 04:12:46,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263343,263356] [2022-07-20 04:12:46,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263497,263510] [2022-07-20 04:12:46,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263648,263661] [2022-07-20 04:12:46,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263803,263816] [2022-07-20 04:12:46,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263955,263968] [2022-07-20 04:12:46,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264110,264123] [2022-07-20 04:12:46,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264274,264287] [2022-07-20 04:12:46,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264430,264443] [2022-07-20 04:12:46,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264594,264607] [2022-07-20 04:12:46,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264736,264749] [2022-07-20 04:12:46,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264894,264907] [2022-07-20 04:12:46,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265061,265074] [2022-07-20 04:12:46,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265220,265233] [2022-07-20 04:12:46,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265814,265827] [2022-07-20 04:12:46,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265977,265990] [2022-07-20 04:12:46,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266143,266156] [2022-07-20 04:12:46,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266307,266320] [2022-07-20 04:12:46,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266472,266485] [2022-07-20 04:12:46,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266637,266650] [2022-07-20 04:12:46,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266803,266816] [2022-07-20 04:12:46,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266968,266981] [2022-07-20 04:12:46,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267135,267148] [2022-07-20 04:12:46,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267295,267308] [2022-07-20 04:12:46,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267457,267470] [2022-07-20 04:12:46,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267616,267629] [2022-07-20 04:12:46,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267762,267775] [2022-07-20 04:12:46,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267905,267918] [2022-07-20 04:12:46,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268049,268062] [2022-07-20 04:12:46,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268192,268205] [2022-07-20 04:12:46,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268336,268349] [2022-07-20 04:12:46,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268477,268490] [2022-07-20 04:12:46,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268615,268628] [2022-07-20 04:12:46,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268773,268786] [2022-07-20 04:12:46,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268932,268945] [2022-07-20 04:12:46,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269088,269101] [2022-07-20 04:12:46,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269237,269250] [2022-07-20 04:12:46,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269389,269402] [2022-07-20 04:12:46,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269540,269553] [2022-07-20 04:12:46,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269689,269702] [2022-07-20 04:12:46,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269841,269854] [2022-07-20 04:12:46,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269989,270002] [2022-07-20 04:12:46,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-20 04:12:46,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270892,270905] [2022-07-20 04:12:46,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271040,271053] [2022-07-20 04:12:46,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271206,271219] [2022-07-20 04:12:46,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271375,271388] [2022-07-20 04:12:46,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271542,271555] [2022-07-20 04:12:46,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271710,271723] [2022-07-20 04:12:46,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271860,271873] [2022-07-20 04:12:46,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272007,272020] [2022-07-20 04:12:46,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272168,272181] [2022-07-20 04:12:46,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272338,272351] [2022-07-20 04:12:46,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272500,272513] [2022-07-20 04:12:46,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:12:46,452 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:12:46,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46 WrapperNode [2022-07-20 04:12:46,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:12:46,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:12:46,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:12:46,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:12:46,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,619 INFO L137 Inliner]: procedures = 508, calls = 1237, calls flagged for inlining = 228, calls inlined = 154, statements flattened = 2697 [2022-07-20 04:12:46,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:12:46,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:12:46,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:12:46,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:12:46,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:12:46,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:12:46,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:12:46,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:12:46,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (1/1) ... [2022-07-20 04:12:46,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:12:46,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:12:46,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 04:12:46,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 04:12:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:12:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:12:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 04:12:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 04:12:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:12:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:12:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:12:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:12:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-20 04:12:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-20 04:12:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2022-07-20 04:12:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2022-07-20 04:12:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:12:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:12:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:12:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:12:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:12:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:12:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:12:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:12:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:12:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:12:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:12:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:12:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:12:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:12:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:12:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-20 04:12:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-20 04:12:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 04:12:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:12:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:12:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:12:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:12:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:12:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:12:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:12:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:12:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:12:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-20 04:12:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-20 04:12:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:12:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:12:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-20 04:12:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-20 04:12:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 04:12:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 04:12:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:12:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:12:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-20 04:12:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-20 04:12:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:12:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:12:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:12:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:12:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:12:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:12:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:12:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 04:12:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:12:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:12:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-20 04:12:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-20 04:12:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:12:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:12:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 04:12:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 04:12:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2022-07-20 04:12:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2022-07-20 04:12:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 04:12:46,823 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 04:12:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:12:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:12:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:12:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:12:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-20 04:12:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-20 04:12:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-07-20 04:12:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-07-20 04:12:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:12:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:12:46,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:12:46,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:12:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-20 04:12:46,828 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-20 04:12:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:12:46,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:12:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-20 04:12:46,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-20 04:12:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:12:46,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:12:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:12:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:12:46,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:12:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:12:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-20 04:12:46,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-20 04:12:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_101 [2022-07-20 04:12:46,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_101 [2022-07-20 04:12:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:12:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-20 04:12:46,830 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-20 04:12:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:12:46,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:12:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-20 04:12:46,830 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-20 04:12:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:12:46,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:12:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 04:12:46,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 04:12:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 04:12:46,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 04:12:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-20 04:12:46,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-20 04:12:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:12:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:12:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:12:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:12:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:12:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:12:46,833 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:12:46,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:12:46,833 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-20 04:12:46,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-20 04:12:46,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:12:46,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:12:46,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2022-07-20 04:12:46,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2022-07-20 04:12:46,834 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 04:12:46,834 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 04:12:46,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:12:46,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:12:46,834 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2022-07-20 04:12:46,834 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2022-07-20 04:12:46,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:12:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:12:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:12:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:12:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:12:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:12:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:12:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-20 04:12:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-20 04:12:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:12:46,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:12:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:12:46,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:12:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:12:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure yurex_disconnect [2022-07-20 04:12:46,836 INFO L138 BoogieDeclarations]: Found implementation of procedure yurex_disconnect [2022-07-20 04:12:47,291 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:12:47,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:12:47,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:12:49,536 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:12:49,552 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:12:49,552 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 04:12:49,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:12:49 BoogieIcfgContainer [2022-07-20 04:12:49,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:12:49,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:12:49,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:12:49,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:12:49,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:12:44" (1/3) ... [2022-07-20 04:12:49,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e74a3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:12:49, skipping insertion in model container [2022-07-20 04:12:49,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:46" (2/3) ... [2022-07-20 04:12:49,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e74a3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:12:49, skipping insertion in model container [2022-07-20 04:12:49,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:12:49" (3/3) ... [2022-07-20 04:12:49,562 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2022-07-20 04:12:49,572 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:12:49,572 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-20 04:12:49,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:12:49,648 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@32341d0d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25995907 [2022-07-20 04:12:49,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-20 04:12:49,654 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-20 04:12:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 04:12:49,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:49,666 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-20 04:12:49,666 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-20 04:12:49,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 150450018, now seen corresponding path program 1 times [2022-07-20 04:12:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:49,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658202668] [2022-07-20 04:12:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:50,233 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-20 04:12:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:50,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658202668] [2022-07-20 04:12:50,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658202668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:50,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:50,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873564720] [2022-07-20 04:12:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:50,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:50,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:50,264 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-20 04:12:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:52,070 INFO L93 Difference]: Finished difference Result 1903 states and 2593 transitions. [2022-07-20 04:12:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:52,072 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-20 04:12:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:52,098 INFO L225 Difference]: With dead ends: 1903 [2022-07-20 04:12:52,103 INFO L226 Difference]: Without dead ends: 957 [2022-07-20 04:12:52,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:12:52,117 INFO L413 NwaCegarLoop]: 1185 mSDtfsCounter, 1754 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:52,118 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.5s Time] [2022-07-20 04:12:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-07-20 04:12:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2022-07-20 04:12:52,242 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-20 04:12:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1225 transitions. [2022-07-20 04:12:52,248 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1225 transitions. Word has length 71 [2022-07-20 04:12:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:52,249 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1225 transitions. [2022-07-20 04:12:52,249 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-20 04:12:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1225 transitions. [2022-07-20 04:12:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 04:12:52,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:52,252 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-20 04:12:52,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:12:52,253 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-20 04:12:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash 395296491, now seen corresponding path program 1 times [2022-07-20 04:12:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:52,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535912119] [2022-07-20 04:12:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:52,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,420 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-20 04:12:52,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:52,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535912119] [2022-07-20 04:12:52,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535912119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:52,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:52,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8415865] [2022-07-20 04:12:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:52,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:52,423 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-20 04:12:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:54,085 INFO L93 Difference]: Finished difference Result 957 states and 1225 transitions. [2022-07-20 04:12:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:54,119 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-20 04:12:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:54,123 INFO L225 Difference]: With dead ends: 957 [2022-07-20 04:12:54,123 INFO L226 Difference]: Without dead ends: 955 [2022-07-20 04:12:54,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:12:54,124 INFO L413 NwaCegarLoop]: 1165 mSDtfsCounter, 1720 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:54,125 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.5s Time] [2022-07-20 04:12:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-07-20 04:12:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-07-20 04:12:54,159 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-20 04:12:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1223 transitions. [2022-07-20 04:12:54,163 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1223 transitions. Word has length 77 [2022-07-20 04:12:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:54,163 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1223 transitions. [2022-07-20 04:12:54,164 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-20 04:12:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1223 transitions. [2022-07-20 04:12:54,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 04:12:54,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:54,166 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-20 04:12:54,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:12:54,166 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-20 04:12:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1728180818, now seen corresponding path program 1 times [2022-07-20 04:12:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:54,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976286676] [2022-07-20 04:12:54,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,353 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-20 04:12:54,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:54,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976286676] [2022-07-20 04:12:54,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976286676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:54,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:54,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:54,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037458018] [2022-07-20 04:12:54,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:54,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:54,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:54,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:54,356 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-20 04:12:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:55,992 INFO L93 Difference]: Finished difference Result 955 states and 1223 transitions. [2022-07-20 04:12:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:55,992 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-20 04:12:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:55,997 INFO L225 Difference]: With dead ends: 955 [2022-07-20 04:12:55,997 INFO L226 Difference]: Without dead ends: 953 [2022-07-20 04:12:55,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:12:55,998 INFO L413 NwaCegarLoop]: 1163 mSDtfsCounter, 1714 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:55,999 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.5s Time] [2022-07-20 04:12:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-20 04:12:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2022-07-20 04:12:56,027 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-20 04:12:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1221 transitions. [2022-07-20 04:12:56,033 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1221 transitions. Word has length 83 [2022-07-20 04:12:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:56,033 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1221 transitions. [2022-07-20 04:12:56,034 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-20 04:12:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1221 transitions. [2022-07-20 04:12:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-20 04:12:56,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:56,035 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-20 04:12:56,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:12:56,035 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-20 04:12:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2012755007, now seen corresponding path program 1 times [2022-07-20 04:12:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:56,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944376662] [2022-07-20 04:12:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:56,236 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-20 04:12:56,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:56,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944376662] [2022-07-20 04:12:56,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944376662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:56,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:56,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:56,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163596735] [2022-07-20 04:12:56,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:56,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:56,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:56,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:56,238 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-20 04:12:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:57,903 INFO L93 Difference]: Finished difference Result 953 states and 1221 transitions. [2022-07-20 04:12:57,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:57,904 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-20 04:12:57,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:57,910 INFO L225 Difference]: With dead ends: 953 [2022-07-20 04:12:57,910 INFO L226 Difference]: Without dead ends: 951 [2022-07-20 04:12:57,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:12:57,914 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:57,915 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.6s Time] [2022-07-20 04:12:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-07-20 04:12:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2022-07-20 04:12:57,945 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-20 04:12:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1219 transitions. [2022-07-20 04:12:57,949 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1219 transitions. Word has length 89 [2022-07-20 04:12:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:57,949 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1219 transitions. [2022-07-20 04:12:57,950 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-20 04:12:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1219 transitions. [2022-07-20 04:12:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 04:12:57,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:57,955 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-20 04:12:57,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:12:57,956 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-20 04:12:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1710267306, now seen corresponding path program 1 times [2022-07-20 04:12:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:57,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683009373] [2022-07-20 04:12:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:58,183 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-20 04:12:58,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:58,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683009373] [2022-07-20 04:12:58,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683009373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:58,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:58,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793245628] [2022-07-20 04:12:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:58,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:58,185 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-20 04:12:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:59,678 INFO L93 Difference]: Finished difference Result 951 states and 1219 transitions. [2022-07-20 04:12:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:59,679 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-20 04:12:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:59,684 INFO L225 Difference]: With dead ends: 951 [2022-07-20 04:12:59,684 INFO L226 Difference]: Without dead ends: 949 [2022-07-20 04:12:59,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:12:59,685 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 1702 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:59,685 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.4s Time] [2022-07-20 04:12:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2022-07-20 04:12:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2022-07-20 04:12:59,710 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-20 04:12:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1217 transitions. [2022-07-20 04:12:59,714 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1217 transitions. Word has length 95 [2022-07-20 04:12:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:59,716 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1217 transitions. [2022-07-20 04:12:59,716 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-20 04:12:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1217 transitions. [2022-07-20 04:12:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-20 04:12:59,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:59,717 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-20 04:12:59,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:12:59,718 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-20 04:12:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1309820457, now seen corresponding path program 1 times [2022-07-20 04:12:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:59,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539005576] [2022-07-20 04:12:59,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:59,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:12:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:12:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:12:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:12:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:12:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:12:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:12:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,894 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-20 04:12:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:59,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539005576] [2022-07-20 04:12:59,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539005576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:59,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:59,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040696116] [2022-07-20 04:12:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:59,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:59,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:59,897 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-20 04:13:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:01,459 INFO L93 Difference]: Finished difference Result 949 states and 1217 transitions. [2022-07-20 04:13:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:01,460 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-20 04:13:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:01,465 INFO L225 Difference]: With dead ends: 949 [2022-07-20 04:13:01,465 INFO L226 Difference]: Without dead ends: 947 [2022-07-20 04:13:01,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:01,467 INFO L413 NwaCegarLoop]: 1157 mSDtfsCounter, 1696 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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-20 04:13:01,467 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-20 04:13:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-20 04:13:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2022-07-20 04:13:01,510 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-20 04:13:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1215 transitions. [2022-07-20 04:13:01,515 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1215 transitions. Word has length 101 [2022-07-20 04:13:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:01,515 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1215 transitions. [2022-07-20 04:13:01,515 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-20 04:13:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1215 transitions. [2022-07-20 04:13:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 04:13:01,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:01,517 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-20 04:13:01,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:13:01,517 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-20 04:13:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1917796044, now seen corresponding path program 1 times [2022-07-20 04:13:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:01,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972579107] [2022-07-20 04:13:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:01,705 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-20 04:13:01,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:01,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972579107] [2022-07-20 04:13:01,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972579107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:01,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:01,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72294164] [2022-07-20 04:13:01,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:01,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:01,707 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-20 04:13:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:03,338 INFO L93 Difference]: Finished difference Result 947 states and 1215 transitions. [2022-07-20 04:13:03,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:03,339 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-20 04:13:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:03,344 INFO L225 Difference]: With dead ends: 947 [2022-07-20 04:13:03,344 INFO L226 Difference]: Without dead ends: 945 [2022-07-20 04:13:03,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:03,346 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 1690 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:03,346 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.5s Time] [2022-07-20 04:13:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-20 04:13:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2022-07-20 04:13:03,372 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-20 04:13:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1213 transitions. [2022-07-20 04:13:03,375 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1213 transitions. Word has length 107 [2022-07-20 04:13:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:03,376 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1213 transitions. [2022-07-20 04:13:03,376 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-20 04:13:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1213 transitions. [2022-07-20 04:13:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-20 04:13:03,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:03,378 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-20 04:13:03,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 04:13:03,378 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-20 04:13:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash -334687362, now seen corresponding path program 1 times [2022-07-20 04:13:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:03,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10309706] [2022-07-20 04:13:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:03,543 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-20 04:13:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:03,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10309706] [2022-07-20 04:13:03,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10309706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:03,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:03,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24415061] [2022-07-20 04:13:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:03,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:03,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:03,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:03,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:03,545 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-20 04:13:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:05,044 INFO L93 Difference]: Finished difference Result 945 states and 1213 transitions. [2022-07-20 04:13:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:05,044 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-20 04:13:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:05,048 INFO L225 Difference]: With dead ends: 945 [2022-07-20 04:13:05,048 INFO L226 Difference]: Without dead ends: 943 [2022-07-20 04:13:05,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:05,049 INFO L413 NwaCegarLoop]: 1153 mSDtfsCounter, 1688 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:05,050 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.4s Time] [2022-07-20 04:13:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-07-20 04:13:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2022-07-20 04:13:05,073 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-20 04:13:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1211 transitions. [2022-07-20 04:13:05,076 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1211 transitions. Word has length 113 [2022-07-20 04:13:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:05,077 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1211 transitions. [2022-07-20 04:13:05,077 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-20 04:13:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1211 transitions. [2022-07-20 04:13:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-20 04:13:05,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:05,078 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-20 04:13:05,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 04:13:05,079 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-20 04:13:05,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash 488135713, now seen corresponding path program 1 times [2022-07-20 04:13:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:05,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599012001] [2022-07-20 04:13:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:05,235 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-20 04:13:05,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:05,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599012001] [2022-07-20 04:13:05,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599012001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:05,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:05,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:05,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022081611] [2022-07-20 04:13:05,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:05,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:05,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:05,238 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-20 04:13:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:06,737 INFO L93 Difference]: Finished difference Result 943 states and 1211 transitions. [2022-07-20 04:13:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:06,738 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-20 04:13:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:06,741 INFO L225 Difference]: With dead ends: 943 [2022-07-20 04:13:06,742 INFO L226 Difference]: Without dead ends: 941 [2022-07-20 04:13:06,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:06,744 INFO L413 NwaCegarLoop]: 1151 mSDtfsCounter, 1676 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:06,744 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.4s Time] [2022-07-20 04:13:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-20 04:13:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2022-07-20 04:13:06,770 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-20 04:13:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1209 transitions. [2022-07-20 04:13:06,794 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1209 transitions. Word has length 115 [2022-07-20 04:13:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:06,794 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1209 transitions. [2022-07-20 04:13:06,794 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-20 04:13:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1209 transitions. [2022-07-20 04:13:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-20 04:13:06,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:06,796 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-20 04:13:06,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:13:06,796 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-20 04:13:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1281926017, now seen corresponding path program 1 times [2022-07-20 04:13:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:06,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855121710] [2022-07-20 04:13:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,943 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-20 04:13:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:06,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855121710] [2022-07-20 04:13:06,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855121710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:06,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:06,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266035235] [2022-07-20 04:13:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:06,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:06,946 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-20 04:13:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:08,403 INFO L93 Difference]: Finished difference Result 941 states and 1209 transitions. [2022-07-20 04:13:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:08,407 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-20 04:13:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:08,411 INFO L225 Difference]: With dead ends: 941 [2022-07-20 04:13:08,411 INFO L226 Difference]: Without dead ends: 939 [2022-07-20 04:13:08,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:08,412 INFO L413 NwaCegarLoop]: 1149 mSDtfsCounter, 1672 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:08,412 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.4s Time] [2022-07-20 04:13:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-20 04:13:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2022-07-20 04:13:08,443 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-20 04:13:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1207 transitions. [2022-07-20 04:13:08,446 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1207 transitions. Word has length 121 [2022-07-20 04:13:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:08,447 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1207 transitions. [2022-07-20 04:13:08,447 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-20 04:13:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1207 transitions. [2022-07-20 04:13:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 04:13:08,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:08,448 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-20 04:13:08,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:13:08,449 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-20 04:13:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1200561438, now seen corresponding path program 1 times [2022-07-20 04:13:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:08,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086312595] [2022-07-20 04:13:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:08,623 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-20 04:13:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:08,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086312595] [2022-07-20 04:13:08,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086312595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:08,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:08,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070029001] [2022-07-20 04:13:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:08,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:08,626 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-20 04:13:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:10,145 INFO L93 Difference]: Finished difference Result 939 states and 1207 transitions. [2022-07-20 04:13:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:10,145 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-20 04:13:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:10,149 INFO L225 Difference]: With dead ends: 939 [2022-07-20 04:13:10,149 INFO L226 Difference]: Without dead ends: 937 [2022-07-20 04:13:10,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:10,150 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 1666 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:10,150 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.4s Time] [2022-07-20 04:13:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-07-20 04:13:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2022-07-20 04:13:10,179 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-20 04:13:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1205 transitions. [2022-07-20 04:13:10,182 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1205 transitions. Word has length 127 [2022-07-20 04:13:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:10,182 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1205 transitions. [2022-07-20 04:13:10,182 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-20 04:13:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1205 transitions. [2022-07-20 04:13:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-20 04:13:10,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:10,192 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-20 04:13:10,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 04:13:10,192 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-20 04:13:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1108051758, now seen corresponding path program 1 times [2022-07-20 04:13:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:10,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58061721] [2022-07-20 04:13:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:13:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:13:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:10,512 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-20 04:13:10,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58061721] [2022-07-20 04:13:10,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58061721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:10,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:10,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:13:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715817544] [2022-07-20 04:13:10,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:10,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:13:10,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:13:10,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:13:10,514 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-20 04:13:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:13,343 INFO L93 Difference]: Finished difference Result 1858 states and 2401 transitions. [2022-07-20 04:13:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:13:13,343 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-20 04:13:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:13,347 INFO L225 Difference]: With dead ends: 1858 [2022-07-20 04:13:13,347 INFO L226 Difference]: Without dead ends: 961 [2022-07-20 04:13:13,349 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-20 04:13:13,350 INFO L413 NwaCegarLoop]: 1140 mSDtfsCounter, 1967 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:13,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 3788 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-20 04:13:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-07-20 04:13:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 937. [2022-07-20 04:13:13,383 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-20 04:13:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1204 transitions. [2022-07-20 04:13:13,386 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1204 transitions. Word has length 171 [2022-07-20 04:13:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:13,386 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1204 transitions. [2022-07-20 04:13:13,386 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-20 04:13:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1204 transitions. [2022-07-20 04:13:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-20 04:13:13,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:13,388 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-20 04:13:13,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:13:13,388 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-20 04:13:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1107992176, now seen corresponding path program 1 times [2022-07-20 04:13:13,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:13,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131194150] [2022-07-20 04:13:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:13:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:13:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,616 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-20 04:13:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:13,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131194150] [2022-07-20 04:13:13,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131194150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:13,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:13,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:13:13,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652213729] [2022-07-20 04:13:13,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:13,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:13:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:13,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:13:13,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:13:13,619 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-20 04:13:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:16,012 INFO L93 Difference]: Finished difference Result 961 states and 1238 transitions. [2022-07-20 04:13:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:13:16,013 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-20 04:13:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:16,016 INFO L225 Difference]: With dead ends: 961 [2022-07-20 04:13:16,016 INFO L226 Difference]: Without dead ends: 959 [2022-07-20 04:13:16,017 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-20 04:13:16,017 INFO L413 NwaCegarLoop]: 1140 mSDtfsCounter, 1049 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:16,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 3399 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 04:13:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-20 04:13:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 935. [2022-07-20 04:13:16,050 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-20 04:13:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1202 transitions. [2022-07-20 04:13:16,053 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1202 transitions. Word has length 171 [2022-07-20 04:13:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:16,055 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1202 transitions. [2022-07-20 04:13:16,055 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-20 04:13:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1202 transitions. [2022-07-20 04:13:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-20 04:13:16,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:16,057 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-20 04:13:16,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:13:16,057 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-20 04:13:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1944874354, now seen corresponding path program 1 times [2022-07-20 04:13:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:16,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065361933] [2022-07-20 04:13:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:16,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,205 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-20 04:13:16,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:16,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065361933] [2022-07-20 04:13:16,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065361933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:16,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:16,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380776778] [2022-07-20 04:13:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:16,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:16,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:16,207 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-20 04:13:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:17,670 INFO L93 Difference]: Finished difference Result 935 states and 1202 transitions. [2022-07-20 04:13:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:17,671 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-20 04:13:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:17,674 INFO L225 Difference]: With dead ends: 935 [2022-07-20 04:13:17,674 INFO L226 Difference]: Without dead ends: 933 [2022-07-20 04:13:17,675 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-20 04:13:17,675 INFO L413 NwaCegarLoop]: 1142 mSDtfsCounter, 1651 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:17,676 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.4s Time] [2022-07-20 04:13:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-07-20 04:13:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2022-07-20 04:13:17,707 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-20 04:13:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1200 transitions. [2022-07-20 04:13:17,709 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1200 transitions. Word has length 133 [2022-07-20 04:13:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:17,710 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1200 transitions. [2022-07-20 04:13:17,710 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-20 04:13:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1200 transitions. [2022-07-20 04:13:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-20 04:13:17,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:17,713 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-20 04:13:17,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 04:13:17,713 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-20 04:13:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash 157610685, now seen corresponding path program 1 times [2022-07-20 04:13:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:17,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125584869] [2022-07-20 04:13:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:13:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 04:13:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:17,934 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-20 04:13:17,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:17,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125584869] [2022-07-20 04:13:17,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125584869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:17,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:17,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286835591] [2022-07-20 04:13:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:17,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:17,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:17,937 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-20 04:13:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:19,612 INFO L93 Difference]: Finished difference Result 1846 states and 2387 transitions. [2022-07-20 04:13:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:19,613 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-20 04:13:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:19,617 INFO L225 Difference]: With dead ends: 1846 [2022-07-20 04:13:19,617 INFO L226 Difference]: Without dead ends: 953 [2022-07-20 04:13:19,619 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-20 04:13:19,620 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 1922 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2079 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:19,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2079 Valid, 2288 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-20 04:13:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-20 04:13:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 929. [2022-07-20 04:13:19,657 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-20 04:13:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1195 transitions. [2022-07-20 04:13:19,661 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1195 transitions. Word has length 178 [2022-07-20 04:13:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:19,662 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1195 transitions. [2022-07-20 04:13:19,662 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-20 04:13:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1195 transitions. [2022-07-20 04:13:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-20 04:13:19,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:19,663 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-20 04:13:19,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:13:19,664 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-20 04:13:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1224799676, now seen corresponding path program 1 times [2022-07-20 04:13:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:19,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383192715] [2022-07-20 04:13:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,876 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-20 04:13:19,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383192715] [2022-07-20 04:13:19,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383192715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:19,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:19,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608538631] [2022-07-20 04:13:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:19,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:19,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:19,879 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-20 04:13:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:21,306 INFO L93 Difference]: Finished difference Result 929 states and 1195 transitions. [2022-07-20 04:13:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:21,306 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-20 04:13:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:21,310 INFO L225 Difference]: With dead ends: 929 [2022-07-20 04:13:21,310 INFO L226 Difference]: Without dead ends: 927 [2022-07-20 04:13:21,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:13:21,311 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 1630 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:21,312 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.3s Time] [2022-07-20 04:13:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-07-20 04:13:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2022-07-20 04:13:21,356 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-20 04:13:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1193 transitions. [2022-07-20 04:13:21,358 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1193 transitions. Word has length 139 [2022-07-20 04:13:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:21,359 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1193 transitions. [2022-07-20 04:13:21,359 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-20 04:13:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1193 transitions. [2022-07-20 04:13:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-20 04:13:21,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:21,361 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-20 04:13:21,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:13:21,361 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-20 04:13:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash 249948283, now seen corresponding path program 1 times [2022-07-20 04:13:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:21,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257195087] [2022-07-20 04:13:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:21,518 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-20 04:13:21,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:21,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257195087] [2022-07-20 04:13:21,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257195087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:21,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:21,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371727940] [2022-07-20 04:13:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:21,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:21,521 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-20 04:13:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:23,071 INFO L93 Difference]: Finished difference Result 927 states and 1193 transitions. [2022-07-20 04:13:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:23,071 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-20 04:13:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:23,074 INFO L225 Difference]: With dead ends: 927 [2022-07-20 04:13:23,075 INFO L226 Difference]: Without dead ends: 925 [2022-07-20 04:13:23,075 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-20 04:13:23,075 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-20 04:13:23,076 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-20 04:13:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-07-20 04:13:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2022-07-20 04:13:23,124 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-20 04:13:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1191 transitions. [2022-07-20 04:13:23,127 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1191 transitions. Word has length 145 [2022-07-20 04:13:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:23,127 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1191 transitions. [2022-07-20 04:13:23,128 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-20 04:13:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1191 transitions. [2022-07-20 04:13:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-20 04:13:23,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:23,129 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-20 04:13:23,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 04:13:23,129 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-20 04:13:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:23,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1075121200, now seen corresponding path program 1 times [2022-07-20 04:13:23,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:23,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34790765] [2022-07-20 04:13:23,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:23,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:23,306 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-20 04:13:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:23,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34790765] [2022-07-20 04:13:23,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34790765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:23,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:23,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674099281] [2022-07-20 04:13:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:23,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:23,309 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-20 04:13:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:24,827 INFO L93 Difference]: Finished difference Result 925 states and 1191 transitions. [2022-07-20 04:13:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:24,828 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-20 04:13:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:24,832 INFO L225 Difference]: With dead ends: 925 [2022-07-20 04:13:24,832 INFO L226 Difference]: Without dead ends: 923 [2022-07-20 04:13:24,832 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-20 04:13:24,833 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-20 04:13:24,833 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-20 04:13:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-07-20 04:13:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2022-07-20 04:13:24,905 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-20 04:13:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1189 transitions. [2022-07-20 04:13:24,908 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1189 transitions. Word has length 151 [2022-07-20 04:13:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:24,908 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1189 transitions. [2022-07-20 04:13:24,908 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-20 04:13:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1189 transitions. [2022-07-20 04:13:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-20 04:13:24,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:24,910 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-20 04:13:24,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 04:13:24,910 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-20 04:13:24,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1533945952, now seen corresponding path program 1 times [2022-07-20 04:13:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:24,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574409903] [2022-07-20 04:13:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:13:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 04:13:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 04:13:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:13:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:25,201 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-20 04:13:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574409903] [2022-07-20 04:13:25,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574409903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:25,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:25,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:13:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884030045] [2022-07-20 04:13:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:25,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:13:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:13:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:13:25,204 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-20 04:13:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:28,433 INFO L93 Difference]: Finished difference Result 1776 states and 2294 transitions. [2022-07-20 04:13:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:13:28,433 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-20 04:13:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:28,446 INFO L225 Difference]: With dead ends: 1776 [2022-07-20 04:13:28,446 INFO L226 Difference]: Without dead ends: 1147 [2022-07-20 04:13:28,447 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-20 04:13:28,448 INFO L413 NwaCegarLoop]: 1226 mSDtfsCounter, 1349 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 3639 mSolverCounterSat, 1052 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 4728 SdHoareTripleChecker+Invalid, 4691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1052 IncrementalHoareTripleChecker+Valid, 3639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:28,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 4728 Invalid, 4691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1052 Valid, 3639 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-20 04:13:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-20 04:13:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 928. [2022-07-20 04:13:28,498 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-20 04:13:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1197 transitions. [2022-07-20 04:13:28,500 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1197 transitions. Word has length 187 [2022-07-20 04:13:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:28,501 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1197 transitions. [2022-07-20 04:13:28,501 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-20 04:13:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1197 transitions. [2022-07-20 04:13:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 04:13:28,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:28,502 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-20 04:13:28,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 04:13:28,503 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-20 04:13:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash -576056608, now seen corresponding path program 1 times [2022-07-20 04:13:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:28,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081658475] [2022-07-20 04:13:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,689 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-20 04:13:28,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:28,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081658475] [2022-07-20 04:13:28,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081658475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:28,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:28,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906034558] [2022-07-20 04:13:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:28,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:28,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:28,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:28,691 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-20 04:13:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:30,086 INFO L93 Difference]: Finished difference Result 928 states and 1197 transitions. [2022-07-20 04:13:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:30,087 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-20 04:13:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:30,090 INFO L225 Difference]: With dead ends: 928 [2022-07-20 04:13:30,090 INFO L226 Difference]: Without dead ends: 926 [2022-07-20 04:13:30,091 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-20 04:13:30,091 INFO L413 NwaCegarLoop]: 1129 mSDtfsCounter, 1612 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:30,091 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.3s Time] [2022-07-20 04:13:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-07-20 04:13:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2022-07-20 04:13:30,163 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-20 04:13:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1195 transitions. [2022-07-20 04:13:30,164 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1195 transitions. Word has length 157 [2022-07-20 04:13:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:30,165 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 1195 transitions. [2022-07-20 04:13:30,165 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-20 04:13:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1195 transitions. [2022-07-20 04:13:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-20 04:13:30,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:30,166 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-20 04:13:30,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:13:30,166 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-20 04:13:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1565188194, now seen corresponding path program 1 times [2022-07-20 04:13:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:30,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63143917] [2022-07-20 04:13:30,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,321 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-20 04:13:30,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:30,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63143917] [2022-07-20 04:13:30,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63143917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:30,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:30,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:30,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813242422] [2022-07-20 04:13:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:30,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:30,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:30,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:30,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:30,325 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-20 04:13:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:31,770 INFO L93 Difference]: Finished difference Result 926 states and 1195 transitions. [2022-07-20 04:13:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:31,771 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-20 04:13:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:31,774 INFO L225 Difference]: With dead ends: 926 [2022-07-20 04:13:31,775 INFO L226 Difference]: Without dead ends: 924 [2022-07-20 04:13:31,775 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-20 04:13:31,776 INFO L413 NwaCegarLoop]: 1127 mSDtfsCounter, 1606 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:31,776 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.3s Time] [2022-07-20 04:13:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-07-20 04:13:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2022-07-20 04:13:31,820 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-20 04:13:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1193 transitions. [2022-07-20 04:13:31,822 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1193 transitions. Word has length 163 [2022-07-20 04:13:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:31,823 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1193 transitions. [2022-07-20 04:13:31,823 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-20 04:13:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1193 transitions. [2022-07-20 04:13:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-20 04:13:31,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:31,825 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-20 04:13:31,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:13:31,825 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-20 04:13:31,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1293557537, now seen corresponding path program 1 times [2022-07-20 04:13:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:31,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011722227] [2022-07-20 04:13:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:13:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:13:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:13:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 04:13:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 04:13:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:32,069 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-20 04:13:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:32,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011722227] [2022-07-20 04:13:32,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011722227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:32,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:32,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:13:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652195003] [2022-07-20 04:13:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:32,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:13:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:13:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:13:32,071 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-20 04:13:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:33,810 INFO L93 Difference]: Finished difference Result 1685 states and 2151 transitions. [2022-07-20 04:13:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:33,811 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-20 04:13:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:33,815 INFO L225 Difference]: With dead ends: 1685 [2022-07-20 04:13:33,815 INFO L226 Difference]: Without dead ends: 944 [2022-07-20 04:13:33,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:13:33,818 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 2116 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 1195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1195 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:33,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 2086 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1195 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-20 04:13:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-07-20 04:13:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 920. [2022-07-20 04:13:33,871 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-20 04:13:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1188 transitions. [2022-07-20 04:13:33,874 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1188 transitions. Word has length 207 [2022-07-20 04:13:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:33,875 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1188 transitions. [2022-07-20 04:13:33,875 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-20 04:13:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1188 transitions. [2022-07-20 04:13:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-20 04:13:33,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:33,877 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-20 04:13:33,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 04:13:33,878 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-20 04:13:33,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:33,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1601264781, now seen corresponding path program 1 times [2022-07-20 04:13:33,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:33,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494411192] [2022-07-20 04:13:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:13:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,083 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-20 04:13:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:34,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494411192] [2022-07-20 04:13:34,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494411192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:34,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:34,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439825106] [2022-07-20 04:13:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:34,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:34,086 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-20 04:13:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:35,695 INFO L93 Difference]: Finished difference Result 920 states and 1188 transitions. [2022-07-20 04:13:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:35,696 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-20 04:13:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:35,700 INFO L225 Difference]: With dead ends: 920 [2022-07-20 04:13:35,700 INFO L226 Difference]: Without dead ends: 918 [2022-07-20 04:13:35,701 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-20 04:13:35,702 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 1595 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:35,702 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.5s Time] [2022-07-20 04:13:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-07-20 04:13:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2022-07-20 04:13:35,752 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-20 04:13:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1186 transitions. [2022-07-20 04:13:35,754 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1186 transitions. Word has length 169 [2022-07-20 04:13:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:35,754 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1186 transitions. [2022-07-20 04:13:35,755 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-20 04:13:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1186 transitions. [2022-07-20 04:13:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-20 04:13:35,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:35,757 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-20 04:13:35,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:13:35,757 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-20 04:13:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash 664104994, now seen corresponding path program 1 times [2022-07-20 04:13:35,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:35,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081834331] [2022-07-20 04:13:35,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:35,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:13:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:13:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:13:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 04:13:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-20 04:13:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 04:13:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:35,989 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-20 04:13:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:35,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081834331] [2022-07-20 04:13:35,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081834331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:35,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:35,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:13:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244578] [2022-07-20 04:13:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:35,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:13:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:35,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:13:35,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:13:35,992 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-20 04:13:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:38,464 INFO L93 Difference]: Finished difference Result 997 states and 1268 transitions. [2022-07-20 04:13:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:13:38,465 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-20 04:13:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:38,469 INFO L225 Difference]: With dead ends: 997 [2022-07-20 04:13:38,469 INFO L226 Difference]: Without dead ends: 995 [2022-07-20 04:13:38,470 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-20 04:13:38,471 INFO L413 NwaCegarLoop]: 1113 mSDtfsCounter, 1835 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 992 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 3470 SdHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 992 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:38,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 3470 Invalid, 3085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [992 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 04:13:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-20 04:13:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 969. [2022-07-20 04:13:38,520 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-20 04:13:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1235 transitions. [2022-07-20 04:13:38,523 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1235 transitions. Word has length 203 [2022-07-20 04:13:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:38,524 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1235 transitions. [2022-07-20 04:13:38,524 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-20 04:13:38,524 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1235 transitions. [2022-07-20 04:13:38,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-20 04:13:38,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:38,526 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-20 04:13:38,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:13:38,526 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-20 04:13:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 577814734, now seen corresponding path program 1 times [2022-07-20 04:13:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:38,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721353285] [2022-07-20 04:13:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:13:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:13:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:13:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 04:13:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 04:13:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:13:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:38,761 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-20 04:13:38,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:38,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721353285] [2022-07-20 04:13:38,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721353285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:13:38,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925862453] [2022-07-20 04:13:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:38,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:13:38,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:13:38,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:13:38,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 04:13:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 2025 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 04:13:39,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:13:39,553 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-20 04:13:39,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:13:39,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925862453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:39,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:13:39,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-20 04:13:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317784765] [2022-07-20 04:13:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:39,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:13:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:13:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:13:39,555 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-20 04:13:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:39,623 INFO L93 Difference]: Finished difference Result 1804 states and 2270 transitions. [2022-07-20 04:13:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:13:39,623 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-20 04:13:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:39,628 INFO L225 Difference]: With dead ends: 1804 [2022-07-20 04:13:39,628 INFO L226 Difference]: Without dead ends: 1021 [2022-07-20 04:13:39,630 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-20 04:13:39,630 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-20 04:13:39,633 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-20 04:13:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-07-20 04:13:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1018. [2022-07-20 04:13:39,689 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-20 04:13:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1295 transitions. [2022-07-20 04:13:39,691 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1295 transitions. Word has length 213 [2022-07-20 04:13:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:39,692 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 1295 transitions. [2022-07-20 04:13:39,692 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-20 04:13:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1295 transitions. [2022-07-20 04:13:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-20 04:13:39,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:39,694 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-20 04:13:39,734 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-20 04:13:39,903 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-20 04:13:39,904 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-20 04:13:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1999876672, now seen corresponding path program 1 times [2022-07-20 04:13:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:39,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918893957] [2022-07-20 04:13:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:39,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:13:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:13:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,087 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-20 04:13:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:40,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918893957] [2022-07-20 04:13:40,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918893957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:40,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:40,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478005460] [2022-07-20 04:13:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:40,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:40,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:40,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:40,089 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-20 04:13:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:42,649 INFO L93 Difference]: Finished difference Result 1873 states and 2381 transitions. [2022-07-20 04:13:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:13:42,649 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-20 04:13:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:42,656 INFO L225 Difference]: With dead ends: 1873 [2022-07-20 04:13:42,656 INFO L226 Difference]: Without dead ends: 1871 [2022-07-20 04:13:42,657 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-20 04:13:42,658 INFO L413 NwaCegarLoop]: 1303 mSDtfsCounter, 2246 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 1116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 3167 SdHoareTripleChecker+Invalid, 3234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1116 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:42,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 3167 Invalid, 3234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1116 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 04:13:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-07-20 04:13:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1840. [2022-07-20 04:13:42,774 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-20 04:13:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2354 transitions. [2022-07-20 04:13:42,778 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2354 transitions. Word has length 175 [2022-07-20 04:13:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:42,778 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 2354 transitions. [2022-07-20 04:13:42,778 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-20 04:13:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2354 transitions. [2022-07-20 04:13:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-20 04:13:42,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:42,780 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-20 04:13:42,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 04:13:42,781 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-20 04:13:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1330314272, now seen corresponding path program 1 times [2022-07-20 04:13:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:42,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202158446] [2022-07-20 04:13:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:13:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:13:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 04:13:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:42,968 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-20 04:13:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:42,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202158446] [2022-07-20 04:13:42,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202158446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:42,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:42,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130889266] [2022-07-20 04:13:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:42,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:42,970 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-20 04:13:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:44,493 INFO L93 Difference]: Finished difference Result 1840 states and 2354 transitions. [2022-07-20 04:13:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:44,494 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-20 04:13:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:44,500 INFO L225 Difference]: With dead ends: 1840 [2022-07-20 04:13:44,500 INFO L226 Difference]: Without dead ends: 1838 [2022-07-20 04:13:44,501 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-20 04:13:44,501 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-20 04:13:44,502 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-20 04:13:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-07-20 04:13:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2022-07-20 04:13:44,649 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-20 04:13:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2352 transitions. [2022-07-20 04:13:44,654 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2352 transitions. Word has length 181 [2022-07-20 04:13:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:44,655 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2352 transitions. [2022-07-20 04:13:44,655 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-20 04:13:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2352 transitions. [2022-07-20 04:13:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-20 04:13:44,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:44,658 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-20 04:13:44,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 04:13:44,658 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-20 04:13:44,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:44,659 INFO L85 PathProgramCache]: Analyzing trace with hash -878657064, now seen corresponding path program 1 times [2022-07-20 04:13:44,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:44,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134136384] [2022-07-20 04:13:44,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:44,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:13:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:13:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 04:13:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 04:13:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-20 04:13:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 04:13:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-20 04:13:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:44,933 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-20 04:13:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:44,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134136384] [2022-07-20 04:13:44,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134136384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:44,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:44,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:13:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625984554] [2022-07-20 04:13:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:44,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:13:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:13:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:13:44,935 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-20 04:13:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:48,025 INFO L93 Difference]: Finished difference Result 1915 states and 2454 transitions. [2022-07-20 04:13:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 04:13:48,025 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-20 04:13:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:48,031 INFO L225 Difference]: With dead ends: 1915 [2022-07-20 04:13:48,032 INFO L226 Difference]: Without dead ends: 1913 [2022-07-20 04:13:48,032 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-20 04:13:48,033 INFO L413 NwaCegarLoop]: 1138 mSDtfsCounter, 1503 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 1149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 4148 SdHoareTripleChecker+Invalid, 4061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1149 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:48,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 4148 Invalid, 4061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1149 Valid, 2912 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-20 04:13:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-07-20 04:13:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1847. [2022-07-20 04:13:48,137 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-20 04:13:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2363 transitions. [2022-07-20 04:13:48,141 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2363 transitions. Word has length 214 [2022-07-20 04:13:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:48,141 INFO L495 AbstractCegarLoop]: Abstraction has 1847 states and 2363 transitions. [2022-07-20 04:13:48,142 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-20 04:13:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2363 transitions. [2022-07-20 04:13:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-20 04:13:48,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:48,144 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-20 04:13:48,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 04:13:48,144 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-20 04:13:48,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -701955474, now seen corresponding path program 1 times [2022-07-20 04:13:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:48,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835905294] [2022-07-20 04:13:48,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 04:13:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 04:13:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 04:13:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 04:13:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 04:13:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:13:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 04:13:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 04:13:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 04:13:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 04:13:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 04:13:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 04:13:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 04:13:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,290 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-20 04:13:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:48,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835905294] [2022-07-20 04:13:48,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835905294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:48,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:48,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238291614] [2022-07-20 04:13:48,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:48,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:48,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:48,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:48,293 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-20 04:13:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:50,901 INFO L93 Difference]: Finished difference Result 3551 states and 4564 transitions. [2022-07-20 04:13:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:13:50,902 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-20 04:13:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:50,914 INFO L225 Difference]: With dead ends: 3551 [2022-07-20 04:13:50,914 INFO L226 Difference]: Without dead ends: 3393 [2022-07-20 04:13:50,917 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-20 04:13:50,917 INFO L413 NwaCegarLoop]: 1346 mSDtfsCounter, 2215 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 1099 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:50,917 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.3s Time] [2022-07-20 04:13:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-07-20 04:13:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3375. [2022-07-20 04:13:51,132 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-20 04:13:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 4367 transitions. [2022-07-20 04:13:51,143 INFO L78 Accepts]: Start accepts. Automaton has 3375 states and 4367 transitions. Word has length 187 [2022-07-20 04:13:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:51,144 INFO L495 AbstractCegarLoop]: Abstraction has 3375 states and 4367 transitions. [2022-07-20 04:13:51,144 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-20 04:13:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3375 states and 4367 transitions. [2022-07-20 04:13:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-20 04:13:51,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:51,147 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-20 04:13:51,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 04:13:51,147 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-20 04:13:51,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash -429016518, now seen corresponding path program 1 times [2022-07-20 04:13:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:51,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719766906] [2022-07-20 04:13:51,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:51,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:13:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:13:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:13:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 04:13:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 04:13:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:13:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-20 04:13:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 04:13:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:51,382 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-20 04:13:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:51,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719766906] [2022-07-20 04:13:51,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719766906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:51,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:51,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:13:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248959909] [2022-07-20 04:13:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:51,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:13:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:13:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:13:51,384 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-20 04:13:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:55,460 INFO L93 Difference]: Finished difference Result 7596 states and 10040 transitions. [2022-07-20 04:13:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:13:55,461 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-20 04:13:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:55,473 INFO L225 Difference]: With dead ends: 7596 [2022-07-20 04:13:55,474 INFO L226 Difference]: Without dead ends: 4675 [2022-07-20 04:13:55,480 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-20 04:13:55,481 INFO L413 NwaCegarLoop]: 1581 mSDtfsCounter, 1215 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:55,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 4608 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-20 04:13:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2022-07-20 04:13:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 3387. [2022-07-20 04:13:55,718 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-20 04:13:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4382 transitions. [2022-07-20 04:13:55,727 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4382 transitions. Word has length 234 [2022-07-20 04:13:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:55,727 INFO L495 AbstractCegarLoop]: Abstraction has 3387 states and 4382 transitions. [2022-07-20 04:13:55,727 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-20 04:13:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4382 transitions. [2022-07-20 04:13:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-20 04:13:55,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:55,730 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-20 04:13:55,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 04:13:55,730 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-20 04:13:55,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash 370781952, now seen corresponding path program 1 times [2022-07-20 04:13:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:55,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814224381] [2022-07-20 04:13:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:13:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:13:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:13:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:13:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 04:13:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-20 04:13:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:13:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-20 04:13:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:55,970 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-20 04:13:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814224381] [2022-07-20 04:13:55,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814224381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:55,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:55,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:13:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217162998] [2022-07-20 04:13:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:55,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:13:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:13:55,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:13:55,972 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-20 04:13:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:58,601 INFO L93 Difference]: Finished difference Result 6392 states and 8277 transitions. [2022-07-20 04:13:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:13:58,601 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-20 04:13:58,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:58,611 INFO L225 Difference]: With dead ends: 6392 [2022-07-20 04:13:58,611 INFO L226 Difference]: Without dead ends: 3461 [2022-07-20 04:13:58,616 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-20 04:13:58,617 INFO L413 NwaCegarLoop]: 1105 mSDtfsCounter, 988 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 820 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 3859 SdHoareTripleChecker+Invalid, 3440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 820 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:58,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 3859 Invalid, 3440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [820 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 04:13:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2022-07-20 04:13:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3399. [2022-07-20 04:13:58,837 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-20 04:13:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4394 transitions. [2022-07-20 04:13:58,845 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4394 transitions. Word has length 228 [2022-07-20 04:13:58,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:58,846 INFO L495 AbstractCegarLoop]: Abstraction has 3399 states and 4394 transitions. [2022-07-20 04:13:58,846 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-20 04:13:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4394 transitions. [2022-07-20 04:13:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-20 04:13:58,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:58,849 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-20 04:13:58,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 04:13:58,849 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-20 04:13:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1623362754, now seen corresponding path program 1 times [2022-07-20 04:13:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:58,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728057831] [2022-07-20 04:13:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 04:13:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-20 04:13:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 04:13:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:13:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:13:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:13:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:13:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:13:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 04:13:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-20 04:13:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-20 04:13:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-20 04:13:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,120 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-20 04:13:59,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:59,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728057831] [2022-07-20 04:13:59,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728057831] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:13:59,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576050018] [2022-07-20 04:13:59,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:13:59,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:13:59,122 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:13:59,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 04:13:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:59,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 2193 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 04:13:59,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:00,062 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-20 04:14:00,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:14:00,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576050018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:00,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:14:00,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 18 [2022-07-20 04:14:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479240574] [2022-07-20 04:14:00,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:00,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 04:14:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:00,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 04:14:00,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2022-07-20 04:14:00,065 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-20 04:14:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:00,877 INFO L93 Difference]: Finished difference Result 6236 states and 7976 transitions. [2022-07-20 04:14:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 04:14:00,877 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-20 04:14:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:00,887 INFO L225 Difference]: With dead ends: 6236 [2022-07-20 04:14:00,887 INFO L226 Difference]: Without dead ends: 3695 [2022-07-20 04:14:00,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-07-20 04:14:00,893 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-20 04:14:00,893 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-20 04:14:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2022-07-20 04:14:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3435. [2022-07-20 04:14:01,250 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-20 04:14:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4438 transitions. [2022-07-20 04:14:01,258 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4438 transitions. Word has length 228 [2022-07-20 04:14:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:01,259 INFO L495 AbstractCegarLoop]: Abstraction has 3435 states and 4438 transitions. [2022-07-20 04:14:01,259 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-20 04:14:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4438 transitions. [2022-07-20 04:14:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-20 04:14:01,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:01,261 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-20 04:14:01,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 04:14:01,475 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-20 04:14:01,476 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-20 04:14:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 81717830, now seen corresponding path program 1 times [2022-07-20 04:14:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:01,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444943661] [2022-07-20 04:14:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:14:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:14:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:14:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:14:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:14:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:14:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:14:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:14:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 04:14:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 04:14:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-20 04:14:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-20 04:14:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-20 04:14:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:01,840 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-20 04:14:01,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:01,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444943661] [2022-07-20 04:14:01,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444943661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:01,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:01,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 04:14:01,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424433679] [2022-07-20 04:14:01,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:01,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 04:14:01,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 04:14:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-20 04:14:01,843 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-20 04:14:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:07,043 INFO L93 Difference]: Finished difference Result 7957 states and 10537 transitions. [2022-07-20 04:14:07,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:14:07,043 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-20 04:14:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:07,055 INFO L225 Difference]: With dead ends: 7957 [2022-07-20 04:14:07,055 INFO L226 Difference]: Without dead ends: 4640 [2022-07-20 04:14:07,061 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-20 04:14:07,062 INFO L413 NwaCegarLoop]: 1527 mSDtfsCounter, 2236 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 5936 mSolverCounterSat, 1587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2236 SdHoareTripleChecker+Valid, 8375 SdHoareTripleChecker+Invalid, 7523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1587 IncrementalHoareTripleChecker+Valid, 5936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:07,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2236 Valid, 8375 Invalid, 7523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1587 Valid, 5936 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-20 04:14:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-20 04:14:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 3444. [2022-07-20 04:14:07,366 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-20 04:14:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 4448 transitions. [2022-07-20 04:14:07,377 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 4448 transitions. Word has length 249 [2022-07-20 04:14:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:07,377 INFO L495 AbstractCegarLoop]: Abstraction has 3444 states and 4448 transitions. [2022-07-20 04:14:07,377 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-20 04:14:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 4448 transitions. [2022-07-20 04:14:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-20 04:14:07,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:07,380 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-20 04:14:07,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-20 04:14:07,380 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-20 04:14:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1493401337, now seen corresponding path program 1 times [2022-07-20 04:14:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:07,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026581198] [2022-07-20 04:14:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:07,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:14:07,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493165122] [2022-07-20 04:14:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:07,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:07,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:07,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:14:07,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 04:14:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:08,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-20 04:14:08,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:08,275 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-20 04:14:08,570 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-20 04:14:11,170 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-20 04:14:15,217 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-20 04:14:17,306 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-20 04:14:17,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:14:17,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026581198] [2022-07-20 04:14:17,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:14:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493165122] [2022-07-20 04:14:17,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493165122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:17,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:17,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-20 04:14:17,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333852145] [2022-07-20 04:14:17,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:17,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 04:14:17,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:17,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 04:14:17,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=363, Unknown=5, NotChecked=0, Total=420 [2022-07-20 04:14:17,308 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-20 04:14:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:21,508 INFO L93 Difference]: Finished difference Result 6546 states and 8453 transitions. [2022-07-20 04:14:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 04:14:21,509 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-20 04:14:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:21,520 INFO L225 Difference]: With dead ends: 6546 [2022-07-20 04:14:21,520 INFO L226 Difference]: Without dead ends: 3567 [2022-07-20 04:14:21,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 244 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=97, Invalid=654, Unknown=5, NotChecked=0, Total=756 [2022-07-20 04:14:21,529 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-20 04:14:21,529 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-20 04:14:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2022-07-20 04:14:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3454. [2022-07-20 04:14:21,937 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-20 04:14:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4451 transitions. [2022-07-20 04:14:21,947 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4451 transitions. Word has length 270 [2022-07-20 04:14:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:21,948 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4451 transitions. [2022-07-20 04:14:21,948 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-20 04:14:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4451 transitions. [2022-07-20 04:14:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-20 04:14:21,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:21,951 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-20 04:14:21,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 04:14:22,163 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-20 04:14:22,164 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-20 04:14:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1495248379, now seen corresponding path program 1 times [2022-07-20 04:14:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:22,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262702122] [2022-07-20 04:14:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:22,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:14:22,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1725304501] [2022-07-20 04:14:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:22,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:22,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:22,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:14:22,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 04:14:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:23,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 04:14:23,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:23,788 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-20 04:14:23,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:14:24,107 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-20 04:14:24,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:24,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262702122] [2022-07-20 04:14:24,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:14:24,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725304501] [2022-07-20 04:14:24,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725304501] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:14:24,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:14:24,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-20 04:14:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681185238] [2022-07-20 04:14:24,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:14:24,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:14:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:24,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:14:24,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:14:24,109 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-20 04:14:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:25,039 INFO L93 Difference]: Finished difference Result 7797 states and 10239 transitions. [2022-07-20 04:14:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:14:25,039 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-20 04:14:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:25,054 INFO L225 Difference]: With dead ends: 7797 [2022-07-20 04:14:25,054 INFO L226 Difference]: Without dead ends: 4384 [2022-07-20 04:14:25,062 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-20 04:14:25,062 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:25,063 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.4s Time] [2022-07-20 04:14:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-07-20 04:14:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3454. [2022-07-20 04:14:25,384 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-20 04:14:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4449 transitions. [2022-07-20 04:14:25,393 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4449 transitions. Word has length 270 [2022-07-20 04:14:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:25,394 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4449 transitions. [2022-07-20 04:14:25,394 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-20 04:14:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4449 transitions. [2022-07-20 04:14:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-20 04:14:25,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:25,397 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-20 04:14:25,431 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-20 04:14:25,615 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-20 04:14:25,616 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-20 04:14:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1148313790, now seen corresponding path program 1 times [2022-07-20 04:14:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:25,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748940169] [2022-07-20 04:14:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:25,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:25,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:14:25,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282872180] [2022-07-20 04:14:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:25,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:25,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:25,680 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-20 04:14:25,681 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-20 04:14:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:26,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 2632 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 04:14:26,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:26,857 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-20 04:14:26,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:14:27,183 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-20 04:14:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:27,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748940169] [2022-07-20 04:14:27,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:14:27,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282872180] [2022-07-20 04:14:27,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282872180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:14:27,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:14:27,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-20 04:14:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464048614] [2022-07-20 04:14:27,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:14:27,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:14:27,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:27,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:14:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:14:27,185 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-20 04:14:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:28,127 INFO L93 Difference]: Finished difference Result 7784 states and 10219 transitions. [2022-07-20 04:14:28,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:14:28,127 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-20 04:14:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:28,142 INFO L225 Difference]: With dead ends: 7784 [2022-07-20 04:14:28,142 INFO L226 Difference]: Without dead ends: 4384 [2022-07-20 04:14:28,152 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-20 04:14:28,153 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 729 mSDsluCounter, 12683 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:28,153 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.4s Time] [2022-07-20 04:14:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-07-20 04:14:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3454. [2022-07-20 04:14:28,527 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-20 04:14:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4447 transitions. [2022-07-20 04:14:28,535 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4447 transitions. Word has length 274 [2022-07-20 04:14:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:28,536 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4447 transitions. [2022-07-20 04:14:28,536 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-20 04:14:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4447 transitions. [2022-07-20 04:14:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-07-20 04:14:28,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:28,539 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-20 04:14:28,578 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-20 04:14:28,755 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-20 04:14:28,756 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-20 04:14:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash -815079205, now seen corresponding path program 1 times [2022-07-20 04:14:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:28,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291584807] [2022-07-20 04:14:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:28,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:14:28,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283078815] [2022-07-20 04:14:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:28,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:28,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:28,819 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-20 04:14:28,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process