./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--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-?-6c24879 [2022-07-12 16:57:48,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:57:48,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:57:48,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:57:48,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:57:48,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:57:48,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:57:48,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:57:48,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:57:48,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:57:48,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:57:48,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:57:48,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:57:48,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:57:48,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:57:48,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:57:48,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:57:48,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:57:48,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:57:48,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:57:48,585 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:57:48,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:57:48,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:57:48,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:57:48,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:57:48,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:57:48,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:57:48,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:57:48,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:57:48,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:57:48,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:57:48,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:57:48,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:57:48,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:57:48,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:57:48,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:57:48,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:57:48,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:57:48,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:57:48,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:57:48,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:57:48,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:57:48,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:57:48,620 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:57:48,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:57:48,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:57:48,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:57:48,621 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:57:48,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:57:48,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:57:48,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:57:48,622 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:57:48,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:57:48,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:57:48,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:57:48,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:57:48,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:57:48,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:57:48,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:57:48,624 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:57:48,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:57:48,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:57:48,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:57:48,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:57:48,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:57:48,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:57:48,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:57:48,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:57:48,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:57:48,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:57:48,625 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:57:48,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:57:48,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:57:48,626 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-12 16:57:48,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:57:48,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:57:48,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:57:48,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:57:48,817 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:57:48,818 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-12 16:57:48,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac8d7948/39bc8011ce0945aaa3bb66d6e5ffd06a/FLAG0d9790039 [2022-07-12 16:57:49,539 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:57:49,540 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-12 16:57:49,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac8d7948/39bc8011ce0945aaa3bb66d6e5ffd06a/FLAG0d9790039 [2022-07-12 16:57:49,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac8d7948/39bc8011ce0945aaa3bb66d6e5ffd06a [2022-07-12 16:57:49,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:57:49,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:57:49,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:57:49,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:57:49,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:57:49,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:57:49" (1/1) ... [2022-07-12 16:57:49,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75101257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:49, skipping insertion in model container [2022-07-12 16:57:49,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:57:49" (1/1) ... [2022-07-12 16:57:49,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:57:49,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:57:52,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405731,405744] [2022-07-12 16:57:52,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[405876,405889] [2022-07-12 16:57:52,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406022,406035] [2022-07-12 16:57:52,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406187,406200] [2022-07-12 16:57:52,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406345,406358] [2022-07-12 16:57:52,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406503,406516] [2022-07-12 16:57:52,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406661,406674] [2022-07-12 16:57:52,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[406821,406834] [2022-07-12 16:57:52,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407410,407423] [2022-07-12 16:57:52,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407549,407562] [2022-07-12 16:57:52,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407704,407717] [2022-07-12 16:57:52,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[407864,407877] [2022-07-12 16:57:52,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418626,418639] [2022-07-12 16:57:52,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418787,418800] [2022-07-12 16:57:52,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418957,418970] [2022-07-12 16:57:52,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[419119,419132] [2022-07-12 16:57:52,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:57:52,400 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:57:52,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12 16:57:52,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:57:52,777 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:57:52,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52 WrapperNode [2022-07-12 16:57:52,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:57:52,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:57:52,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:57:52,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:57:52,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:52,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:52,999 INFO L137 Inliner]: procedures = 553, calls = 2286, calls flagged for inlining = 242, calls inlined = 154, statements flattened = 4412 [2022-07-12 16:57:53,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:57:53,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:57:53,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:57:53,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:57:53,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:53,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:53,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:53,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:53,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:53,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:53,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:53,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:57:53,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:57:53,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:57:53,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:57:53,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (1/1) ... [2022-07-12 16:57:53,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:57:53,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:53,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 16:57:53,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 16:57:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:57:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:57:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 16:57:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 16:57:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:57:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:57:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:57:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:57:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2022-07-12 16:57:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2022-07-12 16:57:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:57:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:57:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-07-12 16:57:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-07-12 16:57:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:57:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:57:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 16:57:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 16:57:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 16:57:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:57:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:57:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:57:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:57:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure tda1004x_writereg [2022-07-12 16:57:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure tda1004x_writereg [2022-07-12 16:57:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 16:57:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:57:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:57:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 16:57:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-12 16:57:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-12 16:57:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 16:57:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 16:57:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 16:57:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 16:57:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 16:57:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:57:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:57:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:57:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:57:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:57:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:57:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:57:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_frontend_detach [2022-07-12 16:57:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_frontend_detach [2022-07-12 16:57:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 16:57:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 16:57:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:57:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:57:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 16:57:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 16:57:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_stop_iso_xfer [2022-07-12 16:57:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_stop_iso_xfer [2022-07-12 16:57:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:57:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:57:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:57:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:57:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_cmd [2022-07-12 16:57:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_cmd [2022-07-12 16:57:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:57:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:57:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:57:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:57:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 16:57:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:57:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:57:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 16:57:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 16:57:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:57:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:57:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2022-07-12 16:57:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2022-07-12 16:57:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_del_adapter [2022-07-12 16:57:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_del_adapter [2022-07-12 16:57:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_free_iso_urbs [2022-07-12 16:57:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_free_iso_urbs [2022-07-12 16:57:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:57:53,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:57:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-12 16:57:53,277 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-12 16:57:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 16:57:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 16:57:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:57:53,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:57:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-07-12 16:57:53,278 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-07-12 16:57:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 16:57:53,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 16:57:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:57:53,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:57:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:57:53,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:57:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 16:57:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:57:53,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:57:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semusb_of_ttusb [2022-07-12 16:57:53,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semusb_of_ttusb [2022-07-12 16:57:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 16:57:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-12 16:57:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-12 16:57:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:57:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-12 16:57:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-12 16:57:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:57:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:57:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 16:57:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 16:57:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:57:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:57:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 16:57:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 16:57:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 16:57:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 16:57:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure master_xfer [2022-07-12 16:57:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure master_xfer [2022-07-12 16:57:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-12 16:57:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-12 16:57:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:57:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:57:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:57:53,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:57:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:57:53,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:57:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2022-07-12 16:57:53,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2022-07-12 16:57:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 16:57:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 16:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:57:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 16:57:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 16:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:57:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 16:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:57:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:57:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semi2c_of_ttusb [2022-07-12 16:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semi2c_of_ttusb [2022-07-12 16:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_transfer [2022-07-12 16:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_transfer [2022-07-12 16:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_semi2c_of_ttusb [2022-07-12 16:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_semi2c_of_ttusb [2022-07-12 16:57:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_disconnect [2022-07-12 16:57:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_disconnect [2022-07-12 16:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_get [2022-07-12 16:57:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_get [2022-07-12 16:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 16:57:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 16:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:57:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-07-12 16:57:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-07-12 16:57:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_result [2022-07-12 16:57:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_result [2022-07-12 16:57:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:57:53,866 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:57:53,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 16:57:54,065 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 16:57:59,116 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 16:57:59,130 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 16:57:59,134 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 16:57:59,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:57:59 BoogieIcfgContainer [2022-07-12 16:57:59,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 16:57:59,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 16:57:59,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 16:57:59,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 16:57:59,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:57:49" (1/3) ... [2022-07-12 16:57:59,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af0d736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:57:59, skipping insertion in model container [2022-07-12 16:57:59,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:52" (2/3) ... [2022-07-12 16:57:59,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af0d736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:57:59, skipping insertion in model container [2022-07-12 16:57:59,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:57:59" (3/3) ... [2022-07-12 16:57:59,146 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i [2022-07-12 16:57:59,155 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 16:57:59,155 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-12 16:57:59,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 16:57:59,214 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@696fdc78, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@261d6a42 [2022-07-12 16:57:59,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-12 16:57:59,220 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-12 16:57:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 16:57:59,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:59,228 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:59,229 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-12 16:57:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 145990740, now seen corresponding path program 1 times [2022-07-12 16:57:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:59,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670030237] [2022-07-12 16:57:59,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:59,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:57:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:57:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:57:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:57:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:57:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:59,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670030237] [2022-07-12 16:57:59,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670030237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:59,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:59,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053475100] [2022-07-12 16:57:59,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:59,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:00,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:00,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:00,008 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-12 16:58:04,885 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-12 16:58:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:06,617 INFO L93 Difference]: Finished difference Result 2296 states and 3249 transitions. [2022-07-12 16:58:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:06,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-07-12 16:58:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:06,647 INFO L225 Difference]: With dead ends: 2296 [2022-07-12 16:58:06,648 INFO L226 Difference]: Without dead ends: 1157 [2022-07-12 16:58:06,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:06,662 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:06,663 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.3s Time] [2022-07-12 16:58:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-12 16:58:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2022-07-12 16:58:06,745 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-12 16:58:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1559 transitions. [2022-07-12 16:58:06,753 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1559 transitions. Word has length 71 [2022-07-12 16:58:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:06,755 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1559 transitions. [2022-07-12 16:58:06,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 16:58:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1559 transitions. [2022-07-12 16:58:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 16:58:06,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:06,757 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:06,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 16:58:06,758 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-12 16:58:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1717476351, now seen corresponding path program 1 times [2022-07-12 16:58:06,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:06,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178039705] [2022-07-12 16:58:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:07,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178039705] [2022-07-12 16:58:07,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178039705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:07,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:07,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:07,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929569986] [2022-07-12 16:58:07,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:07,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:07,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:07,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:07,155 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-12 16:58:12,081 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-12 16:58:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:13,591 INFO L93 Difference]: Finished difference Result 1157 states and 1559 transitions. [2022-07-12 16:58:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:13,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-07-12 16:58:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:13,598 INFO L225 Difference]: With dead ends: 1157 [2022-07-12 16:58:13,598 INFO L226 Difference]: Without dead ends: 1155 [2022-07-12 16:58:13,599 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-12 16:58:13,600 INFO L413 NwaCegarLoop]: 1471 mSDtfsCounter, 2470 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:13,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 2897 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1390 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 16:58:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-07-12 16:58:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2022-07-12 16:58:13,635 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-12 16:58:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1557 transitions. [2022-07-12 16:58:13,640 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1557 transitions. Word has length 77 [2022-07-12 16:58:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:13,641 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1557 transitions. [2022-07-12 16:58:13,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 16:58:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1557 transitions. [2022-07-12 16:58:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 16:58:13,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:13,642 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:13,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 16:58:13,643 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-12 16:58:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash -710014543, now seen corresponding path program 1 times [2022-07-12 16:58:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:13,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947017661] [2022-07-12 16:58:13,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:14,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947017661] [2022-07-12 16:58:14,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947017661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:14,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:14,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:14,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697745475] [2022-07-12 16:58:14,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:14,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:14,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:14,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:14,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:14,054 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-12 16:58:18,996 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-12 16:58:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:20,370 INFO L93 Difference]: Finished difference Result 1155 states and 1557 transitions. [2022-07-12 16:58:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:20,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-07-12 16:58:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:20,375 INFO L225 Difference]: With dead ends: 1155 [2022-07-12 16:58:20,376 INFO L226 Difference]: Without dead ends: 1153 [2022-07-12 16:58:20,376 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-12 16:58:20,377 INFO L413 NwaCegarLoop]: 1469 mSDtfsCounter, 2464 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:20,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 2895 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1388 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 16:58:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-07-12 16:58:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2022-07-12 16:58:20,404 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-12 16:58:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1555 transitions. [2022-07-12 16:58:20,409 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1555 transitions. Word has length 83 [2022-07-12 16:58:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:20,409 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1555 transitions. [2022-07-12 16:58:20,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 16:58:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1555 transitions. [2022-07-12 16:58:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 16:58:20,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:20,411 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:20,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 16:58:20,411 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-12 16:58:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2116367515, now seen corresponding path program 1 times [2022-07-12 16:58:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:20,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305998167] [2022-07-12 16:58:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:20,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305998167] [2022-07-12 16:58:20,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305998167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:20,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:20,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676115541] [2022-07-12 16:58:20,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:20,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:20,815 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-12 16:58:25,826 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-12 16:58:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:27,165 INFO L93 Difference]: Finished difference Result 1153 states and 1555 transitions. [2022-07-12 16:58:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:27,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-07-12 16:58:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:27,182 INFO L225 Difference]: With dead ends: 1153 [2022-07-12 16:58:27,182 INFO L226 Difference]: Without dead ends: 1151 [2022-07-12 16:58:27,182 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-12 16:58:27,184 INFO L413 NwaCegarLoop]: 1467 mSDtfsCounter, 2458 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:27,187 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.1s Time] [2022-07-12 16:58:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2022-07-12 16:58:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2022-07-12 16:58:27,213 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-12 16:58:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1553 transitions. [2022-07-12 16:58:27,217 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1553 transitions. Word has length 89 [2022-07-12 16:58:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:27,217 INFO L495 AbstractCegarLoop]: Abstraction has 1151 states and 1553 transitions. [2022-07-12 16:58:27,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:58:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1553 transitions. [2022-07-12 16:58:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 16:58:27,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:27,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] [2022-07-12 16:58:27,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 16:58:27,219 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-12 16:58:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1681490694, now seen corresponding path program 1 times [2022-07-12 16:58:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:27,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127938849] [2022-07-12 16:58:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:27,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127938849] [2022-07-12 16:58:27,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127938849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:27,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:27,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810434041] [2022-07-12 16:58:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:27,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:27,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:27,591 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-12 16:58:31,895 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-12 16:58:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:33,026 INFO L93 Difference]: Finished difference Result 1151 states and 1553 transitions. [2022-07-12 16:58:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-07-12 16:58:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:33,032 INFO L225 Difference]: With dead ends: 1151 [2022-07-12 16:58:33,032 INFO L226 Difference]: Without dead ends: 1149 [2022-07-12 16:58:33,033 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-12 16:58:33,033 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 2452 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:33,035 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.3s Time] [2022-07-12 16:58:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-07-12 16:58:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2022-07-12 16:58:33,060 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-12 16:58:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1551 transitions. [2022-07-12 16:58:33,064 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1551 transitions. Word has length 95 [2022-07-12 16:58:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:33,065 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1551 transitions. [2022-07-12 16:58:33,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:58:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1551 transitions. [2022-07-12 16:58:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 16:58:33,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:33,066 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:33,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 16:58:33,067 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-12 16:58:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash 658495343, now seen corresponding path program 1 times [2022-07-12 16:58:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:33,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320290736] [2022-07-12 16:58:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:33,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320290736] [2022-07-12 16:58:33,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320290736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:33,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:33,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495105342] [2022-07-12 16:58:33,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:33,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:33,420 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-12 16:58:37,904 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-12 16:58:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:39,163 INFO L93 Difference]: Finished difference Result 1149 states and 1551 transitions. [2022-07-12 16:58:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-07-12 16:58:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:39,171 INFO L225 Difference]: With dead ends: 1149 [2022-07-12 16:58:39,171 INFO L226 Difference]: Without dead ends: 1147 [2022-07-12 16:58:39,172 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-12 16:58:39,173 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:39,173 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.6s Time] [2022-07-12 16:58:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-12 16:58:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2022-07-12 16:58:39,201 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-12 16:58:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1549 transitions. [2022-07-12 16:58:39,205 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1549 transitions. Word has length 101 [2022-07-12 16:58:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:39,205 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1549 transitions. [2022-07-12 16:58:39,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:58:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1549 transitions. [2022-07-12 16:58:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 16:58:39,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:39,207 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-12 16:58:39,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 16:58:39,207 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-12 16:58:39,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1011873192, now seen corresponding path program 1 times [2022-07-12 16:58:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:39,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304638815] [2022-07-12 16:58:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:58:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 16:58:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:58:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:39,692 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-12 16:58:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:39,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304638815] [2022-07-12 16:58:39,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304638815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:39,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:39,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:39,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672778236] [2022-07-12 16:58:39,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:39,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:39,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:39,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:39,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:39,694 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-12 16:58:46,215 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-12 16:58:49,897 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-12 16:58:53,078 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-12 16:58:55,174 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-12 16:58:57,278 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-12 16:58:59,516 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-12 16:59:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:04,467 INFO L93 Difference]: Finished difference Result 1986 states and 2671 transitions. [2022-07-12 16:59:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 16:59:04,467 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-12 16:59:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:04,474 INFO L225 Difference]: With dead ends: 1986 [2022-07-12 16:59:04,475 INFO L226 Difference]: Without dead ends: 1984 [2022-07-12 16:59:04,475 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-12 16:59:04,476 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 3860 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 5014 mSolverCounterSat, 1803 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3989 SdHoareTripleChecker+Valid, 4477 SdHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 5014 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:04,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3989 Valid, 4477 Invalid, 6823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1803 Valid, 5014 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2022-07-12 16:59:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2022-07-12 16:59:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1727. [2022-07-12 16:59:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1236 states have (on average 1.3098705501618122) internal successors, (1619), 1277 states have internal predecessors, (1619), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2022-07-12 16:59:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2359 transitions. [2022-07-12 16:59:04,545 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2359 transitions. Word has length 115 [2022-07-12 16:59:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:04,546 INFO L495 AbstractCegarLoop]: Abstraction has 1727 states and 2359 transitions. [2022-07-12 16:59:04,546 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-12 16:59:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2359 transitions. [2022-07-12 16:59:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 16:59:04,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:04,549 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:04,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 16:59:04,550 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-12 16:59:04,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1214019974, now seen corresponding path program 1 times [2022-07-12 16:59:04,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:04,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2656168] [2022-07-12 16:59:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:04,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:59:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:59:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:59:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:59:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:59:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:59:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:59:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:59:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:59:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:59:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:59:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2656168] [2022-07-12 16:59:04,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2656168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:04,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:04,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:04,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713768338] [2022-07-12 16:59:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:04,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:04,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:04,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:04,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:04,907 INFO L87 Difference]: Start difference. First operand 1727 states and 2359 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:59:09,706 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-12 16:59:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:10,947 INFO L93 Difference]: Finished difference Result 1727 states and 2359 transitions. [2022-07-12 16:59:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-07-12 16:59:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:10,954 INFO L225 Difference]: With dead ends: 1727 [2022-07-12 16:59:10,954 INFO L226 Difference]: Without dead ends: 1725 [2022-07-12 16:59:10,955 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-12 16:59:10,955 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 2440 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:10,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 2887 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1380 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 16:59:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2022-07-12 16:59:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1725. [2022-07-12 16:59:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1235 states have (on average 1.3093117408906882) internal successors, (1617), 1275 states have internal predecessors, (1617), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2022-07-12 16:59:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2357 transitions. [2022-07-12 16:59:11,006 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2357 transitions. Word has length 107 [2022-07-12 16:59:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:11,006 INFO L495 AbstractCegarLoop]: Abstraction has 1725 states and 2357 transitions. [2022-07-12 16:59:11,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:59:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2357 transitions. [2022-07-12 16:59:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 16:59:11,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:11,008 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:11,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 16:59:11,008 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-12 16:59:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:11,009 INFO L85 PathProgramCache]: Analyzing trace with hash 816117705, now seen corresponding path program 1 times [2022-07-12 16:59:11,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:11,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933867387] [2022-07-12 16:59:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:11,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:59:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:59:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:59:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:59:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:59:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:59:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:59:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:59:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:59:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:59:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:59:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:59:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:11,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933867387] [2022-07-12 16:59:11,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933867387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:11,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:11,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358297204] [2022-07-12 16:59:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:11,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:11,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:11,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:11,317 INFO L87 Difference]: Start difference. First operand 1725 states and 2357 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:59:15,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:59:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:17,203 INFO L93 Difference]: Finished difference Result 1725 states and 2357 transitions. [2022-07-12 16:59:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:17,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-07-12 16:59:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:17,209 INFO L225 Difference]: With dead ends: 1725 [2022-07-12 16:59:17,210 INFO L226 Difference]: Without dead ends: 1723 [2022-07-12 16:59:17,210 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-12 16:59:17,211 INFO L413 NwaCegarLoop]: 1459 mSDtfsCounter, 2438 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:17,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 2885 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1374 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 16:59:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2022-07-12 16:59:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2022-07-12 16:59:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1234 states have (on average 1.3087520259319287) internal successors, (1615), 1273 states have internal predecessors, (1615), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2022-07-12 16:59:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2355 transitions. [2022-07-12 16:59:17,265 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2355 transitions. Word has length 113 [2022-07-12 16:59:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:17,265 INFO L495 AbstractCegarLoop]: Abstraction has 1723 states and 2355 transitions. [2022-07-12 16:59:17,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:59:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2355 transitions. [2022-07-12 16:59:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 16:59:17,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:17,267 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:17,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 16:59:17,267 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-12 16:59:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:17,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1689744756, now seen corresponding path program 1 times [2022-07-12 16:59:17,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:17,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115808578] [2022-07-12 16:59:17,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:59:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:59:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:59:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:59:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:59:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:59:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:59:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:59:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:59:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:59:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:59:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:59:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:17,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115808578] [2022-07-12 16:59:17,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115808578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:17,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:17,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886025404] [2022-07-12 16:59:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:17,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:17,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:17,641 INFO L87 Difference]: Start difference. First operand 1723 states and 2355 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:59:21,756 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-12 16:59:24,310 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-12 16:59:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:25,619 INFO L93 Difference]: Finished difference Result 1723 states and 2355 transitions. [2022-07-12 16:59:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:25,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-07-12 16:59:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:25,626 INFO L225 Difference]: With dead ends: 1723 [2022-07-12 16:59:25,626 INFO L226 Difference]: Without dead ends: 1721 [2022-07-12 16:59:25,627 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-12 16:59:25,627 INFO L413 NwaCegarLoop]: 1457 mSDtfsCounter, 2426 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:25,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2575 Valid, 2883 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1375 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2022-07-12 16:59:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2022-07-12 16:59:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2022-07-12 16:59:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1233 states have (on average 1.308191403081914) internal successors, (1613), 1271 states have internal predecessors, (1613), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2022-07-12 16:59:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2353 transitions. [2022-07-12 16:59:25,678 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2353 transitions. Word has length 115 [2022-07-12 16:59:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:25,678 INFO L495 AbstractCegarLoop]: Abstraction has 1721 states and 2353 transitions. [2022-07-12 16:59:25,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:59:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2353 transitions. [2022-07-12 16:59:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 16:59:25,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:25,680 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-12 16:59:25,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 16:59:25,680 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-12 16:59:25,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 435234058, now seen corresponding path program 1 times [2022-07-12 16:59:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:25,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82074846] [2022-07-12 16:59:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:25,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:59:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:59:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:59:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:25,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:59:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:59:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:59:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:59:26,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:26,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82074846] [2022-07-12 16:59:26,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82074846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:26,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:26,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131842425] [2022-07-12 16:59:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:26,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:26,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:26,121 INFO L87 Difference]: Start difference. First operand 1721 states and 2353 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-12 16:59:29,314 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-12 16:59:32,680 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-12 16:59:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:34,009 INFO L93 Difference]: Finished difference Result 3458 states and 4792 transitions. [2022-07-12 16:59:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:34,009 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-12 16:59:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:34,019 INFO L225 Difference]: With dead ends: 3458 [2022-07-12 16:59:34,019 INFO L226 Difference]: Without dead ends: 1775 [2022-07-12 16:59:34,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:34,025 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 2711 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 1210 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s 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, 7.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:34,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2884 Valid, 2637 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1210 Valid, 1034 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-07-12 16:59:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-07-12 16:59:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1711. [2022-07-12 16:59:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1223 states have (on average 1.2902698282910874) internal successors, (1578), 1261 states have internal predecessors, (1578), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2022-07-12 16:59:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2318 transitions. [2022-07-12 16:59:34,096 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2318 transitions. Word has length 157 [2022-07-12 16:59:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:34,096 INFO L495 AbstractCegarLoop]: Abstraction has 1711 states and 2318 transitions. [2022-07-12 16:59:34,096 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-12 16:59:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2318 transitions. [2022-07-12 16:59:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 16:59:34,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:34,098 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-12 16:59:34,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 16:59:34,098 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-12 16:59:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1115292428, now seen corresponding path program 1 times [2022-07-12 16:59:34,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:34,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813147425] [2022-07-12 16:59:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:59:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:59:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:59:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:59:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:59:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:59:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:59:34,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:34,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813147425] [2022-07-12 16:59:34,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813147425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:34,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:34,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021906223] [2022-07-12 16:59:34,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:34,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:34,487 INFO L87 Difference]: Start difference. First operand 1711 states and 2318 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-12 16:59:37,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:59:41,073 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-12 16:59:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:42,559 INFO L93 Difference]: Finished difference Result 3066 states and 4139 transitions. [2022-07-12 16:59:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 16:59:42,560 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-12 16:59:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:42,567 INFO L225 Difference]: With dead ends: 3066 [2022-07-12 16:59:42,567 INFO L226 Difference]: Without dead ends: 1771 [2022-07-12 16:59:42,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:59:42,571 INFO L413 NwaCegarLoop]: 1271 mSDtfsCounter, 2717 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 1202 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1202 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:42,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 2476 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1202 Valid, 1173 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-07-12 16:59:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-12 16:59:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1707. [2022-07-12 16:59:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1220 states have (on average 1.289344262295082) internal successors, (1573), 1257 states have internal predecessors, (1573), 354 states have call successors, (354), 115 states have call predecessors, (354), 115 states have return successors, (386), 350 states have call predecessors, (386), 352 states have call successors, (386) [2022-07-12 16:59:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2313 transitions. [2022-07-12 16:59:42,629 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2313 transitions. Word has length 157 [2022-07-12 16:59:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:42,629 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2313 transitions. [2022-07-12 16:59:42,629 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-12 16:59:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2313 transitions. [2022-07-12 16:59:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 16:59:42,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:42,631 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-12 16:59:42,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 16:59:42,631 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-12 16:59:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1141865086, now seen corresponding path program 1 times [2022-07-12 16:59:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:42,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686590719] [2022-07-12 16:59:42,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:59:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:59:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:59:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:59:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:59:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:59:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:43,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 16:59:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:43,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:59:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:59:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:43,077 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-12 16:59:43,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:43,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686590719] [2022-07-12 16:59:43,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686590719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:43,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:43,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 16:59:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391018995] [2022-07-12 16:59:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:43,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 16:59:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 16:59:43,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:59:43,084 INFO L87 Difference]: Start difference. First operand 1707 states and 2313 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-12 16:59:49,249 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-12 16:59:54,037 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-12 16:59:58,008 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-12 17:00:00,148 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-12 17:00:02,287 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-12 17:00:04,423 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-12 17:00:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:08,241 INFO L93 Difference]: Finished difference Result 3182 states and 4344 transitions. [2022-07-12 17:00:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 17:00:08,242 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-12 17:00:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:08,249 INFO L225 Difference]: With dead ends: 3182 [2022-07-12 17:00:08,249 INFO L226 Difference]: Without dead ends: 1929 [2022-07-12 17:00:08,251 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-12 17:00:08,251 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 1933 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 4994 mSolverCounterSat, 1081 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 4964 SdHoareTripleChecker+Invalid, 6081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 4994 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:08,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 4964 Invalid, 6081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1081 Valid, 4994 Invalid, 6 Unknown, 0 Unchecked, 24.7s Time] [2022-07-12 17:00:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2022-07-12 17:00:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1804. [2022-07-12 17:00:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1300 states have (on average 1.2961538461538462) internal successors, (1685), 1341 states have internal predecessors, (1685), 366 states have call successors, (366), 117 states have call predecessors, (366), 120 states have return successors, (415), 361 states have call predecessors, (415), 364 states have call successors, (415) [2022-07-12 17:00:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2466 transitions. [2022-07-12 17:00:08,311 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2466 transitions. Word has length 133 [2022-07-12 17:00:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:08,311 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2466 transitions. [2022-07-12 17:00:08,311 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-12 17:00:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2466 transitions. [2022-07-12 17:00:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 17:00:08,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:08,313 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:00:08,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:00:08,313 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-12 17:00:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:08,313 INFO L85 PathProgramCache]: Analyzing trace with hash 300729364, now seen corresponding path program 1 times [2022-07-12 17:00:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:08,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248617234] [2022-07-12 17:00:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:00:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:00:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:00:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:00:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:00:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:00:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:00:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:00:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:00:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:00:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:00:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:00:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:00:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:00:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:00:08,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:08,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248617234] [2022-07-12 17:00:08,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248617234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:08,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:08,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:00:08,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239512253] [2022-07-12 17:00:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:08,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:00:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:00:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:00:08,656 INFO L87 Difference]: Start difference. First operand 1804 states and 2466 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:00:13,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-12 17:00:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:15,495 INFO L93 Difference]: Finished difference Result 1804 states and 2466 transitions. [2022-07-12 17:00:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:00:15,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-07-12 17:00:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:15,506 INFO L225 Difference]: With dead ends: 1804 [2022-07-12 17:00:15,507 INFO L226 Difference]: Without dead ends: 1802 [2022-07-12 17:00:15,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:00:15,508 INFO L413 NwaCegarLoop]: 1430 mSDtfsCounter, 2367 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:15,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 2827 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1358 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-07-12 17:00:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-07-12 17:00:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2022-07-12 17:00:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1299 states have (on average 1.2956120092378753) internal successors, (1683), 1339 states have internal predecessors, (1683), 366 states have call successors, (366), 117 states have call predecessors, (366), 120 states have return successors, (415), 361 states have call predecessors, (415), 364 states have call successors, (415) [2022-07-12 17:00:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2464 transitions. [2022-07-12 17:00:15,581 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2464 transitions. Word has length 121 [2022-07-12 17:00:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:15,581 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 2464 transitions. [2022-07-12 17:00:15,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:00:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2464 transitions. [2022-07-12 17:00:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 17:00:15,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:15,584 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-12 17:00:15,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:00:15,584 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-12 17:00:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1806280261, now seen corresponding path program 1 times [2022-07-12 17:00:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:15,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541162163] [2022-07-12 17:00:15,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:15,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:00:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:00:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:00:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:00:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:00:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:00:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:00:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 17:00:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,135 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-12 17:00:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:16,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541162163] [2022-07-12 17:00:16,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541162163] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:00:16,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474498937] [2022-07-12 17:00:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:16,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:00:16,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:00:16,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:00:16,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 17:00:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:00:16,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:00:16,941 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-12 17:00:16,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:00:16,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474498937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:16,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:00:16,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 17:00:16,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158653660] [2022-07-12 17:00:16,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:16,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:00:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:16,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:00:16,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:00:16,943 INFO L87 Difference]: Start difference. First operand 1802 states and 2464 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-12 17:00:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:17,042 INFO L93 Difference]: Finished difference Result 3237 states and 4393 transitions. [2022-07-12 17:00:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:00:17,043 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-12 17:00:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:17,049 INFO L225 Difference]: With dead ends: 3237 [2022-07-12 17:00:17,049 INFO L226 Difference]: Without dead ends: 1854 [2022-07-12 17:00:17,053 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-12 17:00:17,053 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-12 17:00:17,053 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-12 17:00:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-07-12 17:00:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1851. [2022-07-12 17:00:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1328 states have (on average 1.2899096385542168) internal successors, (1713), 1371 states have internal predecessors, (1713), 381 states have call successors, (381), 123 states have call predecessors, (381), 126 states have return successors, (430), 374 states have call predecessors, (430), 379 states have call successors, (430) [2022-07-12 17:00:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2524 transitions. [2022-07-12 17:00:17,129 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2524 transitions. Word has length 163 [2022-07-12 17:00:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:17,130 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2524 transitions. [2022-07-12 17:00:17,130 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-12 17:00:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2524 transitions. [2022-07-12 17:00:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-12 17:00:17,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:17,132 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-12 17:00:17,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 17:00:17,343 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-12 17:00:17,343 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-12 17:00:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1388180961, now seen corresponding path program 1 times [2022-07-12 17:00:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:17,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336426278] [2022-07-12 17:00:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:00:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:00:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:00:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:00:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:00:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:00:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:00:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:00:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:00:18,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:18,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336426278] [2022-07-12 17:00:18,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336426278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:18,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:18,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:00:18,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213507447] [2022-07-12 17:00:18,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:18,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:00:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:18,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:00:18,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:00:18,076 INFO L87 Difference]: Start difference. First operand 1851 states and 2524 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-12 17:00:24,340 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-12 17:00:27,773 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-12 17:00:32,645 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-12 17:00:34,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:00:37,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:00:39,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:00:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:44,006 INFO L93 Difference]: Finished difference Result 3679 states and 5050 transitions. [2022-07-12 17:00:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:00:44,007 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-12 17:00:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:44,016 INFO L225 Difference]: With dead ends: 3679 [2022-07-12 17:00:44,016 INFO L226 Difference]: Without dead ends: 1923 [2022-07-12 17:00:44,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:00:44,022 INFO L413 NwaCegarLoop]: 1432 mSDtfsCounter, 2676 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 4073 mSolverCounterSat, 1197 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2849 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1197 IncrementalHoareTripleChecker+Valid, 4073 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:44,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2849 Valid, 4179 Invalid, 5276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1197 Valid, 4073 Invalid, 6 Unknown, 0 Unchecked, 25.4s Time] [2022-07-12 17:00:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2022-07-12 17:00:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1851. [2022-07-12 17:00:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1328 states have (on average 1.2884036144578312) internal successors, (1711), 1371 states have internal predecessors, (1711), 381 states have call successors, (381), 123 states have call predecessors, (381), 126 states have return successors, (430), 374 states have call predecessors, (430), 379 states have call successors, (430) [2022-07-12 17:00:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2522 transitions. [2022-07-12 17:00:44,135 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2522 transitions. Word has length 165 [2022-07-12 17:00:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:44,135 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2522 transitions. [2022-07-12 17:00:44,136 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-12 17:00:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2522 transitions. [2022-07-12 17:00:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-12 17:00:44,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:44,138 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-12 17:00:44,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:00:44,138 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-12 17:00:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1388240543, now seen corresponding path program 1 times [2022-07-12 17:00:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:44,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177691404] [2022-07-12 17:00:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:00:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:00:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:00:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:00:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:00:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:00:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:00:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:00:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:00:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:00:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:00:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:00:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:44,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177691404] [2022-07-12 17:00:44,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177691404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:44,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:44,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:00:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217419275] [2022-07-12 17:00:44,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:44,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:00:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:00:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:00:44,593 INFO L87 Difference]: Start difference. First operand 1851 states and 2522 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-12 17:00:50,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:00:53,304 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-12 17:00:58,552 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-12 17:01:00,775 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-12 17:01:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:03,973 INFO L93 Difference]: Finished difference Result 1923 states and 2636 transitions. [2022-07-12 17:01:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:01:03,973 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-12 17:01:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:03,980 INFO L225 Difference]: With dead ends: 1923 [2022-07-12 17:01:03,981 INFO L226 Difference]: Without dead ends: 1921 [2022-07-12 17:01:03,982 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-12 17:01:03,982 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 1529 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 999 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s 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, 18.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:03,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 3772 Invalid, 3936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [999 Valid, 2933 Invalid, 4 Unknown, 0 Unchecked, 18.9s Time] [2022-07-12 17:01:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2022-07-12 17:01:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1849. [2022-07-12 17:01:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1327 states have (on average 1.2871137905048982) internal successors, (1708), 1369 states have internal predecessors, (1708), 381 states have call successors, (381), 123 states have call predecessors, (381), 126 states have return successors, (430), 374 states have call predecessors, (430), 379 states have call successors, (430) [2022-07-12 17:01:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2519 transitions. [2022-07-12 17:01:04,056 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2519 transitions. Word has length 165 [2022-07-12 17:01:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:04,056 INFO L495 AbstractCegarLoop]: Abstraction has 1849 states and 2519 transitions. [2022-07-12 17:01:04,056 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-12 17:01:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2519 transitions. [2022-07-12 17:01:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 17:01:04,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:04,059 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:01:04,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:01:04,059 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-12 17:01:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 754662761, now seen corresponding path program 1 times [2022-07-12 17:01:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:04,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043416872] [2022-07-12 17:01:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:01:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:01:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:01:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:01:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:01:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:01:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:01:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:01:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:01:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:01:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:01:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:01:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:01:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:01:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:01:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:01:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:01:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:04,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043416872] [2022-07-12 17:01:04,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043416872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:04,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:04,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371568998] [2022-07-12 17:01:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:04,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:04,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:04,428 INFO L87 Difference]: Start difference. First operand 1849 states and 2519 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:01:09,813 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-12 17:01:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:11,436 INFO L93 Difference]: Finished difference Result 1849 states and 2519 transitions. [2022-07-12 17:01:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:11,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-07-12 17:01:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:11,454 INFO L225 Difference]: With dead ends: 1849 [2022-07-12 17:01:11,454 INFO L226 Difference]: Without dead ends: 1847 [2022-07-12 17:01:11,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 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-12 17:01:11,456 INFO L413 NwaCegarLoop]: 1420 mSDtfsCounter, 2347 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:11,456 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.7s Time] [2022-07-12 17:01:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-07-12 17:01:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2022-07-12 17:01:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1326 states have (on average 1.2865761689291102) internal successors, (1706), 1367 states have internal predecessors, (1706), 381 states have call successors, (381), 123 states have call predecessors, (381), 126 states have return successors, (430), 374 states have call predecessors, (430), 379 states have call successors, (430) [2022-07-12 17:01:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2517 transitions. [2022-07-12 17:01:11,530 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2517 transitions. Word has length 127 [2022-07-12 17:01:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:11,531 INFO L495 AbstractCegarLoop]: Abstraction has 1847 states and 2517 transitions. [2022-07-12 17:01:11,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:01:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2517 transitions. [2022-07-12 17:01:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 17:01:11,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:11,533 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-12 17:01:11,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:01:11,533 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-12 17:01:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1975583176, now seen corresponding path program 1 times [2022-07-12 17:01:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:11,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160364099] [2022-07-12 17:01:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:11,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:01:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:01:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:01:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:01:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:01:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:01:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:01:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:01:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 17:01:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:11,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 17:01:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:12,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:01:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:12,012 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-12 17:01:12,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:12,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160364099] [2022-07-12 17:01:12,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160364099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:12,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:12,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:01:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441782606] [2022-07-12 17:01:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:12,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:01:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:01:12,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:01:12,014 INFO L87 Difference]: Start difference. First operand 1847 states and 2517 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-12 17:01:19,312 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-12 17:01:24,882 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-12 17:01:27,358 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-12 17:01:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:35,789 INFO L93 Difference]: Finished difference Result 3541 states and 4958 transitions. [2022-07-12 17:01:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:01:35,789 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-12 17:01:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:35,800 INFO L225 Difference]: With dead ends: 3541 [2022-07-12 17:01:35,800 INFO L226 Difference]: Without dead ends: 3539 [2022-07-12 17:01:35,801 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-12 17:01:35,801 INFO L413 NwaCegarLoop]: 2027 mSDtfsCounter, 3726 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 5346 mSolverCounterSat, 1860 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3874 SdHoareTripleChecker+Valid, 5993 SdHoareTripleChecker+Invalid, 7209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1860 IncrementalHoareTripleChecker+Valid, 5346 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:35,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3874 Valid, 5993 Invalid, 7209 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1860 Valid, 5346 Invalid, 3 Unknown, 0 Unchecked, 23.0s Time] [2022-07-12 17:01:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2022-07-12 17:01:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3239. [2022-07-12 17:01:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3239 states, 2347 states have (on average 1.2986791648913507) internal successors, (3048), 2426 states have internal predecessors, (3048), 661 states have call successors, (661), 212 states have call predecessors, (661), 217 states have return successors, (858), 632 states have call predecessors, (858), 659 states have call successors, (858) [2022-07-12 17:01:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4567 transitions. [2022-07-12 17:01:35,943 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4567 transitions. Word has length 140 [2022-07-12 17:01:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:35,944 INFO L495 AbstractCegarLoop]: Abstraction has 3239 states and 4567 transitions. [2022-07-12 17:01:35,944 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-12 17:01:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4567 transitions. [2022-07-12 17:01:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-12 17:01:35,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:35,949 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-12 17:01:35,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:01:35,950 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-12 17:01:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1594898698, now seen corresponding path program 1 times [2022-07-12 17:01:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:35,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879234416] [2022-07-12 17:01:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:01:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:01:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:01:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:01:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:01:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:01:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:01:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:01:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:01:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 17:01:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:01:36,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:36,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879234416] [2022-07-12 17:01:36,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879234416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:36,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:36,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:01:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32626716] [2022-07-12 17:01:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:36,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:01:36,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:01:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:01:36,399 INFO L87 Difference]: Start difference. First operand 3239 states and 4567 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-12 17:01:39,844 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-12 17:01:43,693 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-12 17:01:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:45,519 INFO L93 Difference]: Finished difference Result 6491 states and 9229 transitions. [2022-07-12 17:01:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:01:45,520 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-12 17:01:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:45,529 INFO L225 Difference]: With dead ends: 6491 [2022-07-12 17:01:45,529 INFO L226 Difference]: Without dead ends: 3347 [2022-07-12 17:01:45,536 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-12 17:01:45,537 INFO L413 NwaCegarLoop]: 1424 mSDtfsCounter, 2637 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 1196 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2810 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1196 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:45,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2810 Valid, 2617 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1196 Valid, 1005 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2022-07-12 17:01:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2022-07-12 17:01:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3229. [2022-07-12 17:01:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 2338 states have (on average 1.2964071856287425) internal successors, (3031), 2416 states have internal predecessors, (3031), 661 states have call successors, (661), 212 states have call predecessors, (661), 217 states have return successors, (858), 632 states have call predecessors, (858), 659 states have call successors, (858) [2022-07-12 17:01:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4550 transitions. [2022-07-12 17:01:45,669 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4550 transitions. Word has length 172 [2022-07-12 17:01:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:01:45,669 INFO L495 AbstractCegarLoop]: Abstraction has 3229 states and 4550 transitions. [2022-07-12 17:01:45,669 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-12 17:01:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4550 transitions. [2022-07-12 17:01:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 17:01:45,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:01:45,671 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-12 17:01:45,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:01:45,672 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-12 17:01:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:01:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash 752024843, now seen corresponding path program 1 times [2022-07-12 17:01:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:01:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679147769] [2022-07-12 17:01:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:01:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:01:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:01:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:01:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:01:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:01:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:01:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:01:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:01:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:01:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:01:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:01:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:01:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:01:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:01:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:01:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:01:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 17:01:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 17:01:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:01:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:01:45,998 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-12 17:01:45,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:01:45,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679147769] [2022-07-12 17:01:45,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679147769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:01:45,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:01:45,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:01:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560504193] [2022-07-12 17:01:45,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:01:46,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:01:46,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:01:46,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:01:46,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:01:46,001 INFO L87 Difference]: Start difference. First operand 3229 states and 4550 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) [2022-07-12 17:01:51,752 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-12 17:01:57,490 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-12 17:01:59,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:02:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:02:03,041 INFO L93 Difference]: Finished difference Result 5801 states and 8251 transitions. [2022-07-12 17:02:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:02:03,042 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 141 [2022-07-12 17:02:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:02:03,052 INFO L225 Difference]: With dead ends: 5801 [2022-07-12 17:02:03,052 INFO L226 Difference]: Without dead ends: 3353 [2022-07-12 17:02:03,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:02:03,060 INFO L413 NwaCegarLoop]: 1425 mSDtfsCounter, 1524 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 1018 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 3766 SdHoareTripleChecker+Invalid, 3955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:02:03,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 3766 Invalid, 3955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2934 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time] [2022-07-12 17:02:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2022-07-12 17:02:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3233. [2022-07-12 17:02:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 2342 states have (on average 1.2924850555081127) internal successors, (3027), 2420 states have internal predecessors, (3027), 661 states have call successors, (661), 212 states have call predecessors, (661), 217 states have return successors, (858), 632 states have call predecessors, (858), 659 states have call successors, (858) [2022-07-12 17:02:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4546 transitions. [2022-07-12 17:02:03,237 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4546 transitions. Word has length 141 [2022-07-12 17:02:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:02:03,237 INFO L495 AbstractCegarLoop]: Abstraction has 3233 states and 4546 transitions. [2022-07-12 17:02:03,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-07-12 17:02:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4546 transitions. [2022-07-12 17:02:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 17:02:03,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:02:03,239 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-12 17:02:03,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:02:03,239 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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-12 17:02:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:02:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash -473632468, now seen corresponding path program 1 times [2022-07-12 17:02:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:02:03,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637397488] [2022-07-12 17:02:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:02:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:02:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:02:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:02:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:02:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:02:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:02:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:02:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:02:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:02:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:02:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:02:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:02:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:02:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:02:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:02:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 17:02:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 17:02:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 17:02:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:02:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:02:03,722 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-12 17:02:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:02:03,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637397488] [2022-07-12 17:02:03,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637397488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:02:03,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:02:03,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 17:02:03,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655452421] [2022-07-12 17:02:03,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:02:03,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 17:02:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:02:03,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 17:02:03,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:02:03,724 INFO L87 Difference]: Start difference. First operand 3233 states and 4546 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)