./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--media--usb--ttusb-budget--dvb-ttusb-budget.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--media--usb--ttusb-budget--dvb-ttusb-budget.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 4426d364359557dc10cf7e8f346d379b7d379eaf4a1a095af818bcdb9a3f651d --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:15:02,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:15:02,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:15:02,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:15:02,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:15:02,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:15:02,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:15:02,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:15:02,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:15:02,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:15:02,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:15:02,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:15:02,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:15:02,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:15:02,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:15:02,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:15:02,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:15:02,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:15:02,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:15:02,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:15:02,484 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:15:02,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:15:02,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:15:02,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:15:02,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:15:02,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:15:02,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:15:02,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:15:02,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:15:02,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:15:02,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:15:02,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:15:02,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:15:02,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:15:02,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:15:02,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:15:02,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:15:02,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:15:02,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:15:02,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:15:02,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:15:02,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:15:02,507 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:15:02,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:15:02,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:15:02,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:15:02,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:15:02,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:15:02,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:15:02,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:15:02,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:15:02,545 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:15:02,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:15:02,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:15:02,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:15:02,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:15:02,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:15:02,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:15:02,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:15:02,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:15:02,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:15:02,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:15:02,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:15:02,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:15:02,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:15:02,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:15:02,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:15:02,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:15:02,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:15:02,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:15:02,551 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:15:02,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:15:02,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:15:02,552 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 -> 4426d364359557dc10cf7e8f346d379b7d379eaf4a1a095af818bcdb9a3f651d [2022-07-23 04:15:02,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:15:02,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:15:02,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:15:02,853 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:15:02,853 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:15:02,855 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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i [2022-07-23 04:15:02,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a6dec2c/4ad51d71183e459c941143038de28608/FLAG64d3555c2 [2022-07-23 04:15:03,690 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:15:03,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i [2022-07-23 04:15:03,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a6dec2c/4ad51d71183e459c941143038de28608/FLAG64d3555c2 [2022-07-23 04:15:03,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a6dec2c/4ad51d71183e459c941143038de28608 [2022-07-23 04:15:03,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:15:03,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:15:03,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:15:03,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:15:03,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:15:03,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:15:03" (1/1) ... [2022-07-23 04:15:03,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6269bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:03, skipping insertion in model container [2022-07-23 04:15:03,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:15:03" (1/1) ... [2022-07-23 04:15:03,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:15:04,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:15:06,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405731,405744] [2022-07-23 04:15:06,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405876,405889] [2022-07-23 04:15:06,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406022,406035] [2022-07-23 04:15:06,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406187,406200] [2022-07-23 04:15:06,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406345,406358] [2022-07-23 04:15:06,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406503,406516] [2022-07-23 04:15:06,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406661,406674] [2022-07-23 04:15:06,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406821,406834] [2022-07-23 04:15:06,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406980,406993] [2022-07-23 04:15:06,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407119,407132] [2022-07-23 04:15:06,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407261,407274] [2022-07-23 04:15:06,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407410,407423] [2022-07-23 04:15:06,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407549,407562] [2022-07-23 04:15:06,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407704,407717] [2022-07-23 04:15:06,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407864,407877] [2022-07-23 04:15:06,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408015,408028] [2022-07-23 04:15:06,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408166,408179] [2022-07-23 04:15:06,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408318,408331] [2022-07-23 04:15:06,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408467,408480] [2022-07-23 04:15:06,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408615,408628] [2022-07-23 04:15:06,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408772,408785] [2022-07-23 04:15:06,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408921,408934] [2022-07-23 04:15:06,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409077,409090] [2022-07-23 04:15:06,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409230,409243] [2022-07-23 04:15:06,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409376,409389] [2022-07-23 04:15:06,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409519,409532] [2022-07-23 04:15:06,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409671,409684] [2022-07-23 04:15:06,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409817,409830] [2022-07-23 04:15:06,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409962,409975] [2022-07-23 04:15:06,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410116,410129] [2022-07-23 04:15:06,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410267,410280] [2022-07-23 04:15:06,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410422,410435] [2022-07-23 04:15:06,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410574,410587] [2022-07-23 04:15:06,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410729,410742] [2022-07-23 04:15:06,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410893,410906] [2022-07-23 04:15:06,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411049,411062] [2022-07-23 04:15:06,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411213,411226] [2022-07-23 04:15:06,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411355,411368] [2022-07-23 04:15:06,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411513,411526] [2022-07-23 04:15:06,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411680,411693] [2022-07-23 04:15:06,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411839,411852] [2022-07-23 04:15:06,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411998,412011] [2022-07-23 04:15:06,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412147,412160] [2022-07-23 04:15:06,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412294,412307] [2022-07-23 04:15:06,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412433,412446] [2022-07-23 04:15:06,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412596,412609] [2022-07-23 04:15:06,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412762,412775] [2022-07-23 04:15:06,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412926,412939] [2022-07-23 04:15:06,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413091,413104] [2022-07-23 04:15:06,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413256,413269] [2022-07-23 04:15:06,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413422,413435] [2022-07-23 04:15:06,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413587,413600] [2022-07-23 04:15:06,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413754,413767] [2022-07-23 04:15:06,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413914,413927] [2022-07-23 04:15:06,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414076,414089] [2022-07-23 04:15:06,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414235,414248] [2022-07-23 04:15:06,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414381,414394] [2022-07-23 04:15:06,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414524,414537] [2022-07-23 04:15:06,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414668,414681] [2022-07-23 04:15:06,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414811,414824] [2022-07-23 04:15:06,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414955,414968] [2022-07-23 04:15:06,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415096,415109] [2022-07-23 04:15:06,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415234,415247] [2022-07-23 04:15:06,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415392,415405] [2022-07-23 04:15:06,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415551,415564] [2022-07-23 04:15:06,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415707,415720] [2022-07-23 04:15:06,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415856,415869] [2022-07-23 04:15:06,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416008,416021] [2022-07-23 04:15:06,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416159,416172] [2022-07-23 04:15:06,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416308,416321] [2022-07-23 04:15:06,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416460,416473] [2022-07-23 04:15:06,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416608,416621] [2022-07-23 04:15:06,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416761,416774] [2022-07-23 04:15:06,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416912,416925] [2022-07-23 04:15:06,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417062,417075] [2022-07-23 04:15:06,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417209,417222] [2022-07-23 04:15:06,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417360,417373] [2022-07-23 04:15:06,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417511,417524] [2022-07-23 04:15:06,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417659,417672] [2022-07-23 04:15:06,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417825,417838] [2022-07-23 04:15:06,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417994,418007] [2022-07-23 04:15:06,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418161,418174] [2022-07-23 04:15:06,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418329,418342] [2022-07-23 04:15:06,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418479,418492] [2022-07-23 04:15:06,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418626,418639] [2022-07-23 04:15:06,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418787,418800] [2022-07-23 04:15:06,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418957,418970] [2022-07-23 04:15:06,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[419119,419132] [2022-07-23 04:15:06,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:15:06,886 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:15:07,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405731,405744] [2022-07-23 04:15:07,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405876,405889] [2022-07-23 04:15:07,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406022,406035] [2022-07-23 04:15:07,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406187,406200] [2022-07-23 04:15:07,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406345,406358] [2022-07-23 04:15:07,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406503,406516] [2022-07-23 04:15:07,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406661,406674] [2022-07-23 04:15:07,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406821,406834] [2022-07-23 04:15:07,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406980,406993] [2022-07-23 04:15:07,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407119,407132] [2022-07-23 04:15:07,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407261,407274] [2022-07-23 04:15:07,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407410,407423] [2022-07-23 04:15:07,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407549,407562] [2022-07-23 04:15:07,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407704,407717] [2022-07-23 04:15:07,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407864,407877] [2022-07-23 04:15:07,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408015,408028] [2022-07-23 04:15:07,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408166,408179] [2022-07-23 04:15:07,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408318,408331] [2022-07-23 04:15:07,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408467,408480] [2022-07-23 04:15:07,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408615,408628] [2022-07-23 04:15:07,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408772,408785] [2022-07-23 04:15:07,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[408921,408934] [2022-07-23 04:15:07,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409077,409090] [2022-07-23 04:15:07,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409230,409243] [2022-07-23 04:15:07,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409376,409389] [2022-07-23 04:15:07,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409519,409532] [2022-07-23 04:15:07,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409671,409684] [2022-07-23 04:15:07,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409817,409830] [2022-07-23 04:15:07,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[409962,409975] [2022-07-23 04:15:07,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410116,410129] [2022-07-23 04:15:07,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410267,410280] [2022-07-23 04:15:07,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410422,410435] [2022-07-23 04:15:07,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410574,410587] [2022-07-23 04:15:07,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410729,410742] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[410893,410906] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411049,411062] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411213,411226] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411355,411368] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411513,411526] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411680,411693] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411839,411852] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[411998,412011] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412147,412160] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412294,412307] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412433,412446] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412596,412609] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412762,412775] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[412926,412939] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413091,413104] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413256,413269] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413422,413435] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413587,413600] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413754,413767] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[413914,413927] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414076,414089] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414235,414248] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414381,414394] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414524,414537] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414668,414681] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414811,414824] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[414955,414968] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415096,415109] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415234,415247] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415392,415405] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415551,415564] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415707,415720] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[415856,415869] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416008,416021] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416159,416172] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416308,416321] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416460,416473] [2022-07-23 04:15:07,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416608,416621] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416761,416774] [2022-07-23 04:15:07,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416912,416925] [2022-07-23 04:15:07,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417062,417075] [2022-07-23 04:15:07,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417209,417222] [2022-07-23 04:15:07,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417360,417373] [2022-07-23 04:15:07,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417511,417524] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417659,417672] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417825,417838] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417994,418007] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418161,418174] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418329,418342] [2022-07-23 04:15:07,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--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418479,418492] [2022-07-23 04:15:07,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418626,418639] [2022-07-23 04:15:07,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418787,418800] [2022-07-23 04:15:07,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418957,418970] [2022-07-23 04:15:07,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[419119,419132] [2022-07-23 04:15:07,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:15:07,473 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:15:07,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07 WrapperNode [2022-07-23 04:15:07,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:15:07,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:15:07,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:15:07,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:15:07,482 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:15:07" (1/1) ... [2022-07-23 04:15:07,572 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:15:07" (1/1) ... [2022-07-23 04:15:07,770 INFO L137 Inliner]: procedures = 553, calls = 2286, calls flagged for inlining = 242, calls inlined = 154, statements flattened = 4412 [2022-07-23 04:15:07,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:15:07,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:15:07,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:15:07,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:15:07,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (1/1) ... [2022-07-23 04:15:07,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (1/1) ... [2022-07-23 04:15:07,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (1/1) ... [2022-07-23 04:15:07,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (1/1) ... [2022-07-23 04:15:07,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (1/1) ... [2022-07-23 04:15:07,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (1/1) ... [2022-07-23 04:15:07,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (1/1) ... [2022-07-23 04:15:08,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:15:08,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:15:08,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:15:08,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:15:08,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (1/1) ... [2022-07-23 04:15:08,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:15:08,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:08,046 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:15:08,070 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:15:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:15:08,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:15:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 04:15:08,083 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 04:15:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:15:08,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:15:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:15:08,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:15:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2022-07-23 04:15:08,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2022-07-23 04:15:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:15:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:15:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-07-23 04:15:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-07-23 04:15:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:15:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:15:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 04:15:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:15:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:15:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:15:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:15:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:15:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:15:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure tda1004x_writereg [2022-07-23 04:15:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure tda1004x_writereg [2022-07-23 04:15:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:15:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:15:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:15:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 04:15:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-23 04:15:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-23 04:15:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-23 04:15:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-23 04:15:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 04:15:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:15:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:15:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:15:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:15:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:15:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:15:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:15:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:15:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:15:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_frontend_detach [2022-07-23 04:15:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_frontend_detach [2022-07-23 04:15:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 04:15:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 04:15:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:15:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:15:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 04:15:08,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 04:15:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_stop_iso_xfer [2022-07-23 04:15:08,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_stop_iso_xfer [2022-07-23 04:15:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:15:08,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:15:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:15:08,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:15:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_cmd [2022-07-23 04:15:08,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_cmd [2022-07-23 04:15:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:15:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:15:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:15:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:15:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:15:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:15:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:15:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-23 04:15:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-23 04:15:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:15:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:15:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2022-07-23 04:15:08,092 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2022-07-23 04:15:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_del_adapter [2022-07-23 04:15:08,095 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_del_adapter [2022-07-23 04:15:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_free_iso_urbs [2022-07-23 04:15:08,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_free_iso_urbs [2022-07-23 04:15:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:15:08,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:15:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-23 04:15:08,096 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-23 04:15:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 04:15:08,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 04:15:08,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:15:08,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:15:08,097 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-07-23 04:15:08,097 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-07-23 04:15:08,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 04:15:08,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 04:15:08,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:15:08,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:15:08,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:15:08,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:15:08,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:15:08,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:15:08,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:15:08,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semusb_of_ttusb [2022-07-23 04:15:08,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semusb_of_ttusb [2022-07-23 04:15:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:15:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-23 04:15:08,099 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-23 04:15:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:15:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-23 04:15:08,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-23 04:15:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:15:08,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:15:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-23 04:15:08,100 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-23 04:15:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:15:08,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:15:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 04:15:08,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 04:15:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-23 04:15:08,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-23 04:15:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure master_xfer [2022-07-23 04:15:08,101 INFO L138 BoogieDeclarations]: Found implementation of procedure master_xfer [2022-07-23 04:15:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-23 04:15:08,101 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-23 04:15:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:15:08,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:15:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:15:08,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:15:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:15:08,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:15:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2022-07-23 04:15:08,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2022-07-23 04:15:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-23 04:15:08,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-23 04:15:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:15:08,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:15:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 04:15:08,103 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 04:15:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:15:08,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:15:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:15:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:15:08,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:15:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semi2c_of_ttusb [2022-07-23 04:15:08,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semi2c_of_ttusb [2022-07-23 04:15:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_transfer [2022-07-23 04:15:08,104 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_transfer [2022-07-23 04:15:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:15:08,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:15:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:15:08,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:15:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_semi2c_of_ttusb [2022-07-23 04:15:08,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_semi2c_of_ttusb [2022-07-23 04:15:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_disconnect [2022-07-23 04:15:08,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_disconnect [2022-07-23 04:15:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_get [2022-07-23 04:15:08,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_get [2022-07-23 04:15:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:15:08,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:15:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:15:08,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:15:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-07-23 04:15:08,106 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-07-23 04:15:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_result [2022-07-23 04:15:08,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_result [2022-07-23 04:15:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:15:08,791 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:15:08,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:15:09,147 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:15:15,497 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:15:15,512 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:15:15,512 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 04:15:15,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:15:15 BoogieIcfgContainer [2022-07-23 04:15:15,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:15:15,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:15:15,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:15:15,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:15:15,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:15:03" (1/3) ... [2022-07-23 04:15:15,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1a1c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:15:15, skipping insertion in model container [2022-07-23 04:15:15,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:15:07" (2/3) ... [2022-07-23 04:15:15,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1a1c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:15:15, skipping insertion in model container [2022-07-23 04:15:15,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:15:15" (3/3) ... [2022-07-23 04:15:15,524 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i [2022-07-23 04:15:15,539 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:15:15,539 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-23 04:15:15,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:15:15,614 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@7875a89, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@159c4e7f [2022-07-23 04:15:15,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-23 04:15:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 1174 states, 820 states have (on average 1.3487804878048781) internal successors, (1106), 867 states have internal predecessors, (1106), 255 states have call successors, (255), 71 states have call predecessors, (255), 70 states have return successors, (251), 250 states have call predecessors, (251), 251 states have call successors, (251) [2022-07-23 04:15:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 04:15:15,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:15,641 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:15:15,641 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 26 more)] === [2022-07-23 04:15:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:15,645 INFO L85 PathProgramCache]: Analyzing trace with hash 145990740, now seen corresponding path program 1 times [2022-07-23 04:15:15,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:15,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803911351] [2022-07-23 04:15:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:16,603 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:15:16,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:16,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803911351] [2022-07-23 04:15:16,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803911351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:16,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:16,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357398298] [2022-07-23 04:15:16,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:16,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:16,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:16,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:16,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:16,638 INFO L87 Difference]: Start difference. First operand has 1174 states, 820 states have (on average 1.3487804878048781) internal successors, (1106), 867 states have internal predecessors, (1106), 255 states have call successors, (255), 71 states have call predecessors, (255), 70 states have return successors, (251), 250 states have call predecessors, (251), 251 states have call successors, (251) 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:15:21,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:23,092 INFO L93 Difference]: Finished difference Result 2296 states and 3249 transitions. [2022-07-23 04:15:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:23,094 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:15:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:23,125 INFO L225 Difference]: With dead ends: 2296 [2022-07-23 04:15:23,126 INFO L226 Difference]: Without dead ends: 1157 [2022-07-23 04:15:23,140 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:15:23,142 INFO L413 NwaCegarLoop]: 1489 mSDtfsCounter, 2502 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 844 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:23,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 2931 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 1404 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-07-23 04:15:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-23 04:15:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2022-07-23 04:15:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 810 states have (on average 1.3074074074074074) internal successors, (1059), 853 states have internal predecessors, (1059), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2022-07-23 04:15:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1559 transitions. [2022-07-23 04:15:23,272 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1559 transitions. Word has length 71 [2022-07-23 04:15:23,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:23,273 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1559 transitions. [2022-07-23 04:15:23,273 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:15:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1559 transitions. [2022-07-23 04:15:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 04:15:23,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:23,282 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:15:23,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:15:23,282 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 26 more)] === [2022-07-23 04:15:23,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:23,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1717476351, now seen corresponding path program 1 times [2022-07-23 04:15:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:23,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646701182] [2022-07-23 04:15:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,821 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:15:23,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:23,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646701182] [2022-07-23 04:15:23,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646701182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:23,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:23,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845976385] [2022-07-23 04:15:23,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:23,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:23,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:23,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:23,825 INFO L87 Difference]: Start difference. First operand 1157 states and 1559 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:15:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:28,406 INFO L93 Difference]: Finished difference Result 1157 states and 1559 transitions. [2022-07-23 04:15:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:28,406 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:15:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:28,414 INFO L225 Difference]: With dead ends: 1157 [2022-07-23 04:15:28,414 INFO L226 Difference]: Without dead ends: 1155 [2022-07-23 04:15:28,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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:15:28,416 INFO L413 NwaCegarLoop]: 1471 mSDtfsCounter, 2470 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:28,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 2897 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-23 04:15:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-07-23 04:15:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2022-07-23 04:15:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 809 states have (on average 1.3065512978986402) internal successors, (1057), 851 states have internal predecessors, (1057), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2022-07-23 04:15:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1557 transitions. [2022-07-23 04:15:28,465 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1557 transitions. Word has length 77 [2022-07-23 04:15:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:28,466 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1557 transitions. [2022-07-23 04:15:28,466 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:15:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1557 transitions. [2022-07-23 04:15:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 04:15:28,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:28,468 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:15:28,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:15:28,468 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 26 more)] === [2022-07-23 04:15:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash -710014543, now seen corresponding path program 1 times [2022-07-23 04:15:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:28,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263679552] [2022-07-23 04:15:28,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:28,975 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:15:28,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:28,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263679552] [2022-07-23 04:15:28,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263679552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:28,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:28,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:28,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590949772] [2022-07-23 04:15:28,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:28,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:28,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:28,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:28,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:28,978 INFO L87 Difference]: Start difference. First operand 1155 states and 1557 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:15:33,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:35,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:37,157 INFO L93 Difference]: Finished difference Result 1155 states and 1557 transitions. [2022-07-23 04:15:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:37,157 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:15:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:37,164 INFO L225 Difference]: With dead ends: 1155 [2022-07-23 04:15:37,164 INFO L226 Difference]: Without dead ends: 1153 [2022-07-23 04:15:37,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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:15:37,166 INFO L413 NwaCegarLoop]: 1469 mSDtfsCounter, 2464 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:37,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 2895 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1387 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-07-23 04:15:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-07-23 04:15:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2022-07-23 04:15:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 808 states have (on average 1.3056930693069306) internal successors, (1055), 849 states have internal predecessors, (1055), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2022-07-23 04:15:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1555 transitions. [2022-07-23 04:15:37,209 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1555 transitions. Word has length 83 [2022-07-23 04:15:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:37,210 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1555 transitions. [2022-07-23 04:15:37,210 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:15:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1555 transitions. [2022-07-23 04:15:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-23 04:15:37,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:37,212 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:15:37,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:15:37,212 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 26 more)] === [2022-07-23 04:15:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2116367515, now seen corresponding path program 1 times [2022-07-23 04:15:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:37,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588080493] [2022-07-23 04:15:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:37,703 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:15:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588080493] [2022-07-23 04:15:37,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588080493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:37,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:37,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774078468] [2022-07-23 04:15:37,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:37,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:37,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:37,706 INFO L87 Difference]: Start difference. First operand 1153 states and 1555 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:15:43,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:44,667 INFO L93 Difference]: Finished difference Result 1153 states and 1555 transitions. [2022-07-23 04:15:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:44,668 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:15:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:44,676 INFO L225 Difference]: With dead ends: 1153 [2022-07-23 04:15:44,676 INFO L226 Difference]: Without dead ends: 1151 [2022-07-23 04:15:44,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:15:44,678 INFO L413 NwaCegarLoop]: 1467 mSDtfsCounter, 2458 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:44,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 2893 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1386 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-07-23 04:15:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2022-07-23 04:15:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2022-07-23 04:15:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 807 states have (on average 1.304832713754647) internal successors, (1053), 847 states have internal predecessors, (1053), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2022-07-23 04:15:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1553 transitions. [2022-07-23 04:15:44,727 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1553 transitions. Word has length 89 [2022-07-23 04:15:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:44,728 INFO L495 AbstractCegarLoop]: Abstraction has 1151 states and 1553 transitions. [2022-07-23 04:15:44,728 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:15:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1553 transitions. [2022-07-23 04:15:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 04:15:44,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:44,730 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:15:44,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:15:44,730 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 26 more)] === [2022-07-23 04:15:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1681490694, now seen corresponding path program 1 times [2022-07-23 04:15:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:44,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828722413] [2022-07-23 04:15:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:45,180 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:15:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:45,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828722413] [2022-07-23 04:15:45,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828722413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:45,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:45,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:45,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183415958] [2022-07-23 04:15:45,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:45,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:45,182 INFO L87 Difference]: Start difference. First operand 1151 states and 1553 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:15:49,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:50,960 INFO L93 Difference]: Finished difference Result 1151 states and 1553 transitions. [2022-07-23 04:15:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:50,961 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:15:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:50,967 INFO L225 Difference]: With dead ends: 1151 [2022-07-23 04:15:50,967 INFO L226 Difference]: Without dead ends: 1149 [2022-07-23 04:15:50,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 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:15:50,969 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 2452 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:50,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2604 Valid, 2891 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1384 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-07-23 04:15:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-07-23 04:15:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2022-07-23 04:15:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 806 states have (on average 1.303970223325062) internal successors, (1051), 845 states have internal predecessors, (1051), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2022-07-23 04:15:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1551 transitions. [2022-07-23 04:15:51,012 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1551 transitions. Word has length 95 [2022-07-23 04:15:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:51,013 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1551 transitions. [2022-07-23 04:15:51,013 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:15:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1551 transitions. [2022-07-23 04:15:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-23 04:15:51,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:51,015 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:15:51,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:15:51,015 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 26 more)] === [2022-07-23 04:15:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash 658495343, now seen corresponding path program 1 times [2022-07-23 04:15:51,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:51,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135116427] [2022-07-23 04:15:51,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:51,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:15:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,437 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:15:51,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:51,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135116427] [2022-07-23 04:15:51,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135116427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:51,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:51,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798747850] [2022-07-23 04:15:51,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:51,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:51,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:51,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:51,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:51,440 INFO L87 Difference]: Start difference. First operand 1149 states and 1551 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:15:55,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:15:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:57,266 INFO L93 Difference]: Finished difference Result 1149 states and 1551 transitions. [2022-07-23 04:15:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:57,266 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:15:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:57,272 INFO L225 Difference]: With dead ends: 1149 [2022-07-23 04:15:57,272 INFO L226 Difference]: Without dead ends: 1147 [2022-07-23 04:15:57,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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:15:57,274 INFO L413 NwaCegarLoop]: 1463 mSDtfsCounter, 2446 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:57,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 2889 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1382 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-23 04:15:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-23 04:15:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2022-07-23 04:15:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 805 states have (on average 1.3031055900621118) internal successors, (1049), 843 states have internal predecessors, (1049), 251 states have call successors, (251), 70 states have call predecessors, (251), 69 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2022-07-23 04:15:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1549 transitions. [2022-07-23 04:15:57,317 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1549 transitions. Word has length 101 [2022-07-23 04:15:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:57,318 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1549 transitions. [2022-07-23 04:15:57,318 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:15:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1549 transitions. [2022-07-23 04:15:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-23 04:15:57,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:57,320 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:57,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:15:57,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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 26 more)] === [2022-07-23 04:15:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1011873192, now seen corresponding path program 1 times [2022-07-23 04:15:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:57,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896447499] [2022-07-23 04:15:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:15:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:15:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:15:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-23 04:15:57,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:57,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896447499] [2022-07-23 04:15:57,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896447499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:57,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:57,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689238765] [2022-07-23 04:15:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:57,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:57,896 INFO L87 Difference]: Start difference. First operand 1147 states and 1549 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:16:04,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:07,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:09,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:14,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:17,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:21,260 INFO L93 Difference]: Finished difference Result 1975 states and 2654 transitions. [2022-07-23 04:16:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:16:21,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 6 states have call predecessors, (20), 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:16:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:21,274 INFO L225 Difference]: With dead ends: 1975 [2022-07-23 04:16:21,274 INFO L226 Difference]: Without dead ends: 1973 [2022-07-23 04:16:21,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-07-23 04:16:21,276 INFO L413 NwaCegarLoop]: 1721 mSDtfsCounter, 3805 mSDsluCounter, 2780 mSDsCounter, 0 mSdLazyCounter, 5024 mSolverCounterSat, 1779 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3934 SdHoareTripleChecker+Valid, 4501 SdHoareTripleChecker+Invalid, 6808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1779 IncrementalHoareTripleChecker+Valid, 5024 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:21,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3934 Valid, 4501 Invalid, 6808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1779 Valid, 5024 Invalid, 5 Unknown, 0 Unchecked, 22.8s Time] [2022-07-23 04:16:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2022-07-23 04:16:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1716. [2022-07-23 04:16:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1227 states have (on average 1.308883455582722) internal successors, (1606), 1268 states have internal predecessors, (1606), 352 states have call successors, (352), 115 states have call predecessors, (352), 115 states have return successors, (384), 348 states have call predecessors, (384), 350 states have call successors, (384) [2022-07-23 04:16:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2342 transitions. [2022-07-23 04:16:21,374 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2342 transitions. Word has length 115 [2022-07-23 04:16:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:21,375 INFO L495 AbstractCegarLoop]: Abstraction has 1716 states and 2342 transitions. [2022-07-23 04:16:21,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:16:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2342 transitions. [2022-07-23 04:16:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 04:16:21,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:21,378 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:16:21,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:16:21,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 26 more)] === [2022-07-23 04:16:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1214019974, now seen corresponding path program 1 times [2022-07-23 04:16:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:21,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200610719] [2022-07-23 04:16:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:16:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:16:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:16:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:16:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:16:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:16:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:16:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:16:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:16:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:21,851 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:16:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:21,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200610719] [2022-07-23 04:16:21,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200610719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:21,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:21,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:16:21,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631509039] [2022-07-23 04:16:21,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:21,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:16:21,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:21,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:16:21,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:16:21,854 INFO L87 Difference]: Start difference. First operand 1716 states and 2342 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:16:26,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:28,129 INFO L93 Difference]: Finished difference Result 1716 states and 2342 transitions. [2022-07-23 04:16:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:16:28,129 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:16:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:28,138 INFO L225 Difference]: With dead ends: 1716 [2022-07-23 04:16:28,138 INFO L226 Difference]: Without dead ends: 1714 [2022-07-23 04:16:28,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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:16:28,139 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 2440 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:28,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 2887 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1380 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-07-23 04:16:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-07-23 04:16:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1714. [2022-07-23 04:16:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1226 states have (on average 1.3083197389885808) internal successors, (1604), 1266 states have internal predecessors, (1604), 352 states have call successors, (352), 115 states have call predecessors, (352), 115 states have return successors, (384), 348 states have call predecessors, (384), 350 states have call successors, (384) [2022-07-23 04:16:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2340 transitions. [2022-07-23 04:16:28,216 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2340 transitions. Word has length 107 [2022-07-23 04:16:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:28,217 INFO L495 AbstractCegarLoop]: Abstraction has 1714 states and 2340 transitions. [2022-07-23 04:16:28,217 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:16:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2340 transitions. [2022-07-23 04:16:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-23 04:16:28,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:28,219 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:16:28,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 04:16:28,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 26 more)] === [2022-07-23 04:16:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash 816117705, now seen corresponding path program 1 times [2022-07-23 04:16:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:28,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910261529] [2022-07-23 04:16:28,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:16:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:16:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:16:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:16:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:16:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:16:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:16:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:16:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:16:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:16:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:28,642 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:16:28,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:28,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910261529] [2022-07-23 04:16:28,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910261529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:28,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:28,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:16:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695225016] [2022-07-23 04:16:28,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:28,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:16:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:28,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:16:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:16:28,645 INFO L87 Difference]: Start difference. First operand 1714 states and 2340 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:16:33,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:35,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:36,979 INFO L93 Difference]: Finished difference Result 1714 states and 2340 transitions. [2022-07-23 04:16:36,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:16:36,979 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:16:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:36,987 INFO L225 Difference]: With dead ends: 1714 [2022-07-23 04:16:36,987 INFO L226 Difference]: Without dead ends: 1712 [2022-07-23 04:16:36,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:16:36,989 INFO L413 NwaCegarLoop]: 1459 mSDtfsCounter, 2438 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:36,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 2885 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1373 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2022-07-23 04:16:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-23 04:16:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2022-07-23 04:16:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1225 states have (on average 1.3077551020408162) internal successors, (1602), 1264 states have internal predecessors, (1602), 352 states have call successors, (352), 115 states have call predecessors, (352), 115 states have return successors, (384), 348 states have call predecessors, (384), 350 states have call successors, (384) [2022-07-23 04:16:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2338 transitions. [2022-07-23 04:16:37,067 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2338 transitions. Word has length 113 [2022-07-23 04:16:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:37,068 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2338 transitions. [2022-07-23 04:16:37,068 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:16:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2338 transitions. [2022-07-23 04:16:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-23 04:16:37,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:37,071 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:16:37,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:16:37,071 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 26 more)] === [2022-07-23 04:16:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:37,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1689744756, now seen corresponding path program 1 times [2022-07-23 04:16:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:37,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540295178] [2022-07-23 04:16:37,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:37,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:16:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:16:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:16:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:16:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:16:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:16:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:16:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:16:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:16:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:16:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:37,477 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:16:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:37,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540295178] [2022-07-23 04:16:37,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540295178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:37,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:37,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:16:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873088060] [2022-07-23 04:16:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:37,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:16:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:37,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:16:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:16:37,479 INFO L87 Difference]: Start difference. First operand 1712 states and 2338 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:16:42,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:43,453 INFO L93 Difference]: Finished difference Result 1712 states and 2338 transitions. [2022-07-23 04:16:43,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:16:43,453 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:16:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:43,462 INFO L225 Difference]: With dead ends: 1712 [2022-07-23 04:16:43,462 INFO L226 Difference]: Without dead ends: 1710 [2022-07-23 04:16:43,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 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:16:43,464 INFO L413 NwaCegarLoop]: 1457 mSDtfsCounter, 2426 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:43,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2575 Valid, 2883 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1376 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-23 04:16:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2022-07-23 04:16:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710. [2022-07-23 04:16:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1224 states have (on average 1.3071895424836601) internal successors, (1600), 1262 states have internal predecessors, (1600), 352 states have call successors, (352), 115 states have call predecessors, (352), 115 states have return successors, (384), 348 states have call predecessors, (384), 350 states have call successors, (384) [2022-07-23 04:16:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2336 transitions. [2022-07-23 04:16:43,581 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2336 transitions. Word has length 115 [2022-07-23 04:16:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:43,582 INFO L495 AbstractCegarLoop]: Abstraction has 1710 states and 2336 transitions. [2022-07-23 04:16:43,583 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:16:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2336 transitions. [2022-07-23 04:16:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-23 04:16:43,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:43,585 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] [2022-07-23 04:16:43,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:16:43,585 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:16:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:43,586 INFO L85 PathProgramCache]: Analyzing trace with hash 435234058, now seen corresponding path program 1 times [2022-07-23 04:16:43,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:43,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489244919] [2022-07-23 04:16:43,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:16:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:16:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:16:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:16:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:16:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:16:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:16:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:44,193 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:16:44,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:44,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489244919] [2022-07-23 04:16:44,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489244919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:44,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:44,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:16:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80948033] [2022-07-23 04:16:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:44,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:16:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:16:44,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:16:44,196 INFO L87 Difference]: Start difference. First operand 1710 states and 2336 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:16:47,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:51,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:52,778 INFO L93 Difference]: Finished difference Result 3436 states and 4758 transitions. [2022-07-23 04:16:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:16:52,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-07-23 04:16:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:52,787 INFO L225 Difference]: With dead ends: 3436 [2022-07-23 04:16:52,787 INFO L226 Difference]: Without dead ends: 1764 [2022-07-23 04:16:52,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:16:52,831 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 2711 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 1210 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2884 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1210 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:52,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2884 Valid, 2637 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1210 Valid, 1034 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-07-23 04:16:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-07-23 04:16:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1700. [2022-07-23 04:16:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1214 states have (on average 1.2891268533772653) internal successors, (1565), 1252 states have internal predecessors, (1565), 352 states have call successors, (352), 115 states have call predecessors, (352), 115 states have return successors, (384), 348 states have call predecessors, (384), 350 states have call successors, (384) [2022-07-23 04:16:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2301 transitions. [2022-07-23 04:16:52,936 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2301 transitions. Word has length 157 [2022-07-23 04:16:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:52,938 INFO L495 AbstractCegarLoop]: Abstraction has 1700 states and 2301 transitions. [2022-07-23 04:16:52,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:16:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2301 transitions. [2022-07-23 04:16:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-23 04:16:52,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:52,943 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] [2022-07-23 04:16:52,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:16:52,943 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:16:52,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:52,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1115292428, now seen corresponding path program 1 times [2022-07-23 04:16:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:52,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894436206] [2022-07-23 04:16:52,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:16:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:16:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:16:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:16:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:16:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:16:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:16:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:53,445 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:16:53,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:53,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894436206] [2022-07-23 04:16:53,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894436206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:53,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:53,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:16:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544689803] [2022-07-23 04:16:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:53,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:16:53,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:53,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:16:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:16:53,448 INFO L87 Difference]: Start difference. First operand 1700 states and 2301 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:16:56,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:16:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:59,681 INFO L93 Difference]: Finished difference Result 3044 states and 4105 transitions. [2022-07-23 04:16:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:16:59,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-07-23 04:16:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:59,690 INFO L225 Difference]: With dead ends: 3044 [2022-07-23 04:16:59,690 INFO L226 Difference]: Without dead ends: 1760 [2022-07-23 04:16:59,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:16:59,695 INFO L413 NwaCegarLoop]: 1271 mSDtfsCounter, 2717 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 1202 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1202 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:59,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 2476 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1202 Valid, 1174 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-07-23 04:16:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-07-23 04:16:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1696. [2022-07-23 04:16:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1211 states have (on average 1.2881915772089183) internal successors, (1560), 1248 states have internal predecessors, (1560), 352 states have call successors, (352), 115 states have call predecessors, (352), 115 states have return successors, (384), 348 states have call predecessors, (384), 350 states have call successors, (384) [2022-07-23 04:16:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2296 transitions. [2022-07-23 04:16:59,824 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2296 transitions. Word has length 157 [2022-07-23 04:16:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:59,824 INFO L495 AbstractCegarLoop]: Abstraction has 1696 states and 2296 transitions. [2022-07-23 04:16:59,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:16:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2296 transitions. [2022-07-23 04:16:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-23 04:16:59,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:59,829 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:59,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:16:59,829 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 26 more)] === [2022-07-23 04:16:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1141865086, now seen corresponding path program 1 times [2022-07-23 04:16:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:59,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123018185] [2022-07-23 04:16:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:17:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:17:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:17:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:17:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:17:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:17:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:17:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:17:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:17:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:17:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:17:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:17:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:17:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-23 04:17:00,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:00,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123018185] [2022-07-23 04:17:00,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123018185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:00,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:00,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:17:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601437907] [2022-07-23 04:17:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:00,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:17:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:00,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:17:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:17:00,371 INFO L87 Difference]: Start difference. First operand 1696 states and 2296 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 5 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-23 04:17:07,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:13,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:16,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:18,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:20,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:22,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:17:26,318 INFO L93 Difference]: Finished difference Result 3160 states and 4310 transitions. [2022-07-23 04:17:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:17:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 5 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 133 [2022-07-23 04:17:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:17:26,328 INFO L225 Difference]: With dead ends: 3160 [2022-07-23 04:17:26,328 INFO L226 Difference]: Without dead ends: 1918 [2022-07-23 04:17:26,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-07-23 04:17:26,332 INFO L413 NwaCegarLoop]: 1443 mSDtfsCounter, 1927 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 1078 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1927 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 6081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:17:26,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1927 Valid, 4965 Invalid, 6081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1078 Valid, 4997 Invalid, 6 Unknown, 0 Unchecked, 25.4s Time] [2022-07-23 04:17:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-07-23 04:17:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1793. [2022-07-23 04:17:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1291 states have (on average 1.295120061967467) internal successors, (1672), 1332 states have internal predecessors, (1672), 364 states have call successors, (364), 117 states have call predecessors, (364), 120 states have return successors, (413), 359 states have call predecessors, (413), 362 states have call successors, (413) [2022-07-23 04:17:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2449 transitions. [2022-07-23 04:17:26,425 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2449 transitions. Word has length 133 [2022-07-23 04:17:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:17:26,426 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2449 transitions. [2022-07-23 04:17:26,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 5 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-23 04:17:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2449 transitions. [2022-07-23 04:17:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-23 04:17:26,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:26,428 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:17:26,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:17:26,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 26 more)] === [2022-07-23 04:17:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash 300729364, now seen corresponding path program 1 times [2022-07-23 04:17:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:26,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234952658] [2022-07-23 04:17:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:17:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:17:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:17:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:17:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:17:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:17:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:17:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:17:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:17:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:17:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:17:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:17:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:17:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:17:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:17:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:26,825 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:17:26,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:26,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234952658] [2022-07-23 04:17:26,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234952658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:26,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:26,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:17:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5814473] [2022-07-23 04:17:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:26,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:17:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:26,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:17:26,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:17:26,828 INFO L87 Difference]: Start difference. First operand 1793 states and 2449 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:17:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:17:31,077 INFO L93 Difference]: Finished difference Result 1793 states and 2449 transitions. [2022-07-23 04:17:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:17:31,077 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:17:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:17:31,084 INFO L225 Difference]: With dead ends: 1793 [2022-07-23 04:17:31,084 INFO L226 Difference]: Without dead ends: 1791 [2022-07-23 04:17:31,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:17:31,086 INFO L413 NwaCegarLoop]: 1430 mSDtfsCounter, 2367 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:17:31,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 2827 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-23 04:17:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2022-07-23 04:17:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2022-07-23 04:17:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1290 states have (on average 1.2945736434108528) internal successors, (1670), 1330 states have internal predecessors, (1670), 364 states have call successors, (364), 117 states have call predecessors, (364), 120 states have return successors, (413), 359 states have call predecessors, (413), 362 states have call successors, (413) [2022-07-23 04:17:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2447 transitions. [2022-07-23 04:17:31,177 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2447 transitions. Word has length 121 [2022-07-23 04:17:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:17:31,177 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 2447 transitions. [2022-07-23 04:17:31,177 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:17:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2447 transitions. [2022-07-23 04:17:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-23 04:17:31,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:31,180 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:17:31,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:17:31,180 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:17:31,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1806280261, now seen corresponding path program 1 times [2022-07-23 04:17:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:31,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285989567] [2022-07-23 04:17:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:17:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:17:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:17:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:17:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:17:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:17:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:17:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:17:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:17:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 04:17:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-23 04:17:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:31,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285989567] [2022-07-23 04:17:31,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285989567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:17:31,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878623841] [2022-07-23 04:17:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:17:31,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:17:31,770 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:17:31,773 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:17:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:32,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:17:32,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:17:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-23 04:17:32,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:17:32,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878623841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:32,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:17:32,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-23 04:17:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877115295] [2022-07-23 04:17:32,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:32,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:17:32,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:32,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:17:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:17:32,643 INFO L87 Difference]: Start difference. First operand 1791 states and 2447 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:17:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:17:32,802 INFO L93 Difference]: Finished difference Result 3215 states and 4359 transitions. [2022-07-23 04:17:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:17:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 163 [2022-07-23 04:17:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:17:32,811 INFO L225 Difference]: With dead ends: 3215 [2022-07-23 04:17:32,811 INFO L226 Difference]: Without dead ends: 1843 [2022-07-23 04:17:32,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:17:32,817 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 1492 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1642 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:17:32,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1642 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:17:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-07-23 04:17:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2022-07-23 04:17:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1319 states have (on average 1.288855193328279) internal successors, (1700), 1362 states have internal predecessors, (1700), 379 states have call successors, (379), 123 states have call predecessors, (379), 126 states have return successors, (428), 372 states have call predecessors, (428), 377 states have call successors, (428) [2022-07-23 04:17:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2507 transitions. [2022-07-23 04:17:32,918 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2507 transitions. Word has length 163 [2022-07-23 04:17:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:17:32,919 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 2507 transitions. [2022-07-23 04:17:32,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:17:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2507 transitions. [2022-07-23 04:17:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-23 04:17:32,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:32,921 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] [2022-07-23 04:17:32,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 04:17:33,145 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,SelfDestructingSolverStorable14 [2022-07-23 04:17:33,146 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 26 more)] === [2022-07-23 04:17:33,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1388180961, now seen corresponding path program 1 times [2022-07-23 04:17:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:33,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531809870] [2022-07-23 04:17:33,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:33,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:17:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:17:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:17:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:17:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:17:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:17:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:17:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:17:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:17:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:17:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:33,734 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:17:33,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:33,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531809870] [2022-07-23 04:17:33,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531809870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:33,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:33,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:17:33,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936140880] [2022-07-23 04:17:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:33,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:17:33,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:33,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:17:33,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:17:33,737 INFO L87 Difference]: Start difference. First operand 1840 states and 2507 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:17:39,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:45,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:47,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:49,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:17:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:17:53,662 INFO L93 Difference]: Finished difference Result 3657 states and 5016 transitions. [2022-07-23 04:17:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:17:53,662 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 165 [2022-07-23 04:17:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:17:53,670 INFO L225 Difference]: With dead ends: 3657 [2022-07-23 04:17:53,670 INFO L226 Difference]: Without dead ends: 1912 [2022-07-23 04:17:53,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-23 04:17:53,676 INFO L413 NwaCegarLoop]: 1432 mSDtfsCounter, 2676 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 4075 mSolverCounterSat, 1197 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2849 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1197 IncrementalHoareTripleChecker+Valid, 4075 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:17:53,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2849 Valid, 4179 Invalid, 5276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1197 Valid, 4075 Invalid, 4 Unknown, 0 Unchecked, 19.5s Time] [2022-07-23 04:17:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-07-23 04:17:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1840. [2022-07-23 04:17:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1319 states have (on average 1.287338893100834) internal successors, (1698), 1362 states have internal predecessors, (1698), 379 states have call successors, (379), 123 states have call predecessors, (379), 126 states have return successors, (428), 372 states have call predecessors, (428), 377 states have call successors, (428) [2022-07-23 04:17:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2505 transitions. [2022-07-23 04:17:53,778 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2505 transitions. Word has length 165 [2022-07-23 04:17:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:17:53,778 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 2505 transitions. [2022-07-23 04:17:53,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 04:17:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2505 transitions. [2022-07-23 04:17:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-23 04:17:53,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:17:53,781 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] [2022-07-23 04:17:53,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:17:53,781 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 26 more)] === [2022-07-23 04:17:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:17:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1388240543, now seen corresponding path program 1 times [2022-07-23 04:17:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:17:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769201793] [2022-07-23 04:17:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:17:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:17:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:17:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:17:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:17:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:17:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:17:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:17:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:17:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:17:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:17:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:17:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:17:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:17:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:17:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:17:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:17:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:17:54,307 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:17:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:17:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769201793] [2022-07-23 04:17:54,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769201793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:17:54,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:17:54,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:17:54,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868233763] [2022-07-23 04:17:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:17:54,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:17:54,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:17:54,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:17:54,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:17:54,311 INFO L87 Difference]: Start difference. First operand 1840 states and 2505 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-23 04:17:59,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:05,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:07,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:09,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:12,193 INFO L93 Difference]: Finished difference Result 1912 states and 2619 transitions. [2022-07-23 04:18:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:18:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 165 [2022-07-23 04:18:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:12,202 INFO L225 Difference]: With dead ends: 1912 [2022-07-23 04:18:12,202 INFO L226 Difference]: Without dead ends: 1910 [2022-07-23 04:18:12,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-23 04:18:12,204 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 1529 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 999 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 3772 SdHoareTripleChecker+Invalid, 3936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 999 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:12,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 3772 Invalid, 3936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [999 Valid, 2933 Invalid, 4 Unknown, 0 Unchecked, 17.5s Time] [2022-07-23 04:18:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2022-07-23 04:18:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1838. [2022-07-23 04:18:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1318 states have (on average 1.2860394537177542) internal successors, (1695), 1360 states have internal predecessors, (1695), 379 states have call successors, (379), 123 states have call predecessors, (379), 126 states have return successors, (428), 372 states have call predecessors, (428), 377 states have call successors, (428) [2022-07-23 04:18:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2502 transitions. [2022-07-23 04:18:12,305 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2502 transitions. Word has length 165 [2022-07-23 04:18:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:12,306 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2502 transitions. [2022-07-23 04:18:12,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-23 04:18:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2502 transitions. [2022-07-23 04:18:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-23 04:18:12,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:12,309 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:18:12,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:18:12,309 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 26 more)] === [2022-07-23 04:18:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash 754662761, now seen corresponding path program 1 times [2022-07-23 04:18:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:12,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478493672] [2022-07-23 04:18:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:18:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:18:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:18:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:18:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:18:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:18:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:18:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:18:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:18:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:18:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:18:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:18:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:18:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:18:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:18:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:18:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:12,773 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:18:12,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:12,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478493672] [2022-07-23 04:18:12,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478493672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:12,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:12,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:12,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319859232] [2022-07-23 04:18:12,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:12,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:12,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:12,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:12,776 INFO L87 Difference]: Start difference. First operand 1838 states and 2502 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:18:17,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:19,430 INFO L93 Difference]: Finished difference Result 1838 states and 2502 transitions. [2022-07-23 04:18:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:19,430 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:18:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:19,438 INFO L225 Difference]: With dead ends: 1838 [2022-07-23 04:18:19,439 INFO L226 Difference]: Without dead ends: 1836 [2022-07-23 04:18:19,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:18:19,440 INFO L413 NwaCegarLoop]: 1420 mSDtfsCounter, 2347 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:19,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2494 Valid, 2803 Invalid, 2189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1352 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-23 04:18:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2022-07-23 04:18:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1836. [2022-07-23 04:18:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1317 states have (on average 1.2854973424449507) internal successors, (1693), 1358 states have internal predecessors, (1693), 379 states have call successors, (379), 123 states have call predecessors, (379), 126 states have return successors, (428), 372 states have call predecessors, (428), 377 states have call successors, (428) [2022-07-23 04:18:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2500 transitions. [2022-07-23 04:18:19,531 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2500 transitions. Word has length 127 [2022-07-23 04:18:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:19,532 INFO L495 AbstractCegarLoop]: Abstraction has 1836 states and 2500 transitions. [2022-07-23 04:18:19,532 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:18:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2500 transitions. [2022-07-23 04:18:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-23 04:18:19,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:19,534 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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] [2022-07-23 04:18:19,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:18:19,535 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 26 more)] === [2022-07-23 04:18:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1975583176, now seen corresponding path program 1 times [2022-07-23 04:18:19,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:19,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997466478] [2022-07-23 04:18:19,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:18:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:18:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:19,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:18:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:18:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:18:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:18:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:18:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:18:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:18:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:18:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-23 04:18:20,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:20,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997466478] [2022-07-23 04:18:20,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997466478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:20,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:20,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:18:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041328510] [2022-07-23 04:18:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:20,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:18:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:18:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:18:20,174 INFO L87 Difference]: Start difference. First operand 1836 states and 2500 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:18:27,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:33,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:35,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:37,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:45,953 INFO L93 Difference]: Finished difference Result 3519 states and 4924 transitions. [2022-07-23 04:18:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:18:45,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 140 [2022-07-23 04:18:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:45,967 INFO L225 Difference]: With dead ends: 3519 [2022-07-23 04:18:45,967 INFO L226 Difference]: Without dead ends: 3517 [2022-07-23 04:18:45,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-07-23 04:18:45,969 INFO L413 NwaCegarLoop]: 2045 mSDtfsCounter, 3694 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 5382 mSolverCounterSat, 1863 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3842 SdHoareTripleChecker+Valid, 6011 SdHoareTripleChecker+Invalid, 7249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1863 IncrementalHoareTripleChecker+Valid, 5382 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:45,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3842 Valid, 6011 Invalid, 7249 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1863 Valid, 5382 Invalid, 4 Unknown, 0 Unchecked, 25.0s Time] [2022-07-23 04:18:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2022-07-23 04:18:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3217. [2022-07-23 04:18:46,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 2329 states have (on average 1.2975525976814084) internal successors, (3022), 2408 states have internal predecessors, (3022), 657 states have call successors, (657), 212 states have call predecessors, (657), 217 states have return successors, (854), 628 states have call predecessors, (854), 655 states have call successors, (854) [2022-07-23 04:18:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4533 transitions. [2022-07-23 04:18:46,136 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4533 transitions. Word has length 140 [2022-07-23 04:18:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:46,137 INFO L495 AbstractCegarLoop]: Abstraction has 3217 states and 4533 transitions. [2022-07-23 04:18:46,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:18:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4533 transitions. [2022-07-23 04:18:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-23 04:18:46,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:46,140 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] [2022-07-23 04:18:46,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:18:46,140 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 26 more)] === [2022-07-23 04:18:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1594898698, now seen corresponding path program 1 times [2022-07-23 04:18:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:46,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67149917] [2022-07-23 04:18:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:46,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:18:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:18:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:18:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:18:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:18:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:18:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:18:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:18:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 04:18:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:46,642 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:18:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:46,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67149917] [2022-07-23 04:18:46,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67149917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:46,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:46,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:18:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275941658] [2022-07-23 04:18:46,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:46,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:18:46,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:18:46,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:18:46,645 INFO L87 Difference]: Start difference. First operand 3217 states and 4533 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:18:50,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:53,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:18:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:18:55,290 INFO L93 Difference]: Finished difference Result 6447 states and 9161 transitions. [2022-07-23 04:18:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:18:55,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 172 [2022-07-23 04:18:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:18:55,303 INFO L225 Difference]: With dead ends: 6447 [2022-07-23 04:18:55,304 INFO L226 Difference]: Without dead ends: 3325 [2022-07-23 04:18:55,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:18:55,313 INFO L413 NwaCegarLoop]: 1407 mSDtfsCounter, 2670 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 1223 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2843 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1223 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:18:55,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2843 Valid, 2600 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1223 Valid, 1004 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-07-23 04:18:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2022-07-23 04:18:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3207. [2022-07-23 04:18:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 2320 states have (on average 1.2952586206896552) internal successors, (3005), 2398 states have internal predecessors, (3005), 657 states have call successors, (657), 212 states have call predecessors, (657), 217 states have return successors, (854), 628 states have call predecessors, (854), 655 states have call successors, (854) [2022-07-23 04:18:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 4516 transitions. [2022-07-23 04:18:55,531 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 4516 transitions. Word has length 172 [2022-07-23 04:18:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:18:55,531 INFO L495 AbstractCegarLoop]: Abstraction has 3207 states and 4516 transitions. [2022-07-23 04:18:55,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:18:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 4516 transitions. [2022-07-23 04:18:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-23 04:18:55,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:18:55,534 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:55,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:18:55,534 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 26 more)] === [2022-07-23 04:18:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:18:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash 752024843, now seen corresponding path program 1 times [2022-07-23 04:18:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:18:55,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717403138] [2022-07-23 04:18:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:18:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:18:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:18:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:18:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:18:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:18:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:18:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:18:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:18:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:18:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:18:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:18:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:18:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:18:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:18:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:18:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:18:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:18:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:18:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:18:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:18:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-23 04:18:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:18:55,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717403138] [2022-07-23 04:18:55,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717403138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:18:55,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:18:55,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:18:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808444788] [2022-07-23 04:18:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:18:55,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:18:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:18:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:18:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:18:55,927 INFO L87 Difference]: Start difference. First operand 3207 states and 4516 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)