./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 791161d1 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-?-791161d [2022-07-23 04:28:27,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:28:27,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:28:27,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:28:27,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:28:27,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:28:27,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:28:27,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:28:27,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:28:27,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:28:27,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:28:27,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:28:27,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:28:27,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:28:27,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:28:27,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:28:27,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:28:27,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:28:27,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:28:27,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:28:27,322 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:28:27,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:28:27,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:28:27,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:28:27,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:28:27,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:28:27,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:28:27,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:28:27,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:28:27,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:28:27,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:28:27,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:28:27,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:28:27,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:28:27,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:28:27,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:28:27,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:28:27,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:28:27,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:28:27,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:28:27,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:28:27,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:28:27,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:28:27,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:28:27,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:28:27,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:28:27,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:28:27,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:28:27,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:28:27,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:28:27,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:28:27,375 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:28:27,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:28:27,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:28:27,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:28:27,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:28:27,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:28:27,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:28:27,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:28:27,377 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:28:27,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:28:27,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:28:27,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:28:27,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:28:27,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:28:27,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:28:27,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:28:27,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:28:27,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:28:27,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:28:27,379 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:28:27,379 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:28:27,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:28:27,380 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-23 04:28:27,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:28:27,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:28:27,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:28:27,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:28:27,647 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:28:27,648 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-23 04:28:27,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c47de7d0/c8fcb202d5774d93843b5e1205427314/FLAG4f9a97464 [2022-07-23 04:28:28,407 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:28:28,407 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-23 04:28:28,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c47de7d0/c8fcb202d5774d93843b5e1205427314/FLAG4f9a97464 [2022-07-23 04:28:28,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c47de7d0/c8fcb202d5774d93843b5e1205427314 [2022-07-23 04:28:28,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:28:28,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:28:28,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:28:28,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:28:28,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:28:28,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:28:28" (1/1) ... [2022-07-23 04:28:28,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78071be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:28, skipping insertion in model container [2022-07-23 04:28:28,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:28:28" (1/1) ... [2022-07-23 04:28:28,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:28:28,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:28:30,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262458,262471] [2022-07-23 04:28:30,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262611,262624] [2022-07-23 04:28:30,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262757,262770] [2022-07-23 04:28:30,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262900,262913] [2022-07-23 04:28:30,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263052,263065] [2022-07-23 04:28:30,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263198,263211] [2022-07-23 04:28:30,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263343,263356] [2022-07-23 04:28:30,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263497,263510] [2022-07-23 04:28:30,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263648,263661] [2022-07-23 04:28:30,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263803,263816] [2022-07-23 04:28:30,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263955,263968] [2022-07-23 04:28:30,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264110,264123] [2022-07-23 04:28:30,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264274,264287] [2022-07-23 04:28:30,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264430,264443] [2022-07-23 04:28:30,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264594,264607] [2022-07-23 04:28:30,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264736,264749] [2022-07-23 04:28:30,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264894,264907] [2022-07-23 04:28:30,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265061,265074] [2022-07-23 04:28:30,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265220,265233] [2022-07-23 04:28:30,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265379,265392] [2022-07-23 04:28:30,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265528,265541] [2022-07-23 04:28:30,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265675,265688] [2022-07-23 04:28:30,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265814,265827] [2022-07-23 04:28:30,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265977,265990] [2022-07-23 04:28:30,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266143,266156] [2022-07-23 04:28:30,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266307,266320] [2022-07-23 04:28:30,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266472,266485] [2022-07-23 04:28:30,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266637,266650] [2022-07-23 04:28:30,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266803,266816] [2022-07-23 04:28:30,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266968,266981] [2022-07-23 04:28:30,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267135,267148] [2022-07-23 04:28:30,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267295,267308] [2022-07-23 04:28:30,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267457,267470] [2022-07-23 04:28:30,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267616,267629] [2022-07-23 04:28:30,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267762,267775] [2022-07-23 04:28:30,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267905,267918] [2022-07-23 04:28:30,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268049,268062] [2022-07-23 04:28:30,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268192,268205] [2022-07-23 04:28:30,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268336,268349] [2022-07-23 04:28:30,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268477,268490] [2022-07-23 04:28:30,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268615,268628] [2022-07-23 04:28:30,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269989,270002] [2022-07-23 04:28:30,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270142,270155] [2022-07-23 04:28:30,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270293,270306] [2022-07-23 04:28:30,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270443,270456] [2022-07-23 04:28:30,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270590,270603] [2022-07-23 04:28:30,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270741,270754] [2022-07-23 04:28:30,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270892,270905] [2022-07-23 04:28:30,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271542,271555] [2022-07-23 04:28:30,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271710,271723] [2022-07-23 04:28:30,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271860,271873] [2022-07-23 04:28:30,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272007,272020] [2022-07-23 04:28:30,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:30,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:28:31,023 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:28:31,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,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[269689,269702] [2022-07-23 04:28:31,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-23 04:28:31,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[270142,270155] [2022-07-23 04:28:31,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[270293,270306] [2022-07-23 04:28:31,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[270443,270456] [2022-07-23 04:28:31,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[270590,270603] [2022-07-23 04:28:31,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[270741,270754] [2022-07-23 04:28:31,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[270892,270905] [2022-07-23 04:28:31,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[271040,271053] [2022-07-23 04:28:31,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[271206,271219] [2022-07-23 04:28:31,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[271375,271388] [2022-07-23 04:28:31,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[271542,271555] [2022-07-23 04:28:31,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271710,271723] [2022-07-23 04:28:31,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271860,271873] [2022-07-23 04:28:31,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272007,272020] [2022-07-23 04:28:31,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272168,272181] [2022-07-23 04:28:31,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272338,272351] [2022-07-23 04:28:31,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[272500,272513] [2022-07-23 04:28:31,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:28:31,458 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:28:31,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31 WrapperNode [2022-07-23 04:28:31,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:28:31,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:28:31,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:28:31,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:28:31,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,692 INFO L137 Inliner]: procedures = 508, calls = 1237, calls flagged for inlining = 228, calls inlined = 154, statements flattened = 2697 [2022-07-23 04:28:31,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:28:31,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:28:31,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:28:31,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:28:31,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:28:31,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:28:31,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:28:31,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:28:31,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (1/1) ... [2022-07-23 04:28:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:28:31,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:28:31,937 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-23 04:28:31,961 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-23 04:28:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:28:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:28:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 04:28:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 04:28:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:28:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:28:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:28:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:28:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-23 04:28:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-23 04:28:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2022-07-23 04:28:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2022-07-23 04:28:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:28:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:28:31,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:28:31,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:28:31,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:28:31,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:28:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:28:31,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:28:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:28:31,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:28:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:28:31,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:28:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:28:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:28:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:28:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-23 04:28:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-23 04:28:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 04:28:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:28:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:28:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:28:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:28:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:28:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:28:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:28:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:28:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:28:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-23 04:28:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-23 04:28:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:28:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:28:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-23 04:28:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-23 04:28:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 04:28:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 04:28:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:28:31,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:28:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-23 04:28:31,987 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-23 04:28:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:28:31,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:28:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:28:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:28:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:28:31,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:28:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:28:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-23 04:28:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:28:31,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:28:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-23 04:28:31,989 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-23 04:28:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:28:31,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:28:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-23 04:28:31,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-23 04:28:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2022-07-23 04:28:31,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2022-07-23 04:28:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-23 04:28:31,990 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-23 04:28:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:28:31,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:28:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:28:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:28:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-23 04:28:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-23 04:28:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-07-23 04:28:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-07-23 04:28:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:28:31,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:28:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:28:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:28:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-23 04:28:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-23 04:28:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:28:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:28:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-23 04:28:31,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-23 04:28:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:28:31,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:28:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:28:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:28:31,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:28:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:28:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-23 04:28:31,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-23 04:28:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_101 [2022-07-23 04:28:31,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_101 [2022-07-23 04:28:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:28:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-23 04:28:31,999 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-23 04:28:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:28:32,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:28:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-23 04:28:32,000 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-23 04:28:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:28:32,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:28:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 04:28:32,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 04:28:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-23 04:28:32,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-23 04:28:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-23 04:28:32,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-23 04:28:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:28:32,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:28:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:28:32,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:28:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:28:32,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:28:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:28:32,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:28:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-23 04:28:32,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-23 04:28:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:28:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:28:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2022-07-23 04:28:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2022-07-23 04:28:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 04:28:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 04:28:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:28:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:28:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2022-07-23 04:28:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2022-07-23 04:28:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:28:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:28:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:28:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:28:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:28:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:28:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:28:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-23 04:28:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-23 04:28:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:28:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:28:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:28:32,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:28:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:28:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure yurex_disconnect [2022-07-23 04:28:32,007 INFO L138 BoogieDeclarations]: Found implementation of procedure yurex_disconnect [2022-07-23 04:28:32,512 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:28:32,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:28:32,930 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:28:35,352 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:28:35,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:28:35,372 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 04:28:35,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:28:35 BoogieIcfgContainer [2022-07-23 04:28:35,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:28:35,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:28:35,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:28:35,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:28:35,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:28:28" (1/3) ... [2022-07-23 04:28:35,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7824fd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:28:35, skipping insertion in model container [2022-07-23 04:28:35,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:28:31" (2/3) ... [2022-07-23 04:28:35,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7824fd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:28:35, skipping insertion in model container [2022-07-23 04:28:35,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:28:35" (3/3) ... [2022-07-23 04:28:35,385 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2022-07-23 04:28:35,400 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:28:35,400 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-23 04:28:35,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:28:35,521 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@e7147e6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d1635ad [2022-07-23 04:28:35,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-23 04:28:35,529 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-23 04:28:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 04:28:35,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:35,543 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-23 04:28:35,543 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-23 04:28:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 150450018, now seen corresponding path program 1 times [2022-07-23 04:28:35,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:35,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67921142] [2022-07-23 04:28:35,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:36,251 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-23 04:28:36,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:36,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67921142] [2022-07-23 04:28:36,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67921142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:36,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:36,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811067482] [2022-07-23 04:28:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:36,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:36,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:36,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:36,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:36,294 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-23 04:28:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:38,581 INFO L93 Difference]: Finished difference Result 1903 states and 2593 transitions. [2022-07-23 04:28:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:38,583 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-23 04:28:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:38,601 INFO L225 Difference]: With dead ends: 1903 [2022-07-23 04:28:38,601 INFO L226 Difference]: Without dead ends: 957 [2022-07-23 04:28:38,612 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-23 04:28:38,615 INFO L413 NwaCegarLoop]: 1185 mSDtfsCounter, 1754 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:38,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 2531 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-23 04:28:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-07-23 04:28:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2022-07-23 04:28:38,717 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-23 04:28:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1225 transitions. [2022-07-23 04:28:38,726 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1225 transitions. Word has length 71 [2022-07-23 04:28:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:38,728 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1225 transitions. [2022-07-23 04:28:38,728 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-23 04:28:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1225 transitions. [2022-07-23 04:28:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 04:28:38,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:38,732 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-23 04:28:38,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:28:38,732 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-23 04:28:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash 395296491, now seen corresponding path program 1 times [2022-07-23 04:28:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:38,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203308978] [2022-07-23 04:28:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:38,987 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-23 04:28:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:38,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203308978] [2022-07-23 04:28:38,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203308978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:38,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:38,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562980980] [2022-07-23 04:28:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:38,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:38,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:38,992 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-23 04:28:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:41,109 INFO L93 Difference]: Finished difference Result 957 states and 1225 transitions. [2022-07-23 04:28:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:41,109 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-23 04:28:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:41,116 INFO L225 Difference]: With dead ends: 957 [2022-07-23 04:28:41,116 INFO L226 Difference]: Without dead ends: 955 [2022-07-23 04:28:41,118 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-23 04:28:41,118 INFO L413 NwaCegarLoop]: 1165 mSDtfsCounter, 1720 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:41,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1871 Valid, 2491 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-23 04:28:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-07-23 04:28:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-07-23 04:28:41,161 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-23 04:28:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1223 transitions. [2022-07-23 04:28:41,169 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1223 transitions. Word has length 77 [2022-07-23 04:28:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:41,170 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1223 transitions. [2022-07-23 04:28:41,170 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-23 04:28:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1223 transitions. [2022-07-23 04:28:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 04:28:41,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:41,173 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-23 04:28:41,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:28:41,173 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-23 04:28:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1728180818, now seen corresponding path program 1 times [2022-07-23 04:28:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:41,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042730273] [2022-07-23 04:28:41,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,429 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-23 04:28:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042730273] [2022-07-23 04:28:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042730273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:41,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:41,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592402841] [2022-07-23 04:28:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:41,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:41,433 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-23 04:28:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:43,251 INFO L93 Difference]: Finished difference Result 955 states and 1223 transitions. [2022-07-23 04:28:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:43,251 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-23 04:28:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:43,264 INFO L225 Difference]: With dead ends: 955 [2022-07-23 04:28:43,264 INFO L226 Difference]: Without dead ends: 953 [2022-07-23 04:28:43,265 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-23 04:28:43,268 INFO L413 NwaCegarLoop]: 1163 mSDtfsCounter, 1714 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:43,270 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.7s Time] [2022-07-23 04:28:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-23 04:28:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2022-07-23 04:28:43,322 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-23 04:28:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1221 transitions. [2022-07-23 04:28:43,329 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1221 transitions. Word has length 83 [2022-07-23 04:28:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:43,330 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1221 transitions. [2022-07-23 04:28:43,331 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-23 04:28:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1221 transitions. [2022-07-23 04:28:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-23 04:28:43,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:43,337 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-23 04:28:43,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:28:43,337 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-23 04:28:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2012755007, now seen corresponding path program 1 times [2022-07-23 04:28:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:43,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517144674] [2022-07-23 04:28:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:28:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:43,547 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-23 04:28:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:43,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517144674] [2022-07-23 04:28:43,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517144674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:43,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:43,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487636550] [2022-07-23 04:28:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:43,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:43,549 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-23 04:28:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:45,296 INFO L93 Difference]: Finished difference Result 953 states and 1221 transitions. [2022-07-23 04:28:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:45,296 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-23 04:28:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:45,302 INFO L225 Difference]: With dead ends: 953 [2022-07-23 04:28:45,303 INFO L226 Difference]: Without dead ends: 951 [2022-07-23 04:28:45,303 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-23 04:28:45,304 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-23 04:28:45,304 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-23 04:28:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-07-23 04:28:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2022-07-23 04:28:45,339 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-23 04:28:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1219 transitions. [2022-07-23 04:28:45,344 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1219 transitions. Word has length 89 [2022-07-23 04:28:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:45,345 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1219 transitions. [2022-07-23 04:28:45,345 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-23 04:28:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1219 transitions. [2022-07-23 04:28:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 04:28:45,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:45,351 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-23 04:28:45,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:28:45,353 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-23 04:28:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1710267306, now seen corresponding path program 1 times [2022-07-23 04:28:45,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:45,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879868297] [2022-07-23 04:28:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:45,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:28:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:28:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:45,579 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-23 04:28:45,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:45,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879868297] [2022-07-23 04:28:45,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879868297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:45,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:45,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342816685] [2022-07-23 04:28:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:45,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:45,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:45,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:45,582 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-23 04:28:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:47,295 INFO L93 Difference]: Finished difference Result 951 states and 1219 transitions. [2022-07-23 04:28:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:47,296 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-23 04:28:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:47,301 INFO L225 Difference]: With dead ends: 951 [2022-07-23 04:28:47,301 INFO L226 Difference]: Without dead ends: 949 [2022-07-23 04:28:47,302 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-23 04:28:47,302 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 1702 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:47,302 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.6s Time] [2022-07-23 04:28:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2022-07-23 04:28:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2022-07-23 04:28:47,335 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-23 04:28:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1217 transitions. [2022-07-23 04:28:47,340 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1217 transitions. Word has length 95 [2022-07-23 04:28:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:47,340 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1217 transitions. [2022-07-23 04:28:47,341 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-23 04:28:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1217 transitions. [2022-07-23 04:28:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-23 04:28:47,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:47,342 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-23 04:28:47,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:28:47,343 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-23 04:28:47,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1309820457, now seen corresponding path program 1 times [2022-07-23 04:28:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:47,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566854136] [2022-07-23 04:28:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:28:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:28:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:28:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:47,562 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-23 04:28:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:47,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566854136] [2022-07-23 04:28:47,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566854136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:47,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:47,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034858004] [2022-07-23 04:28:47,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:47,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:47,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:47,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:47,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:47,565 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-23 04:28:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:49,202 INFO L93 Difference]: Finished difference Result 949 states and 1217 transitions. [2022-07-23 04:28:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:49,203 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-23 04:28:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:49,208 INFO L225 Difference]: With dead ends: 949 [2022-07-23 04:28:49,208 INFO L226 Difference]: Without dead ends: 947 [2022-07-23 04:28:49,209 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-23 04:28:49,213 INFO L413 NwaCegarLoop]: 1157 mSDtfsCounter, 1696 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:49,213 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-23 04:28:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-23 04:28:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2022-07-23 04:28:49,253 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-23 04:28:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1215 transitions. [2022-07-23 04:28:49,258 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1215 transitions. Word has length 101 [2022-07-23 04:28:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:49,258 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1215 transitions. [2022-07-23 04:28:49,258 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-23 04:28:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1215 transitions. [2022-07-23 04:28:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 04:28:49,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:49,260 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-23 04:28:49,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:28:49,260 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-23 04:28:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1917796044, now seen corresponding path program 1 times [2022-07-23 04:28:49,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:49,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353352004] [2022-07-23 04:28:49,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:49,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:28:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:28:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:28:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:28:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:49,561 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-23 04:28:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:49,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353352004] [2022-07-23 04:28:49,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353352004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:49,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:49,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111729443] [2022-07-23 04:28:49,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:49,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:49,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:49,564 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-23 04:28:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:51,565 INFO L93 Difference]: Finished difference Result 947 states and 1215 transitions. [2022-07-23 04:28:51,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:51,566 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-23 04:28:51,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:51,574 INFO L225 Difference]: With dead ends: 947 [2022-07-23 04:28:51,574 INFO L226 Difference]: Without dead ends: 945 [2022-07-23 04:28:51,575 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-23 04:28:51,577 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 1690 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:51,577 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.9s Time] [2022-07-23 04:28:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-23 04:28:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2022-07-23 04:28:51,615 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-23 04:28:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1213 transitions. [2022-07-23 04:28:51,620 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1213 transitions. Word has length 107 [2022-07-23 04:28:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:51,621 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1213 transitions. [2022-07-23 04:28:51,621 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-23 04:28:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1213 transitions. [2022-07-23 04:28:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-23 04:28:51,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:51,623 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-23 04:28:51,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:28:51,623 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-23 04:28:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -334687362, now seen corresponding path program 1 times [2022-07-23 04:28:51,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:51,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561085731] [2022-07-23 04:28:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:28:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:28:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:28:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:28:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:28:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:51,847 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-23 04:28:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:51,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561085731] [2022-07-23 04:28:51,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561085731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:51,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:51,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:51,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418078305] [2022-07-23 04:28:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:51,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:51,849 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-23 04:28:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:53,576 INFO L93 Difference]: Finished difference Result 945 states and 1213 transitions. [2022-07-23 04:28:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:53,577 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-23 04:28:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:53,581 INFO L225 Difference]: With dead ends: 945 [2022-07-23 04:28:53,581 INFO L226 Difference]: Without dead ends: 943 [2022-07-23 04:28:53,581 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-23 04:28:53,582 INFO L413 NwaCegarLoop]: 1153 mSDtfsCounter, 1688 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:53,582 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.6s Time] [2022-07-23 04:28:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-07-23 04:28:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2022-07-23 04:28:53,617 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-23 04:28:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1211 transitions. [2022-07-23 04:28:53,622 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1211 transitions. Word has length 113 [2022-07-23 04:28:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:53,622 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1211 transitions. [2022-07-23 04:28:53,623 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-23 04:28:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1211 transitions. [2022-07-23 04:28:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-23 04:28:53,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:53,624 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-23 04:28:53,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 04:28:53,625 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-23 04:28:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:53,625 INFO L85 PathProgramCache]: Analyzing trace with hash 488135713, now seen corresponding path program 1 times [2022-07-23 04:28:53,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:53,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729916081] [2022-07-23 04:28:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:53,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:28:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:28:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:28:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:28:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:28:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:53,834 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-23 04:28:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729916081] [2022-07-23 04:28:53,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729916081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:53,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:53,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552473832] [2022-07-23 04:28:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:53,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:53,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:53,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:53,837 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-23 04:28:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:55,626 INFO L93 Difference]: Finished difference Result 943 states and 1211 transitions. [2022-07-23 04:28:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:55,627 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-23 04:28:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:55,631 INFO L225 Difference]: With dead ends: 943 [2022-07-23 04:28:55,632 INFO L226 Difference]: Without dead ends: 941 [2022-07-23 04:28:55,632 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-23 04:28:55,633 INFO L413 NwaCegarLoop]: 1151 mSDtfsCounter, 1676 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:55,633 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.7s Time] [2022-07-23 04:28:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-23 04:28:55,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2022-07-23 04:28:55,670 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-23 04:28:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1209 transitions. [2022-07-23 04:28:55,674 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1209 transitions. Word has length 115 [2022-07-23 04:28:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:55,675 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1209 transitions. [2022-07-23 04:28:55,675 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-23 04:28:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1209 transitions. [2022-07-23 04:28:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-23 04:28:55,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:55,677 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-23 04:28:55,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:28:55,677 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-23 04:28:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1281926017, now seen corresponding path program 1 times [2022-07-23 04:28:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:55,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633877970] [2022-07-23 04:28:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:55,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:28:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:28:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:28:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:28:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:28:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:28:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:55,870 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-23 04:28:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:55,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633877970] [2022-07-23 04:28:55,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633877970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:55,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:55,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322234376] [2022-07-23 04:28:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:55,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:55,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:55,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:55,872 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-23 04:28:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:57,431 INFO L93 Difference]: Finished difference Result 941 states and 1209 transitions. [2022-07-23 04:28:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:57,432 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-23 04:28:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:57,436 INFO L225 Difference]: With dead ends: 941 [2022-07-23 04:28:57,436 INFO L226 Difference]: Without dead ends: 939 [2022-07-23 04:28:57,437 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-23 04:28:57,438 INFO L413 NwaCegarLoop]: 1149 mSDtfsCounter, 1672 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:57,438 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.5s Time] [2022-07-23 04:28:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-23 04:28:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2022-07-23 04:28:57,482 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-23 04:28:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1207 transitions. [2022-07-23 04:28:57,487 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1207 transitions. Word has length 121 [2022-07-23 04:28:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:57,488 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1207 transitions. [2022-07-23 04:28:57,488 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-23 04:28:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1207 transitions. [2022-07-23 04:28:57,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-23 04:28:57,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:57,490 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-23 04:28:57,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:28:57,490 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-23 04:28:57,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1200561438, now seen corresponding path program 1 times [2022-07-23 04:28:57,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:57,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208956613] [2022-07-23 04:28:57,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:28:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:28:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:28:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:28:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:28:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:28:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:28:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:28:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:28:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:28:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:57,708 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-23 04:28:57,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:57,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208956613] [2022-07-23 04:28:57,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208956613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:57,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:57,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951872167] [2022-07-23 04:28:57,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:57,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:57,711 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-23 04:28:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:59,590 INFO L93 Difference]: Finished difference Result 939 states and 1207 transitions. [2022-07-23 04:28:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:59,591 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-23 04:28:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:59,596 INFO L225 Difference]: With dead ends: 939 [2022-07-23 04:28:59,596 INFO L226 Difference]: Without dead ends: 937 [2022-07-23 04:28:59,597 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-23 04:28:59,598 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 1666 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:59,598 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.8s Time] [2022-07-23 04:28:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-07-23 04:28:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2022-07-23 04:28:59,640 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-23 04:28:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1205 transitions. [2022-07-23 04:28:59,645 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1205 transitions. Word has length 127 [2022-07-23 04:28:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:59,646 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1205 transitions. [2022-07-23 04:28:59,647 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-23 04:28:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1205 transitions. [2022-07-23 04:28:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-23 04:28:59,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:59,649 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-23 04:28:59,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:28:59,649 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-23 04:28:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1108051758, now seen corresponding path program 1 times [2022-07-23 04:28:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125048128] [2022-07-23 04:28:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:28:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:28:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:28:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:28:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:28:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:28:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:59,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:28:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:00,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:00,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:29:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:00,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:29:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:00,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:29:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:00,056 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-23 04:29:00,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:00,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125048128] [2022-07-23 04:29:00,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125048128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:00,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:00,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:29:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618306772] [2022-07-23 04:29:00,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:00,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:29:00,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:00,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:29:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:29:00,060 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-23 04:29:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:03,387 INFO L93 Difference]: Finished difference Result 1858 states and 2401 transitions. [2022-07-23 04:29:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:29:03,388 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-23 04:29:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:03,393 INFO L225 Difference]: With dead ends: 1858 [2022-07-23 04:29:03,394 INFO L226 Difference]: Without dead ends: 961 [2022-07-23 04:29:03,397 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-23 04:29:03,397 INFO L413 NwaCegarLoop]: 1139 mSDtfsCounter, 1967 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 3787 SdHoareTripleChecker+Invalid, 3782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:03,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 3787 Invalid, 3782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 04:29:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-07-23 04:29:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 937. [2022-07-23 04:29:03,446 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-23 04:29:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1204 transitions. [2022-07-23 04:29:03,450 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1204 transitions. Word has length 171 [2022-07-23 04:29:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:03,451 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1204 transitions. [2022-07-23 04:29:03,451 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-23 04:29:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1204 transitions. [2022-07-23 04:29:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-23 04:29:03,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:03,453 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-23 04:29:03,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:29:03,454 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-23 04:29:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1107992176, now seen corresponding path program 1 times [2022-07-23 04:29:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:03,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068090774] [2022-07-23 04:29:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:03,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:29:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:29:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:29:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:29:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:29:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:29:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:29:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:29:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:03,755 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-23 04:29:03,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:03,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068090774] [2022-07-23 04:29:03,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068090774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:03,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:03,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:29:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169156116] [2022-07-23 04:29:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:03,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:29:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:03,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:29:03,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:29:03,756 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-23 04:29:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:06,457 INFO L93 Difference]: Finished difference Result 961 states and 1238 transitions. [2022-07-23 04:29:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:29:06,458 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-23 04:29:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:06,463 INFO L225 Difference]: With dead ends: 961 [2022-07-23 04:29:06,463 INFO L226 Difference]: Without dead ends: 959 [2022-07-23 04:29:06,464 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-23 04:29:06,465 INFO L413 NwaCegarLoop]: 1142 mSDtfsCounter, 1045 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 3401 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:06,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 3401 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 04:29:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-23 04:29:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 935. [2022-07-23 04:29:06,510 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-23 04:29:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1202 transitions. [2022-07-23 04:29:06,514 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1202 transitions. Word has length 171 [2022-07-23 04:29:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:06,517 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1202 transitions. [2022-07-23 04:29:06,517 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-23 04:29:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1202 transitions. [2022-07-23 04:29:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-23 04:29:06,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:06,519 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-23 04:29:06,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:29:06,519 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-23 04:29:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1944874354, now seen corresponding path program 1 times [2022-07-23 04:29:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:06,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615232931] [2022-07-23 04:29:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:06,743 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-23 04:29:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:06,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615232931] [2022-07-23 04:29:06,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615232931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:06,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:06,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172301099] [2022-07-23 04:29:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:06,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:06,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:06,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:06,746 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-23 04:29:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:08,477 INFO L93 Difference]: Finished difference Result 935 states and 1202 transitions. [2022-07-23 04:29:08,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:08,478 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-23 04:29:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:08,482 INFO L225 Difference]: With dead ends: 935 [2022-07-23 04:29:08,482 INFO L226 Difference]: Without dead ends: 933 [2022-07-23 04:29:08,483 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-23 04:29:08,485 INFO L413 NwaCegarLoop]: 1142 mSDtfsCounter, 1651 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:08,485 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.6s Time] [2022-07-23 04:29:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-07-23 04:29:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2022-07-23 04:29:08,540 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-23 04:29:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1200 transitions. [2022-07-23 04:29:08,544 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1200 transitions. Word has length 133 [2022-07-23 04:29:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:08,545 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1200 transitions. [2022-07-23 04:29:08,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (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-23 04:29:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1200 transitions. [2022-07-23 04:29:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-23 04:29:08,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:08,548 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-23 04:29:08,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:29:08,548 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-23 04:29:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash 157610685, now seen corresponding path program 1 times [2022-07-23 04:29:08,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:08,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815107590] [2022-07-23 04:29:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:29:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:29:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:29:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:29:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:29:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:29:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:29:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 04:29:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:08,838 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-23 04:29:08,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:08,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815107590] [2022-07-23 04:29:08,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815107590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:08,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:08,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743420342] [2022-07-23 04:29:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:08,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:08,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:08,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:08,841 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-23 04:29:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:10,812 INFO L93 Difference]: Finished difference Result 1846 states and 2387 transitions. [2022-07-23 04:29:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:10,812 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-23 04:29:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:10,817 INFO L225 Difference]: With dead ends: 1846 [2022-07-23 04:29:10,818 INFO L226 Difference]: Without dead ends: 953 [2022-07-23 04:29:10,821 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-23 04:29:10,821 INFO L413 NwaCegarLoop]: 1136 mSDtfsCounter, 1922 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:10,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 2289 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-23 04:29:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-23 04:29:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 929. [2022-07-23 04:29:10,871 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-23 04:29:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1195 transitions. [2022-07-23 04:29:10,875 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1195 transitions. Word has length 178 [2022-07-23 04:29:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:10,875 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1195 transitions. [2022-07-23 04:29:10,876 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-23 04:29:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1195 transitions. [2022-07-23 04:29:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-23 04:29:10,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:10,878 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-23 04:29:10,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:29:10,878 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-23 04:29:10,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:10,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1224799676, now seen corresponding path program 1 times [2022-07-23 04:29:10,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:10,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363917748] [2022-07-23 04:29:10,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:10,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:10,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:11,101 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-23 04:29:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:11,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363917748] [2022-07-23 04:29:11,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363917748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:11,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:11,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:11,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40244648] [2022-07-23 04:29:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:11,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:11,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:11,106 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-23 04:29:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:12,824 INFO L93 Difference]: Finished difference Result 929 states and 1195 transitions. [2022-07-23 04:29:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:12,824 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-23 04:29:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:12,829 INFO L225 Difference]: With dead ends: 929 [2022-07-23 04:29:12,829 INFO L226 Difference]: Without dead ends: 927 [2022-07-23 04:29:12,830 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-23 04:29:12,830 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 1630 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:12,831 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.6s Time] [2022-07-23 04:29:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-07-23 04:29:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2022-07-23 04:29:12,880 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-23 04:29:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1193 transitions. [2022-07-23 04:29:12,883 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1193 transitions. Word has length 139 [2022-07-23 04:29:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:12,884 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1193 transitions. [2022-07-23 04:29:12,884 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-23 04:29:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1193 transitions. [2022-07-23 04:29:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-23 04:29:12,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:12,886 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-23 04:29:12,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:29:12,886 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-23 04:29:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 249948283, now seen corresponding path program 1 times [2022-07-23 04:29:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:12,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068892525] [2022-07-23 04:29:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:13,096 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-23 04:29:13,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:13,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068892525] [2022-07-23 04:29:13,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068892525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:13,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:13,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003612308] [2022-07-23 04:29:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:13,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:13,099 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-23 04:29:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:14,739 INFO L93 Difference]: Finished difference Result 927 states and 1193 transitions. [2022-07-23 04:29:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:14,739 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-23 04:29:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:14,743 INFO L225 Difference]: With dead ends: 927 [2022-07-23 04:29:14,743 INFO L226 Difference]: Without dead ends: 925 [2022-07-23 04:29:14,744 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-23 04:29:14,744 INFO L413 NwaCegarLoop]: 1133 mSDtfsCounter, 1624 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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-23 04:29:14,744 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-23 04:29:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-07-23 04:29:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2022-07-23 04:29:14,795 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-23 04:29:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1191 transitions. [2022-07-23 04:29:14,798 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1191 transitions. Word has length 145 [2022-07-23 04:29:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:14,798 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1191 transitions. [2022-07-23 04:29:14,799 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-23 04:29:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1191 transitions. [2022-07-23 04:29:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-23 04:29:14,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:14,801 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-23 04:29:14,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:29:14,801 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-23 04:29:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1075121200, now seen corresponding path program 1 times [2022-07-23 04:29:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:14,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639463735] [2022-07-23 04:29:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,034 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-23 04:29:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:15,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639463735] [2022-07-23 04:29:15,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639463735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:15,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:15,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581549098] [2022-07-23 04:29:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:15,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:15,037 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-23 04:29:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:16,955 INFO L93 Difference]: Finished difference Result 925 states and 1191 transitions. [2022-07-23 04:29:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:16,960 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-23 04:29:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:16,964 INFO L225 Difference]: With dead ends: 925 [2022-07-23 04:29:16,965 INFO L226 Difference]: Without dead ends: 923 [2022-07-23 04:29:16,965 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-23 04:29:16,965 INFO L413 NwaCegarLoop]: 1131 mSDtfsCounter, 1618 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:16,966 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.8s Time] [2022-07-23 04:29:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-07-23 04:29:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2022-07-23 04:29:17,035 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-23 04:29:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1189 transitions. [2022-07-23 04:29:17,039 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1189 transitions. Word has length 151 [2022-07-23 04:29:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:17,039 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1189 transitions. [2022-07-23 04:29:17,040 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-23 04:29:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1189 transitions. [2022-07-23 04:29:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-23 04:29:17,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:17,043 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-23 04:29:17,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:29:17,043 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-23 04:29:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1533945952, now seen corresponding path program 1 times [2022-07-23 04:29:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:17,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481327267] [2022-07-23 04:29:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:29:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:29:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:29:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:29:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:29:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 04:29:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 04:29:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:29:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:17,433 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-23 04:29:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:17,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481327267] [2022-07-23 04:29:17,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481327267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:17,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:17,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:29:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142317630] [2022-07-23 04:29:17,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:17,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:29:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:29:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:29:17,437 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-23 04:29:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:21,222 INFO L93 Difference]: Finished difference Result 1776 states and 2294 transitions. [2022-07-23 04:29:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:29:21,223 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-23 04:29:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:21,227 INFO L225 Difference]: With dead ends: 1776 [2022-07-23 04:29:21,227 INFO L226 Difference]: Without dead ends: 1147 [2022-07-23 04:29:21,228 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-23 04:29:21,229 INFO L413 NwaCegarLoop]: 1224 mSDtfsCounter, 1353 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 4726 SdHoareTripleChecker+Invalid, 4681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:21,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 4726 Invalid, 4681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-23 04:29:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-23 04:29:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 928. [2022-07-23 04:29:21,291 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-23 04:29:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1197 transitions. [2022-07-23 04:29:21,294 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1197 transitions. Word has length 187 [2022-07-23 04:29:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:21,295 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1197 transitions. [2022-07-23 04:29:21,295 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-23 04:29:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1197 transitions. [2022-07-23 04:29:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-23 04:29:21,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:21,297 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-23 04:29:21,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:29:21,298 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-23 04:29:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash -576056608, now seen corresponding path program 1 times [2022-07-23 04:29:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:21,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423903837] [2022-07-23 04:29:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:21,520 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-23 04:29:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423903837] [2022-07-23 04:29:21,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423903837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:21,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:21,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151553964] [2022-07-23 04:29:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:21,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:21,527 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-23 04:29:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:23,360 INFO L93 Difference]: Finished difference Result 928 states and 1197 transitions. [2022-07-23 04:29:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:23,360 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-23 04:29:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:23,365 INFO L225 Difference]: With dead ends: 928 [2022-07-23 04:29:23,365 INFO L226 Difference]: Without dead ends: 926 [2022-07-23 04:29:23,365 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-23 04:29:23,366 INFO L413 NwaCegarLoop]: 1129 mSDtfsCounter, 1612 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:23,366 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.7s Time] [2022-07-23 04:29:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-07-23 04:29:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2022-07-23 04:29:23,428 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-23 04:29:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1195 transitions. [2022-07-23 04:29:23,430 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1195 transitions. Word has length 157 [2022-07-23 04:29:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:23,431 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 1195 transitions. [2022-07-23 04:29:23,431 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-23 04:29:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1195 transitions. [2022-07-23 04:29:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-23 04:29:23,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:23,434 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-23 04:29:23,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:29:23,434 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-23 04:29:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1565188194, now seen corresponding path program 1 times [2022-07-23 04:29:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:23,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050953063] [2022-07-23 04:29:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:29:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:23,685 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-23 04:29:23,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:23,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050953063] [2022-07-23 04:29:23,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050953063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:23,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:23,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:23,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241172501] [2022-07-23 04:29:23,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:23,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:23,688 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-23 04:29:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:25,475 INFO L93 Difference]: Finished difference Result 926 states and 1195 transitions. [2022-07-23 04:29:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:25,476 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-23 04:29:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:25,480 INFO L225 Difference]: With dead ends: 926 [2022-07-23 04:29:25,481 INFO L226 Difference]: Without dead ends: 924 [2022-07-23 04:29:25,481 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-23 04:29:25,482 INFO L413 NwaCegarLoop]: 1127 mSDtfsCounter, 1606 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:25,482 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.7s Time] [2022-07-23 04:29:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-07-23 04:29:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2022-07-23 04:29:25,546 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-23 04:29:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1193 transitions. [2022-07-23 04:29:25,549 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1193 transitions. Word has length 163 [2022-07-23 04:29:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:25,550 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1193 transitions. [2022-07-23 04:29:25,550 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-23 04:29:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1193 transitions. [2022-07-23 04:29:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-23 04:29:25,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:25,553 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-23 04:29:25,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 04:29:25,554 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-23 04:29:25,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:25,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1293557537, now seen corresponding path program 1 times [2022-07-23 04:29:25,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:25,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387058889] [2022-07-23 04:29:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:29:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:29:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:29:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:29:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:29:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:29:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:29:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:29:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:29:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:29:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-23 04:29:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:25,864 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-23 04:29:25,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:25,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387058889] [2022-07-23 04:29:25,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387058889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:25,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:25,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:29:25,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894671602] [2022-07-23 04:29:25,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:25,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:29:25,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:25,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:29:25,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:29:25,867 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-23 04:29:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:28,293 INFO L93 Difference]: Finished difference Result 1685 states and 2151 transitions. [2022-07-23 04:29:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:28,293 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-23 04:29:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:28,298 INFO L225 Difference]: With dead ends: 1685 [2022-07-23 04:29:28,298 INFO L226 Difference]: Without dead ends: 944 [2022-07-23 04:29:28,299 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-23 04:29:28,300 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 2116 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 1195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2276 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1195 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:28,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2276 Valid, 2086 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1195 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-23 04:29:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-07-23 04:29:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 920. [2022-07-23 04:29:28,408 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-23 04:29:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1188 transitions. [2022-07-23 04:29:28,411 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1188 transitions. Word has length 207 [2022-07-23 04:29:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:28,412 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1188 transitions. [2022-07-23 04:29:28,412 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-23 04:29:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1188 transitions. [2022-07-23 04:29:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-23 04:29:28,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:28,414 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-23 04:29:28,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:29:28,414 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-23 04:29:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1601264781, now seen corresponding path program 1 times [2022-07-23 04:29:28,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:28,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291280880] [2022-07-23 04:29:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:29:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:29:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:28,634 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-23 04:29:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:28,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291280880] [2022-07-23 04:29:28,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291280880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:28,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:28,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546828126] [2022-07-23 04:29:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:28,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:28,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:28,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:28,637 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-23 04:29:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:30,394 INFO L93 Difference]: Finished difference Result 920 states and 1188 transitions. [2022-07-23 04:29:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:30,394 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-23 04:29:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:30,399 INFO L225 Difference]: With dead ends: 920 [2022-07-23 04:29:30,399 INFO L226 Difference]: Without dead ends: 918 [2022-07-23 04:29:30,400 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-23 04:29:30,400 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 1595 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:30,401 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.6s Time] [2022-07-23 04:29:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-07-23 04:29:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2022-07-23 04:29:30,464 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-23 04:29:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1186 transitions. [2022-07-23 04:29:30,465 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1186 transitions. Word has length 169 [2022-07-23 04:29:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:30,466 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1186 transitions. [2022-07-23 04:29:30,466 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-23 04:29:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1186 transitions. [2022-07-23 04:29:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-23 04:29:30,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:30,469 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-23 04:29:30,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 04:29:30,469 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-23 04:29:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash 664104994, now seen corresponding path program 1 times [2022-07-23 04:29:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:30,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408842256] [2022-07-23 04:29:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:29:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:29:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:29:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:29:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:29:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:29:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:29:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:29:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-23 04:29:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-23 04:29:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:30,796 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-23 04:29:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:30,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408842256] [2022-07-23 04:29:30,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408842256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:30,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:30,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:29:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226003799] [2022-07-23 04:29:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:30,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:29:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:29:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:29:30,799 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-23 04:29:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:33,632 INFO L93 Difference]: Finished difference Result 997 states and 1268 transitions. [2022-07-23 04:29:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:29:33,633 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-23 04:29:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:33,637 INFO L225 Difference]: With dead ends: 997 [2022-07-23 04:29:33,638 INFO L226 Difference]: Without dead ends: 995 [2022-07-23 04:29:33,638 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-23 04:29:33,639 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 1829 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 985 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1948 SdHoareTripleChecker+Valid, 3474 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 985 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:33,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1948 Valid, 3474 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [985 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 04:29:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-23 04:29:33,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 969. [2022-07-23 04:29:33,709 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-23 04:29:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1235 transitions. [2022-07-23 04:29:33,712 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1235 transitions. Word has length 203 [2022-07-23 04:29:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:33,713 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1235 transitions. [2022-07-23 04:29:33,713 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-23 04:29:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1235 transitions. [2022-07-23 04:29:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-23 04:29:33,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:33,715 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-23 04:29:33,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:29:33,716 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-23 04:29:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash 577814734, now seen corresponding path program 1 times [2022-07-23 04:29:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:33,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536362042] [2022-07-23 04:29:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:33,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:29:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:29:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:29:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:29:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:29:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:29:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:29:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:29:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:33,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:34,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:29:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:34,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:29:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-23 04:29:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-23 04:29:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:34,039 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-23 04:29:34,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:34,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536362042] [2022-07-23 04:29:34,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536362042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:29:34,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097308423] [2022-07-23 04:29:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:34,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:29:34,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:29:34,045 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-23 04:29:34,046 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-23 04:29:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:34,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 2025 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:29:34,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:29:34,900 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-23 04:29:34,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:29:34,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097308423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:34,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:29:34,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-23 04:29:34,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789115179] [2022-07-23 04:29:34,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:34,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:29:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:34,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:29:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:29:34,903 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-23 04:29:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:35,031 INFO L93 Difference]: Finished difference Result 1804 states and 2270 transitions. [2022-07-23 04:29:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:29:35,032 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-23 04:29:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:35,038 INFO L225 Difference]: With dead ends: 1804 [2022-07-23 04:29:35,038 INFO L226 Difference]: Without dead ends: 1021 [2022-07-23 04:29:35,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:29:35,041 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-23 04:29:35,042 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-23 04:29:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-07-23 04:29:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1018. [2022-07-23 04:29:35,144 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-23 04:29:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1295 transitions. [2022-07-23 04:29:35,147 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1295 transitions. Word has length 213 [2022-07-23 04:29:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:35,147 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 1295 transitions. [2022-07-23 04:29:35,148 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-23 04:29:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1295 transitions. [2022-07-23 04:29:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-23 04:29:35,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:35,150 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-23 04:29:35,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 04:29:35,371 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-23 04:29:35,372 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-23 04:29:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1999876672, now seen corresponding path program 1 times [2022-07-23 04:29:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:35,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383428978] [2022-07-23 04:29:35,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:29:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:29:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:29:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:35,581 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-23 04:29:35,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:35,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383428978] [2022-07-23 04:29:35,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383428978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:35,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:35,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:35,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262650618] [2022-07-23 04:29:35,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:35,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:35,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:35,583 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-23 04:29:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:38,647 INFO L93 Difference]: Finished difference Result 1873 states and 2381 transitions. [2022-07-23 04:29:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:29:38,647 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-23 04:29:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:38,655 INFO L225 Difference]: With dead ends: 1873 [2022-07-23 04:29:38,656 INFO L226 Difference]: Without dead ends: 1871 [2022-07-23 04:29:38,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-23 04:29:38,657 INFO L413 NwaCegarLoop]: 1304 mSDtfsCounter, 2246 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 1116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 3168 SdHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1116 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:38,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 3168 Invalid, 3237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1116 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 04:29:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-07-23 04:29:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1840. [2022-07-23 04:29:38,821 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-23 04:29:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2354 transitions. [2022-07-23 04:29:38,827 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2354 transitions. Word has length 175 [2022-07-23 04:29:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:38,828 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 2354 transitions. [2022-07-23 04:29:38,828 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-23 04:29:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2354 transitions. [2022-07-23 04:29:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-23 04:29:38,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:38,831 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-23 04:29:38,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 04:29:38,831 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-23 04:29:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:38,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1330314272, now seen corresponding path program 1 times [2022-07-23 04:29:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:38,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550327872] [2022-07-23 04:29:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:29:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:29:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:29:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:29:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:39,036 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-23 04:29:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:39,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550327872] [2022-07-23 04:29:39,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550327872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:39,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:39,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348271275] [2022-07-23 04:29:39,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:39,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:39,038 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-23 04:29:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:40,872 INFO L93 Difference]: Finished difference Result 1840 states and 2354 transitions. [2022-07-23 04:29:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:29:40,873 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-23 04:29:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:40,881 INFO L225 Difference]: With dead ends: 1840 [2022-07-23 04:29:40,881 INFO L226 Difference]: Without dead ends: 1838 [2022-07-23 04:29:40,882 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-23 04:29:40,883 INFO L413 NwaCegarLoop]: 1111 mSDtfsCounter, 1578 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:40,883 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.7s Time] [2022-07-23 04:29:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-07-23 04:29:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2022-07-23 04:29:41,029 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-23 04:29:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2352 transitions. [2022-07-23 04:29:41,036 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2352 transitions. Word has length 181 [2022-07-23 04:29:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:41,037 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2352 transitions. [2022-07-23 04:29:41,037 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-23 04:29:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2352 transitions. [2022-07-23 04:29:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-23 04:29:41,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:41,040 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-23 04:29:41,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 04:29:41,041 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-23 04:29:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:41,041 INFO L85 PathProgramCache]: Analyzing trace with hash -878657064, now seen corresponding path program 1 times [2022-07-23 04:29:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:41,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917638011] [2022-07-23 04:29:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:29:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:29:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:29:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:29:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:29:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:29:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:29:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:29:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-23 04:29:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-23 04:29:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-23 04:29:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:41,415 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-23 04:29:41,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:41,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917638011] [2022-07-23 04:29:41,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917638011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:41,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:41,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:29:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851892164] [2022-07-23 04:29:41,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:41,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:29:41,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:41,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:29:41,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:29:41,418 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-23 04:29:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:45,409 INFO L93 Difference]: Finished difference Result 1915 states and 2454 transitions. [2022-07-23 04:29:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 04:29:45,410 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-23 04:29:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:45,418 INFO L225 Difference]: With dead ends: 1915 [2022-07-23 04:29:45,418 INFO L226 Difference]: Without dead ends: 1913 [2022-07-23 04:29:45,419 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-23 04:29:45,420 INFO L413 NwaCegarLoop]: 1137 mSDtfsCounter, 1503 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 1149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1149 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:45,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 4147 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1149 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-23 04:29:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-07-23 04:29:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1847. [2022-07-23 04:29:45,570 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-23 04:29:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2363 transitions. [2022-07-23 04:29:45,618 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2363 transitions. Word has length 214 [2022-07-23 04:29:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:45,618 INFO L495 AbstractCegarLoop]: Abstraction has 1847 states and 2363 transitions. [2022-07-23 04:29:45,619 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-23 04:29:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2363 transitions. [2022-07-23 04:29:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-23 04:29:45,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:45,621 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-23 04:29:45,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 04:29:45,623 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-23 04:29:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash -701955474, now seen corresponding path program 1 times [2022-07-23 04:29:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868087243] [2022-07-23 04:29:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:29:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:29:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:29:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:29:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:29:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:29:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:29:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:29:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:29:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:29:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:29:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:29:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:29:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:29:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:29:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 04:29:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:45,856 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-23 04:29:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:45,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868087243] [2022-07-23 04:29:45,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868087243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:45,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:45,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:45,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147200470] [2022-07-23 04:29:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:45,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:45,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:45,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:45,859 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-23 04:29:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:49,091 INFO L93 Difference]: Finished difference Result 3551 states and 4564 transitions. [2022-07-23 04:29:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:29:49,092 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-23 04:29:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:49,105 INFO L225 Difference]: With dead ends: 3551 [2022-07-23 04:29:49,105 INFO L226 Difference]: Without dead ends: 3393 [2022-07-23 04:29:49,109 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-23 04:29:49,110 INFO L413 NwaCegarLoop]: 1348 mSDtfsCounter, 2211 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 1099 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1099 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:49,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2339 Valid, 3294 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1099 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-23 04:29:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-07-23 04:29:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3375. [2022-07-23 04:29:49,396 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-23 04:29:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 4367 transitions. [2022-07-23 04:29:49,406 INFO L78 Accepts]: Start accepts. Automaton has 3375 states and 4367 transitions. Word has length 187 [2022-07-23 04:29:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:49,407 INFO L495 AbstractCegarLoop]: Abstraction has 3375 states and 4367 transitions. [2022-07-23 04:29:49,407 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-23 04:29:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3375 states and 4367 transitions. [2022-07-23 04:29:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-23 04:29:49,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:49,410 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-23 04:29:49,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-23 04:29:49,411 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-23 04:29:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash -429016518, now seen corresponding path program 1 times [2022-07-23 04:29:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:49,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809547369] [2022-07-23 04:29:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:29:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:29:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:29:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:29:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:29:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:29:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:29:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:29:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:29:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:29:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:29:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-23 04:29:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-23 04:29:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-23 04:29:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-23 04:29:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:49,692 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-23 04:29:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:49,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809547369] [2022-07-23 04:29:49,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809547369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:49,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:49,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:29:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205740636] [2022-07-23 04:29:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:49,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:29:49,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:49,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:29:49,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:29:49,695 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-23 04:29:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:54,085 INFO L93 Difference]: Finished difference Result 7596 states and 10040 transitions. [2022-07-23 04:29:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:29:54,086 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-23 04:29:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:54,107 INFO L225 Difference]: With dead ends: 7596 [2022-07-23 04:29:54,107 INFO L226 Difference]: Without dead ends: 4675 [2022-07-23 04:29:54,119 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-23 04:29:54,120 INFO L413 NwaCegarLoop]: 1580 mSDtfsCounter, 1215 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 4607 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:54,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 4607 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 2307 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-23 04:29:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2022-07-23 04:29:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 3387. [2022-07-23 04:29:54,514 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-23 04:29:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4382 transitions. [2022-07-23 04:29:54,524 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4382 transitions. Word has length 234 [2022-07-23 04:29:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:54,525 INFO L495 AbstractCegarLoop]: Abstraction has 3387 states and 4382 transitions. [2022-07-23 04:29:54,525 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-23 04:29:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4382 transitions. [2022-07-23 04:29:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-23 04:29:54,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:54,528 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-23 04:29:54,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-23 04:29:54,528 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-23 04:29:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 370781952, now seen corresponding path program 1 times [2022-07-23 04:29:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:54,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158068189] [2022-07-23 04:29:54,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:54,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:29:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:29:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:29:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:29:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:29:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:29:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:29:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:29:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 04:29:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:29:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-23 04:29:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-23 04:29:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:54,796 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-23 04:29:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:54,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158068189] [2022-07-23 04:29:54,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158068189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:54,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:54,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:29:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159992650] [2022-07-23 04:29:54,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:54,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:29:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:54,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:29:54,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:29:54,798 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-23 04:29:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:57,761 INFO L93 Difference]: Finished difference Result 6392 states and 8277 transitions. [2022-07-23 04:29:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:29:57,761 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-23 04:29:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:57,773 INFO L225 Difference]: With dead ends: 6392 [2022-07-23 04:29:57,773 INFO L226 Difference]: Without dead ends: 3461 [2022-07-23 04:29:57,783 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-23 04:29:57,784 INFO L413 NwaCegarLoop]: 1105 mSDtfsCounter, 988 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 820 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:57,784 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.6s Time] [2022-07-23 04:29:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2022-07-23 04:29:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3399. [2022-07-23 04:29:58,052 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-23 04:29:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4394 transitions. [2022-07-23 04:29:58,064 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4394 transitions. Word has length 228 [2022-07-23 04:29:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:58,065 INFO L495 AbstractCegarLoop]: Abstraction has 3399 states and 4394 transitions. [2022-07-23 04:29:58,065 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-23 04:29:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4394 transitions. [2022-07-23 04:29:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-23 04:29:58,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:58,068 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-23 04:29:58,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-23 04:29:58,068 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-23 04:29:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1623362754, now seen corresponding path program 1 times [2022-07-23 04:29:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:58,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050802492] [2022-07-23 04:29:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:29:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:29:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:29:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:29:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:29:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:29:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:29:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:29:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:29:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:29:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:29:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:29:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:29:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:29:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:29:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:29:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 04:29:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:29:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-23 04:29:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-23 04:29:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:58,451 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-23 04:29:58,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:58,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050802492] [2022-07-23 04:29:58,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050802492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:29:58,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229474737] [2022-07-23 04:29:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:58,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:29:58,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:29:58,456 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-23 04:29:58,460 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-23 04:29:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:59,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 2193 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-23 04:29:59,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:29:59,458 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-23 04:29:59,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:29:59,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229474737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:59,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:29:59,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 18 [2022-07-23 04:29:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200629899] [2022-07-23 04:29:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:59,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 04:29:59,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 04:29:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:29:59,461 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-23 04:30:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:00,435 INFO L93 Difference]: Finished difference Result 6236 states and 7976 transitions. [2022-07-23 04:30:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 04:30:00,435 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-23 04:30:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:00,450 INFO L225 Difference]: With dead ends: 6236 [2022-07-23 04:30:00,451 INFO L226 Difference]: Without dead ends: 3695 [2022-07-23 04:30:00,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-07-23 04:30:00,465 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-23 04:30:00,466 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-23 04:30:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2022-07-23 04:30:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3435. [2022-07-23 04:30:00,881 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-23 04:30:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4438 transitions. [2022-07-23 04:30:00,892 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4438 transitions. Word has length 228 [2022-07-23 04:30:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:00,893 INFO L495 AbstractCegarLoop]: Abstraction has 3435 states and 4438 transitions. [2022-07-23 04:30:00,893 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-23 04:30:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4438 transitions. [2022-07-23 04:30:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-23 04:30:00,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:00,896 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-23 04:30:00,926 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-23 04:30:01,119 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-23 04:30:01,120 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-23 04:30:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash 81717830, now seen corresponding path program 1 times [2022-07-23 04:30:01,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:01,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909575436] [2022-07-23 04:30:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:30:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:30:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:30:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:30:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:30:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:30:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:30:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:30:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:30:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:30:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:30:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:30:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:30:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:30:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:30:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:30:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:30:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:30:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:30:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:30:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:30:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:30:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:30:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:30:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:30:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:30:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:30:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:30:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:30:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:30:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 04:30:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:30:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:30:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-23 04:30:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-23 04:30:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-23 04:30:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-23 04:30:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:01,544 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-23 04:30:01,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:01,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909575436] [2022-07-23 04:30:01,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909575436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:30:01,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:30:01,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 04:30:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445599063] [2022-07-23 04:30:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:30:01,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 04:30:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 04:30:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-23 04:30:01,547 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-23 04:30:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:07,607 INFO L93 Difference]: Finished difference Result 7957 states and 10537 transitions. [2022-07-23 04:30:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:30:07,608 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-23 04:30:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:07,621 INFO L225 Difference]: With dead ends: 7957 [2022-07-23 04:30:07,622 INFO L226 Difference]: Without dead ends: 4640 [2022-07-23 04:30:07,630 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-23 04:30:07,631 INFO L413 NwaCegarLoop]: 1529 mSDtfsCounter, 2236 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 5952 mSolverCounterSat, 1583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2236 SdHoareTripleChecker+Valid, 8377 SdHoareTripleChecker+Invalid, 7535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1583 IncrementalHoareTripleChecker+Valid, 5952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:07,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2236 Valid, 8377 Invalid, 7535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1583 Valid, 5952 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-23 04:30:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-23 04:30:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 3444. [2022-07-23 04:30:08,026 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-23 04:30:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 4448 transitions. [2022-07-23 04:30:08,039 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 4448 transitions. Word has length 249 [2022-07-23 04:30:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:08,039 INFO L495 AbstractCegarLoop]: Abstraction has 3444 states and 4448 transitions. [2022-07-23 04:30:08,040 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-23 04:30:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 4448 transitions. [2022-07-23 04:30:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-23 04:30:08,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:08,043 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-23 04:30:08,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-23 04:30:08,043 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-23 04:30:08,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:08,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1493401337, now seen corresponding path program 1 times [2022-07-23 04:30:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:08,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209989822] [2022-07-23 04:30:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:08,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-23 04:30:08,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136899766] [2022-07-23 04:30:08,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:08,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:08,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:30:08,112 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-23 04:30:08,137 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-23 04:30:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:08,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-23 04:30:08,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:30:08,935 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-23 04:30:09,251 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-23 04:30:11,861 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-23 04:30:15,813 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-23 04:30:17,924 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-23 04:30:17,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:30:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209989822] [2022-07-23 04:30:17,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-23 04:30:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136899766] [2022-07-23 04:30:17,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136899766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:30:17,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:30:17,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-23 04:30:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093847501] [2022-07-23 04:30:17,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:30:17,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 04:30:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 04:30:17,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=363, Unknown=5, NotChecked=0, Total=420 [2022-07-23 04:30:17,927 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-23 04:30:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:22,337 INFO L93 Difference]: Finished difference Result 6546 states and 8453 transitions. [2022-07-23 04:30:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 04:30:22,338 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-23 04:30:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:22,355 INFO L225 Difference]: With dead ends: 6546 [2022-07-23 04:30:22,355 INFO L226 Difference]: Without dead ends: 3567 [2022-07-23 04:30:22,366 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-23 04:30:22,367 INFO L413 NwaCegarLoop]: 1277 mSDtfsCounter, 304 mSDsluCounter, 16537 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:22,367 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.8s Time] [2022-07-23 04:30:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2022-07-23 04:30:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3454. [2022-07-23 04:30:22,752 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-23 04:30:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4451 transitions. [2022-07-23 04:30:22,764 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4451 transitions. Word has length 270 [2022-07-23 04:30:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:22,764 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4451 transitions. [2022-07-23 04:30:22,765 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-23 04:30:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4451 transitions. [2022-07-23 04:30:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-23 04:30:22,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:22,794 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-23 04:30:22,827 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-23 04:30:23,003 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-23 04:30:23,004 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-23 04:30:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1495248379, now seen corresponding path program 1 times [2022-07-23 04:30:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:23,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563922541] [2022-07-23 04:30:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:23,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:23,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-23 04:30:23,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868986589] [2022-07-23 04:30:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:30:23,093 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-23 04:30:23,096 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-23 04:30:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:24,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-23 04:30:24,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:30:24,853 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-23 04:30:24,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:30:25,255 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-23 04:30:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:25,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563922541] [2022-07-23 04:30:25,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-23 04:30:25,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868986589] [2022-07-23 04:30:25,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868986589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:30:25,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:30:25,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-23 04:30:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759286656] [2022-07-23 04:30:25,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:30:25,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 04:30:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 04:30:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:30:25,260 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-23 04:30:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:26,534 INFO L93 Difference]: Finished difference Result 7797 states and 10239 transitions. [2022-07-23 04:30:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:30:26,534 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-23 04:30:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:26,548 INFO L225 Difference]: With dead ends: 7797 [2022-07-23 04:30:26,548 INFO L226 Difference]: Without dead ends: 4384 [2022-07-23 04:30:26,556 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-23 04:30:26,557 INFO L413 NwaCegarLoop]: 1481 mSDtfsCounter, 735 mSDsluCounter, 12686 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:26,557 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.6s Time] [2022-07-23 04:30:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-07-23 04:30:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3454. [2022-07-23 04:30:26,945 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-23 04:30:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4449 transitions. [2022-07-23 04:30:26,956 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4449 transitions. Word has length 270 [2022-07-23 04:30:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:26,956 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4449 transitions. [2022-07-23 04:30:26,957 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-23 04:30:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4449 transitions. [2022-07-23 04:30:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-23 04:30:26,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:26,960 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-23 04:30:26,990 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-23 04:30:27,164 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-23 04:30:27,165 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-23 04:30:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:27,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1148313790, now seen corresponding path program 1 times [2022-07-23 04:30:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:27,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486828146] [2022-07-23 04:30:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:27,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-23 04:30:27,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726098668] [2022-07-23 04:30:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:27,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:27,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:30:27,232 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-23 04:30:27,261 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-23 04:30:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:30:28,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 2632 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-23 04:30:28,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:30:28,798 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-23 04:30:28,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:30:29,186 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-23 04:30:29,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:30:29,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486828146] [2022-07-23 04:30:29,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-23 04:30:29,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726098668] [2022-07-23 04:30:29,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726098668] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:30:29,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:30:29,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-23 04:30:29,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32819043] [2022-07-23 04:30:29,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 04:30:29,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 04:30:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:30:29,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 04:30:29,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:30:29,190 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-23 04:30:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:30:30,436 INFO L93 Difference]: Finished difference Result 7784 states and 10219 transitions. [2022-07-23 04:30:30,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:30:30,437 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-23 04:30:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:30:30,454 INFO L225 Difference]: With dead ends: 7784 [2022-07-23 04:30:30,454 INFO L226 Difference]: Without dead ends: 4384 [2022-07-23 04:30:30,467 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-23 04:30:30,468 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 729 mSDsluCounter, 12683 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:30:30,468 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.6s Time] [2022-07-23 04:30:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-07-23 04:30:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3454. [2022-07-23 04:30:30,974 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-23 04:30:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4447 transitions. [2022-07-23 04:30:30,987 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4447 transitions. Word has length 274 [2022-07-23 04:30:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:30:30,987 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4447 transitions. [2022-07-23 04:30:30,987 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-23 04:30:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4447 transitions. [2022-07-23 04:30:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-07-23 04:30:30,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:30:30,990 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-23 04:30:31,037 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-23 04:30:31,205 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-23 04:30:31,205 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-23 04:30:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:30:31,205 INFO L85 PathProgramCache]: Analyzing trace with hash -815079205, now seen corresponding path program 1 times [2022-07-23 04:30:31,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:30:31,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177432713] [2022-07-23 04:30:31,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:31,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:30:31,290 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-23 04:30:31,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68965388] [2022-07-23 04:30:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:30:31,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:30:31,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:30:31,292 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-23 04:30:31,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process