./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 f4b24e32 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-?-f4b24e3 [2022-07-14 04:39:32,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:39:32,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:39:32,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:39:32,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:39:32,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:39:32,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:39:32,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:39:32,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:39:32,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:39:32,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:39:32,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:39:32,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:39:32,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:39:32,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:39:32,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:39:32,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:39:32,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:39:32,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:39:32,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:39:32,604 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:39:32,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:39:32,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:39:32,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:39:32,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:39:32,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:39:32,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:39:32,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:39:32,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:39:32,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:39:32,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:39:32,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:39:32,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:39:32,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:39:32,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:39:32,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:39:32,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:39:32,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:39:32,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:39:32,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:39:32,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:39:32,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:39:32,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:39:32,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:39:32,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:39:32,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:39:32,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:39:32,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:39:32,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:39:32,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:39:32,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:39:32,665 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:39:32,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:39:32,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:39:32,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:39:32,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:39:32,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:39:32,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:39:32,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:39:32,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:39:32,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:39:32,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:39:32,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:39:32,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:39:32,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:39:32,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:39:32,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:39:32,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:39:32,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:39:32,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:39:32,670 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:39:32,670 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:39:32,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:39:32,671 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-14 04:39:32,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:39:32,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:39:32,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:39:32,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:39:32,981 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:39:32,982 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-14 04:39:33,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefe5a7d7/ca6a3f3e48f44008822ed33a155ba537/FLAGa6bbde9b2 [2022-07-14 04:39:33,838 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:39:33,839 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-14 04:39:33,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefe5a7d7/ca6a3f3e48f44008822ed33a155ba537/FLAGa6bbde9b2 [2022-07-14 04:39:34,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefe5a7d7/ca6a3f3e48f44008822ed33a155ba537 [2022-07-14 04:39:34,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:39:34,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:39:34,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:39:34,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:39:34,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:39:34,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12defca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34, skipping insertion in model container [2022-07-14 04:39:34,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:39:34,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:39:38,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416608,416621] [2022-07-14 04:39:38,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416761,416774] [2022-07-14 04:39:38,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[416912,416925] [2022-07-14 04:39:38,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417062,417075] [2022-07-14 04:39:38,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417209,417222] [2022-07-14 04:39:38,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417360,417373] [2022-07-14 04:39:38,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417511,417524] [2022-07-14 04:39:38,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417659,417672] [2022-07-14 04:39:38,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417825,417838] [2022-07-14 04:39:38,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[417994,418007] [2022-07-14 04:39:38,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i[418161,418174] [2022-07-14 04:39:38,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:39:38,320 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:39:38,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/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-14 04:39:38,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:39:38,903 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:39:38,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38 WrapperNode [2022-07-14 04:39:38,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:39:38,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:39:38,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:39:38,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:39:38,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,287 INFO L137 Inliner]: procedures = 553, calls = 2286, calls flagged for inlining = 242, calls inlined = 154, statements flattened = 4412 [2022-07-14 04:39:39,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:39:39,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:39:39,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:39:39,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:39:39,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:39:39,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:39:39,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:39:39,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:39:39,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (1/1) ... [2022-07-14 04:39:39,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:39:39,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:39,612 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-14 04:39:39,639 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-14 04:39:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:39:39,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:39:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:39:39,661 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:39:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:39:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:39:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:39:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:39:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2022-07-14 04:39:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2022-07-14 04:39:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:39:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:39:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-07-14 04:39:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-07-14 04:39:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:39:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:39:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-14 04:39:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:39:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:39:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:39:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:39:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:39:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:39:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure tda1004x_writereg [2022-07-14 04:39:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure tda1004x_writereg [2022-07-14 04:39:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:39:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:39:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:39:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:39:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-14 04:39:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-14 04:39:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-14 04:39:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-14 04:39:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:39:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:39:39,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:39:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:39:39,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:39:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:39:39,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:39:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:39:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:39:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:39:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_frontend_detach [2022-07-14 04:39:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_frontend_detach [2022-07-14 04:39:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:39:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:39:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:39:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:39:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:39:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:39:39,686 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_stop_iso_xfer [2022-07-14 04:39:39,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_stop_iso_xfer [2022-07-14 04:39:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:39:39,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:39:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:39:39,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:39:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_cmd [2022-07-14 04:39:39,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_cmd [2022-07-14 04:39:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:39:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:39:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:39:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:39:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:39:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:39:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:39:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-14 04:39:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-14 04:39:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:39:39,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:39:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2022-07-14 04:39:39,690 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2022-07-14 04:39:39,691 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_del_adapter [2022-07-14 04:39:39,694 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_del_adapter [2022-07-14 04:39:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_free_iso_urbs [2022-07-14 04:39:39,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_free_iso_urbs [2022-07-14 04:39:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:39:39,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:39:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-14 04:39:39,695 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-14 04:39:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:39:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:39:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:39:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:39:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-07-14 04:39:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-07-14 04:39:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 04:39:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 04:39:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:39:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:39:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:39:39,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:39:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:39:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:39:39,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:39:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semusb_of_ttusb [2022-07-14 04:39:39,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semusb_of_ttusb [2022-07-14 04:39:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:39:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-14 04:39:39,700 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-14 04:39:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:39:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-14 04:39:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-14 04:39:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:39:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:39:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-14 04:39:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-14 04:39:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:39:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:39:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:39:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:39:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-14 04:39:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-14 04:39:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure master_xfer [2022-07-14 04:39:39,702 INFO L138 BoogieDeclarations]: Found implementation of procedure master_xfer [2022-07-14 04:39:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-14 04:39:39,702 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-14 04:39:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:39:39,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:39:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:39:39,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:39:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:39:39,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:39:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2022-07-14 04:39:39,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~$Pointer$ [2022-07-14 04:39:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 04:39:39,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 04:39:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:39:39,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:39:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:39:39,703 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:39:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:39:39,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:39:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:39:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:39:39,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:39:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semi2c_of_ttusb [2022-07-14 04:39:39,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_semi2c_of_ttusb [2022-07-14 04:39:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_transfer [2022-07-14 04:39:39,704 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_transfer [2022-07-14 04:39:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:39:39,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:39:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:39:39,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:39:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_semi2c_of_ttusb [2022-07-14 04:39:39,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_semi2c_of_ttusb [2022-07-14 04:39:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_disconnect [2022-07-14 04:39:39,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_disconnect [2022-07-14 04:39:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_get [2022-07-14 04:39:39,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_get [2022-07-14 04:39:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:39:39,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:39:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:39:39,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:39:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-07-14 04:39:39,706 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-07-14 04:39:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_result [2022-07-14 04:39:39,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_result [2022-07-14 04:39:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:39:40,313 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:39:40,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:39:40,603 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:39:47,269 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:39:47,289 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:39:47,290 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 04:39:47,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:39:47 BoogieIcfgContainer [2022-07-14 04:39:47,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:39:47,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:39:47,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:39:47,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:39:47,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:39:34" (1/3) ... [2022-07-14 04:39:47,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51623b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:39:47, skipping insertion in model container [2022-07-14 04:39:47,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:38" (2/3) ... [2022-07-14 04:39:47,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51623b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:39:47, skipping insertion in model container [2022-07-14 04:39:47,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:39:47" (3/3) ... [2022-07-14 04:39:47,304 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--ttusb-budget--dvb-ttusb-budget.ko.cil.i [2022-07-14 04:39:47,319 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:39:47,319 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-14 04:39:47,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:39:47,393 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@99febfd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d42187d [2022-07-14 04:39:47,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-14 04:39:47,402 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-14 04:39:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 04:39:47,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:47,413 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-14 04:39:47,414 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-14 04:39:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 145990740, now seen corresponding path program 1 times [2022-07-14 04:39:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:47,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562733803] [2022-07-14 04:39:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:39:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:39:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:39:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:39:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:48,537 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-14 04:39:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:48,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562733803] [2022-07-14 04:39:48,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562733803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:48,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:48,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:48,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630118705] [2022-07-14 04:39:48,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:48,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:48,587 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-14 04:39:54,728 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-14 04:39:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:56,875 INFO L93 Difference]: Finished difference Result 2296 states and 3249 transitions. [2022-07-14 04:39:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:56,878 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-14 04:39:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:56,897 INFO L225 Difference]: With dead ends: 2296 [2022-07-14 04:39:56,897 INFO L226 Difference]: Without dead ends: 1157 [2022-07-14 04:39:56,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-14 04:39:56,915 INFO L413 NwaCegarLoop]: 1489 mSDtfsCounter, 2502 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 844 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:56,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 2931 Invalid, 2249 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [844 Valid, 1404 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-07-14 04:39:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-14 04:39:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2022-07-14 04:39:57,055 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-14 04:39:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1559 transitions. [2022-07-14 04:39:57,071 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1559 transitions. Word has length 71 [2022-07-14 04:39:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:57,073 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1559 transitions. [2022-07-14 04:39:57,073 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-14 04:39:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1559 transitions. [2022-07-14 04:39:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-14 04:39:57,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:57,083 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-14 04:39:57,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:39:57,084 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-14 04:39:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1717476351, now seen corresponding path program 1 times [2022-07-14 04:39:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:57,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538099910] [2022-07-14 04:39:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:39:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:39:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:39:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:39:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:39:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:39:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:39:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:39:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:57,719 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-14 04:39:57,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:57,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538099910] [2022-07-14 04:39:57,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538099910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:57,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:57,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093158594] [2022-07-14 04:39:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:57,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:57,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:57,724 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-14 04:40:02,877 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-14 04:40:06,116 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-14 04:40:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:08,079 INFO L93 Difference]: Finished difference Result 1157 states and 1559 transitions. [2022-07-14 04:40:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:08,080 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-14 04:40:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:08,088 INFO L225 Difference]: With dead ends: 1157 [2022-07-14 04:40:08,088 INFO L226 Difference]: Without dead ends: 1155 [2022-07-14 04:40:08,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-14 04:40:08,091 INFO L413 NwaCegarLoop]: 1471 mSDtfsCounter, 2470 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:08,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 2897 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1389 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2022-07-14 04:40:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-07-14 04:40:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2022-07-14 04:40:08,136 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-14 04:40:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1557 transitions. [2022-07-14 04:40:08,143 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1557 transitions. Word has length 77 [2022-07-14 04:40:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1557 transitions. [2022-07-14 04:40:08,144 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-14 04:40:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1557 transitions. [2022-07-14 04:40:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 04:40:08,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:08,146 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-14 04:40:08,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:40:08,146 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-14 04:40:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash -710014543, now seen corresponding path program 1 times [2022-07-14 04:40:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:08,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948880792] [2022-07-14 04:40:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:40:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:40:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:40:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:40:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:40:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,836 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-14 04:40:08,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948880792] [2022-07-14 04:40:08,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948880792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:08,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:08,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:08,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008435130] [2022-07-14 04:40:08,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:08,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:08,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:08,840 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-14 04:40:14,641 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-14 04:40:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:16,884 INFO L93 Difference]: Finished difference Result 1155 states and 1557 transitions. [2022-07-14 04:40:16,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:16,885 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-14 04:40:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:16,893 INFO L225 Difference]: With dead ends: 1155 [2022-07-14 04:40:16,893 INFO L226 Difference]: Without dead ends: 1153 [2022-07-14 04:40:16,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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-14 04:40:16,895 INFO L413 NwaCegarLoop]: 1469 mSDtfsCounter, 2464 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s 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, 7.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:16,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 2895 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1388 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-07-14 04:40:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-07-14 04:40:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2022-07-14 04:40:16,939 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-14 04:40:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1555 transitions. [2022-07-14 04:40:16,947 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1555 transitions. Word has length 83 [2022-07-14 04:40:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:16,947 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1555 transitions. [2022-07-14 04:40:16,948 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-14 04:40:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1555 transitions. [2022-07-14 04:40:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-14 04:40:16,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:16,949 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-14 04:40:16,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:40:16,950 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-14 04:40:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2116367515, now seen corresponding path program 1 times [2022-07-14 04:40:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:16,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293998913] [2022-07-14 04:40:16,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:40:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:40:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:40:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:40:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:40:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:40:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:17,514 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-14 04:40:17,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:17,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293998913] [2022-07-14 04:40:17,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293998913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:17,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:17,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795841521] [2022-07-14 04:40:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:17,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:17,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:17,518 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-14 04:40:23,331 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-14 04:40:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:25,091 INFO L93 Difference]: Finished difference Result 1153 states and 1555 transitions. [2022-07-14 04:40:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:25,092 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-14 04:40:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:25,099 INFO L225 Difference]: With dead ends: 1153 [2022-07-14 04:40:25,099 INFO L226 Difference]: Without dead ends: 1151 [2022-07-14 04:40:25,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-14 04:40:25,101 INFO L413 NwaCegarLoop]: 1467 mSDtfsCounter, 2458 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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, 7.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:25,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 2893 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1386 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-07-14 04:40:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2022-07-14 04:40:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2022-07-14 04:40:25,140 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-14 04:40:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1553 transitions. [2022-07-14 04:40:25,147 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1553 transitions. Word has length 89 [2022-07-14 04:40:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:25,148 INFO L495 AbstractCegarLoop]: Abstraction has 1151 states and 1553 transitions. [2022-07-14 04:40:25,148 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-14 04:40:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1553 transitions. [2022-07-14 04:40:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-14 04:40:25,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:25,150 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:40:25,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:40:25,150 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-14 04:40:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1681490694, now seen corresponding path program 1 times [2022-07-14 04:40:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:25,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770691582] [2022-07-14 04:40:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:40:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:40:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:40:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:40:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:40:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:40:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:40:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,673 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-14 04:40:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:25,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770691582] [2022-07-14 04:40:25,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770691582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:25,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:25,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3105065] [2022-07-14 04:40:25,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:25,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:25,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:25,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:25,676 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-14 04:40:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:31,424 INFO L93 Difference]: Finished difference Result 1151 states and 1553 transitions. [2022-07-14 04:40:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:31,425 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-14 04:40:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:31,432 INFO L225 Difference]: With dead ends: 1151 [2022-07-14 04:40:31,433 INFO L226 Difference]: Without dead ends: 1149 [2022-07-14 04:40:31,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 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-14 04:40:31,435 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 2452 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:31,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2604 Valid, 2891 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 04:40:31,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-07-14 04:40:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2022-07-14 04:40:31,476 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-14 04:40:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1551 transitions. [2022-07-14 04:40:31,482 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1551 transitions. Word has length 95 [2022-07-14 04:40:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:31,483 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1551 transitions. [2022-07-14 04:40:31,483 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-14 04:40:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1551 transitions. [2022-07-14 04:40:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-14 04:40:31,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:31,485 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-14 04:40:31,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:40:31,485 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-14 04:40:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash 658495343, now seen corresponding path program 1 times [2022-07-14 04:40:31,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:31,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815804210] [2022-07-14 04:40:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:31,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:40:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:40:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:40:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:40:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:40:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:40:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:40:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:40:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:40:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:31,988 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-14 04:40:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:31,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815804210] [2022-07-14 04:40:31,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815804210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:31,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:31,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598677636] [2022-07-14 04:40:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:31,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:31,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:31,992 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-14 04:40:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:37,405 INFO L93 Difference]: Finished difference Result 1149 states and 1551 transitions. [2022-07-14 04:40:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:37,405 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-14 04:40:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:37,411 INFO L225 Difference]: With dead ends: 1149 [2022-07-14 04:40:37,411 INFO L226 Difference]: Without dead ends: 1147 [2022-07-14 04:40:37,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-14 04:40:37,413 INFO L413 NwaCegarLoop]: 1463 mSDtfsCounter, 2446 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:37,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 2889 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 04:40:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-14 04:40:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2022-07-14 04:40:37,452 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-14 04:40:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1549 transitions. [2022-07-14 04:40:37,458 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1549 transitions. Word has length 101 [2022-07-14 04:40:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:37,459 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1549 transitions. [2022-07-14 04:40:37,459 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-14 04:40:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1549 transitions. [2022-07-14 04:40:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-14 04:40:37,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:37,461 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-14 04:40:37,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:40:37,461 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-14 04:40:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1011873192, now seen corresponding path program 1 times [2022-07-14 04:40:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:37,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236806584] [2022-07-14 04:40:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:40:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:40:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:40:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:40:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:40:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:40:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:40:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:37,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:40:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:40:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:40:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:40:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,120 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-14 04:40:38,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:38,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236806584] [2022-07-14 04:40:38,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236806584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:38,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:38,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:40:38,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937788348] [2022-07-14 04:40:38,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:38,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:40:38,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:38,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:40:38,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:40:38,123 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-14 04:40:48,030 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-14 04:40:54,344 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-14 04:40:56,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:40:58,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:41:00,927 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-14 04:41:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:08,252 INFO L93 Difference]: Finished difference Result 1986 states and 2671 transitions. [2022-07-14 04:41:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:41:08,253 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-14 04:41:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:08,266 INFO L225 Difference]: With dead ends: 1986 [2022-07-14 04:41:08,266 INFO L226 Difference]: Without dead ends: 1984 [2022-07-14 04:41:08,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:41:08,270 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 3860 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 5014 mSolverCounterSat, 1803 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3989 SdHoareTripleChecker+Valid, 4477 SdHoareTripleChecker+Invalid, 6822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 5014 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:08,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3989 Valid, 4477 Invalid, 6822 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1803 Valid, 5014 Invalid, 5 Unknown, 0 Unchecked, 29.2s Time] [2022-07-14 04:41:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2022-07-14 04:41:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1727. [2022-07-14 04:41:08,353 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-14 04:41:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2359 transitions. [2022-07-14 04:41:08,364 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2359 transitions. Word has length 115 [2022-07-14 04:41:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:08,365 INFO L495 AbstractCegarLoop]: Abstraction has 1727 states and 2359 transitions. [2022-07-14 04:41:08,365 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-14 04:41:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2359 transitions. [2022-07-14 04:41:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-14 04:41:08,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:08,370 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-14 04:41:08,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:41:08,372 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-14 04:41:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1214019974, now seen corresponding path program 1 times [2022-07-14 04:41:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:08,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15528064] [2022-07-14 04:41:08,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:41:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:41:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:41:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:41:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:41:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:41:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:41:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:41:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:41:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:41:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:41:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:09,010 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-14 04:41:09,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:09,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15528064] [2022-07-14 04:41:09,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15528064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:09,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:09,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313475427] [2022-07-14 04:41:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:09,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:09,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:09,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:09,013 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-14 04:41:15,319 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-14 04:41:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:17,189 INFO L93 Difference]: Finished difference Result 1727 states and 2359 transitions. [2022-07-14 04:41:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:17,200 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-14 04:41:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:17,211 INFO L225 Difference]: With dead ends: 1727 [2022-07-14 04:41:17,211 INFO L226 Difference]: Without dead ends: 1725 [2022-07-14 04:41:17,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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-14 04:41:17,214 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 2440 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s 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, 7.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:17,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 2887 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1380 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-07-14 04:41:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2022-07-14 04:41:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1725. [2022-07-14 04:41:17,292 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-14 04:41:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2357 transitions. [2022-07-14 04:41:17,301 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2357 transitions. Word has length 107 [2022-07-14 04:41:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:17,301 INFO L495 AbstractCegarLoop]: Abstraction has 1725 states and 2357 transitions. [2022-07-14 04:41:17,302 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-14 04:41:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2357 transitions. [2022-07-14 04:41:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-14 04:41:17,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:17,305 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-14 04:41:17,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:41:17,305 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-14 04:41:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 816117705, now seen corresponding path program 1 times [2022-07-14 04:41:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:17,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537878857] [2022-07-14 04:41:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:41:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:41:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:41:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:41:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:41:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:41:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:41:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:41:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:41:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:41:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:41:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:41:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:41:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:17,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537878857] [2022-07-14 04:41:17,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537878857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:17,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:17,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510296261] [2022-07-14 04:41:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:17,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:17,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:17,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:17,874 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-14 04:41:24,314 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-14 04:41:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:26,227 INFO L93 Difference]: Finished difference Result 1725 states and 2357 transitions. [2022-07-14 04:41:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:26,228 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-14 04:41:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:26,238 INFO L225 Difference]: With dead ends: 1725 [2022-07-14 04:41:26,239 INFO L226 Difference]: Without dead ends: 1723 [2022-07-14 04:41:26,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:41:26,242 INFO L413 NwaCegarLoop]: 1459 mSDtfsCounter, 2438 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s 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, 8.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:26,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 2885 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1374 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2022-07-14 04:41:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2022-07-14 04:41:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2022-07-14 04:41:26,322 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-14 04:41:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2355 transitions. [2022-07-14 04:41:26,330 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2355 transitions. Word has length 113 [2022-07-14 04:41:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:26,331 INFO L495 AbstractCegarLoop]: Abstraction has 1723 states and 2355 transitions. [2022-07-14 04:41:26,331 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-14 04:41:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2355 transitions. [2022-07-14 04:41:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-14 04:41:26,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:26,333 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-14 04:41:26,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:41:26,333 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-14 04:41:26,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1689744756, now seen corresponding path program 1 times [2022-07-14 04:41:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:26,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702837824] [2022-07-14 04:41:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:26,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:41:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:41:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:41:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:41:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:41:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:41:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:41:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:41:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:41:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:41:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:41:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:41:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:26,951 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-14 04:41:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702837824] [2022-07-14 04:41:26,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702837824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:26,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:26,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897233964] [2022-07-14 04:41:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:26,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:26,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:26,954 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-14 04:41:32,136 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-14 04:41:34,870 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-14 04:41:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:36,750 INFO L93 Difference]: Finished difference Result 1723 states and 2355 transitions. [2022-07-14 04:41:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:36,751 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-14 04:41:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:36,761 INFO L225 Difference]: With dead ends: 1723 [2022-07-14 04:41:36,761 INFO L226 Difference]: Without dead ends: 1721 [2022-07-14 04:41:36,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:41:36,764 INFO L413 NwaCegarLoop]: 1457 mSDtfsCounter, 2426 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 836 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s 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, 9.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:36,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2575 Valid, 2883 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1375 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2022-07-14 04:41:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2022-07-14 04:41:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2022-07-14 04:41:36,843 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-14 04:41:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2353 transitions. [2022-07-14 04:41:36,852 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2353 transitions. Word has length 115 [2022-07-14 04:41:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:36,852 INFO L495 AbstractCegarLoop]: Abstraction has 1721 states and 2353 transitions. [2022-07-14 04:41:36,853 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-14 04:41:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2353 transitions. [2022-07-14 04:41:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-14 04:41:36,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:36,855 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-14 04:41:36,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:41:36,855 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-14 04:41:36,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash 435234058, now seen corresponding path program 1 times [2022-07-14 04:41:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:36,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802481718] [2022-07-14 04:41:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:41:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:41:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:41:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:41:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:41:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:41:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:41:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:37,583 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-14 04:41:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802481718] [2022-07-14 04:41:37,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802481718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:37,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:37,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081805369] [2022-07-14 04:41:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:37,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:37,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:37,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:37,587 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-14 04:41:41,556 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-14 04:41:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:45,359 INFO L93 Difference]: Finished difference Result 3458 states and 4792 transitions. [2022-07-14 04:41:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:41:45,360 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-14 04:41:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:45,370 INFO L225 Difference]: With dead ends: 3458 [2022-07-14 04:41:45,371 INFO L226 Difference]: Without dead ends: 1775 [2022-07-14 04:41:45,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:41:45,379 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 2711 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 1210 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2884 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1210 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:45,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2884 Valid, 2637 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1210 Valid, 1035 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-07-14 04:41:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-07-14 04:41:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1711. [2022-07-14 04:41:45,484 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-14 04:41:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2318 transitions. [2022-07-14 04:41:45,492 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2318 transitions. Word has length 157 [2022-07-14 04:41:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:45,493 INFO L495 AbstractCegarLoop]: Abstraction has 1711 states and 2318 transitions. [2022-07-14 04:41:45,493 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-14 04:41:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2318 transitions. [2022-07-14 04:41:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-14 04:41:45,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:45,495 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-14 04:41:45,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:41:45,496 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-14 04:41:45,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1115292428, now seen corresponding path program 1 times [2022-07-14 04:41:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:45,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370422085] [2022-07-14 04:41:45,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:41:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:41:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:41:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:41:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:41:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:41:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:41:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:46,076 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-14 04:41:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:46,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370422085] [2022-07-14 04:41:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370422085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:46,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:46,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806874522] [2022-07-14 04:41:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:46,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:46,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:46,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:46,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:46,079 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-14 04:41:50,142 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-14 04:41:54,022 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-14 04:41:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:55,954 INFO L93 Difference]: Finished difference Result 3066 states and 4139 transitions. [2022-07-14 04:41:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:41:55,955 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-14 04:41:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:55,966 INFO L225 Difference]: With dead ends: 3066 [2022-07-14 04:41:55,966 INFO L226 Difference]: Without dead ends: 1771 [2022-07-14 04:41:55,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:41:55,972 INFO L413 NwaCegarLoop]: 1271 mSDtfsCounter, 2717 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 1202 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s 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, 9.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:55,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 2476 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1202 Valid, 1173 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2022-07-14 04:41:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-14 04:41:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1707. [2022-07-14 04:41:56,058 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-14 04:41:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2313 transitions. [2022-07-14 04:41:56,067 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2313 transitions. Word has length 157 [2022-07-14 04:41:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:56,068 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2313 transitions. [2022-07-14 04:41:56,068 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-14 04:41:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2313 transitions. [2022-07-14 04:41:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-14 04:41:56,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:56,071 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-14 04:41:56,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:41:56,071 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-14 04:41:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1141865086, now seen corresponding path program 1 times [2022-07-14 04:41:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:56,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989026746] [2022-07-14 04:41:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:41:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:41:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:41:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:41:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:41:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:41:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:41:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:41:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:41:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:41:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:41:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 04:41:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:41:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:41:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:56,736 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-14 04:41:56,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:56,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989026746] [2022-07-14 04:41:56,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989026746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:56,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:56,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:41:56,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303420982] [2022-07-14 04:41:56,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:56,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:41:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:41:56,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:41:56,739 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-14 04:42:05,368 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-14 04:42:14,332 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-14 04:42:16,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:42:18,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:42:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:23,906 INFO L93 Difference]: Finished difference Result 3182 states and 4344 transitions. [2022-07-14 04:42:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:42:23,907 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-14 04:42:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:23,916 INFO L225 Difference]: With dead ends: 3182 [2022-07-14 04:42:23,917 INFO L226 Difference]: Without dead ends: 1929 [2022-07-14 04:42:23,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-07-14 04:42:23,922 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 1933 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 4996 mSolverCounterSat, 1081 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 4964 SdHoareTripleChecker+Invalid, 6081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 4996 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:23,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 4964 Invalid, 6081 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1081 Valid, 4996 Invalid, 4 Unknown, 0 Unchecked, 26.4s Time] [2022-07-14 04:42:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2022-07-14 04:42:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1804. [2022-07-14 04:42:24,011 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-14 04:42:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2466 transitions. [2022-07-14 04:42:24,019 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2466 transitions. Word has length 133 [2022-07-14 04:42:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:24,020 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2466 transitions. [2022-07-14 04:42:24,020 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-14 04:42:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2466 transitions. [2022-07-14 04:42:24,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-14 04:42:24,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:24,022 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-14 04:42:24,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:42:24,023 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-14 04:42:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash 300729364, now seen corresponding path program 1 times [2022-07-14 04:42:24,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:24,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178075183] [2022-07-14 04:42:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:42:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:42:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:42:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:42:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:42:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:42:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:42:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:42:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:42:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:42:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:42:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:42:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:42:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:42:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:24,541 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-14 04:42:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:24,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178075183] [2022-07-14 04:42:24,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178075183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:24,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:24,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:42:24,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322208191] [2022-07-14 04:42:24,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:24,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:42:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:24,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:42:24,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:42:24,544 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-14 04:42:30,776 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-14 04:42:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:32,512 INFO L93 Difference]: Finished difference Result 1804 states and 2466 transitions. [2022-07-14 04:42:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:42:32,513 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-14 04:42:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:32,522 INFO L225 Difference]: With dead ends: 1804 [2022-07-14 04:42:32,522 INFO L226 Difference]: Without dead ends: 1802 [2022-07-14 04:42:32,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:42:32,524 INFO L413 NwaCegarLoop]: 1430 mSDtfsCounter, 2367 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 836 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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, 7.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:32,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 2827 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1358 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-07-14 04:42:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-07-14 04:42:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2022-07-14 04:42:32,614 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-14 04:42:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2464 transitions. [2022-07-14 04:42:32,621 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2464 transitions. Word has length 121 [2022-07-14 04:42:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:32,622 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 2464 transitions. [2022-07-14 04:42:32,622 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-14 04:42:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2464 transitions. [2022-07-14 04:42:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-14 04:42:32,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:32,624 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-14 04:42:32,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:42:32,625 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-14 04:42:32,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:32,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1806280261, now seen corresponding path program 1 times [2022-07-14 04:42:32,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:32,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94278605] [2022-07-14 04:42:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:32,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:32,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:42:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:32,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:32,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:42:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:32,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:32,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:32,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:42:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:42:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:42:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:42:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:42:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:42:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:33,326 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-14 04:42:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:33,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94278605] [2022-07-14 04:42:33,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94278605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:42:33,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112803154] [2022-07-14 04:42:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:33,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:42:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:42:33,335 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-14 04:42:33,361 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-14 04:42:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:34,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:42:34,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:42:34,266 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-14 04:42:34,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:42:34,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112803154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:34,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:42:34,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-14 04:42:34,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262882878] [2022-07-14 04:42:34,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:34,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:42:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:42:34,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:42:34,269 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-14 04:42:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:34,398 INFO L93 Difference]: Finished difference Result 3237 states and 4393 transitions. [2022-07-14 04:42:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:42:34,399 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-14 04:42:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:34,408 INFO L225 Difference]: With dead ends: 3237 [2022-07-14 04:42:34,408 INFO L226 Difference]: Without dead ends: 1854 [2022-07-14 04:42:34,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:42:34,413 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-14 04:42:34,414 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-14 04:42:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-07-14 04:42:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1851. [2022-07-14 04:42:34,519 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-14 04:42:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2524 transitions. [2022-07-14 04:42:34,527 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2524 transitions. Word has length 163 [2022-07-14 04:42:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:34,528 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2524 transitions. [2022-07-14 04:42:34,528 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-14 04:42:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2524 transitions. [2022-07-14 04:42:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-14 04:42:34,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:34,531 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-14 04:42:34,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 04:42:34,747 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-14 04:42:34,747 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-14 04:42:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1388180961, now seen corresponding path program 1 times [2022-07-14 04:42:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:34,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413070989] [2022-07-14 04:42:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:42:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:42:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:42:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:42:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:42:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:42:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:42:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:42:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:42:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 04:42:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:35,607 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-14 04:42:35,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:35,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413070989] [2022-07-14 04:42:35,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413070989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:35,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:35,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:42:35,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14453361] [2022-07-14 04:42:35,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:35,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:42:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:35,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:42:35,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:42:35,609 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-14 04:42:43,785 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-14 04:42:51,221 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-14 04:42:53,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:42:55,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:00,164 INFO L93 Difference]: Finished difference Result 3679 states and 5050 transitions. [2022-07-14 04:43:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 04:43:00,165 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-14 04:43:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:00,176 INFO L225 Difference]: With dead ends: 3679 [2022-07-14 04:43:00,176 INFO L226 Difference]: Without dead ends: 1923 [2022-07-14 04:43:00,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-14 04:43:00,184 INFO L413 NwaCegarLoop]: 1432 mSDtfsCounter, 2676 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 4075 mSolverCounterSat, 1197 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2849 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1197 IncrementalHoareTripleChecker+Valid, 4075 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:00,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2849 Valid, 4179 Invalid, 5276 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1197 Valid, 4075 Invalid, 4 Unknown, 0 Unchecked, 23.8s Time] [2022-07-14 04:43:00,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2022-07-14 04:43:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1851. [2022-07-14 04:43:00,295 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-14 04:43:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2522 transitions. [2022-07-14 04:43:00,304 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2522 transitions. Word has length 165 [2022-07-14 04:43:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:00,305 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2522 transitions. [2022-07-14 04:43:00,305 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-14 04:43:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2522 transitions. [2022-07-14 04:43:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-14 04:43:00,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:00,308 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-14 04:43:00,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:43:00,309 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-14 04:43:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1388240543, now seen corresponding path program 1 times [2022-07-14 04:43:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:00,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790333916] [2022-07-14 04:43:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:00,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:43:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:43:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:43:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:43:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:43:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:43:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:43:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:43:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:43:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:43:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 04:43:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:00,921 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-14 04:43:00,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:00,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790333916] [2022-07-14 04:43:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790333916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:00,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:43:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468872102] [2022-07-14 04:43:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:00,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:43:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:43:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:43:00,925 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-14 04:43:07,512 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-14 04:43:13,706 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-14 04:43:15,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:17,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:43:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:21,709 INFO L93 Difference]: Finished difference Result 1923 states and 2636 transitions. [2022-07-14 04:43:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:43:21,710 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-14 04:43:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:21,720 INFO L225 Difference]: With dead ends: 1923 [2022-07-14 04:43:21,721 INFO L226 Difference]: Without dead ends: 1921 [2022-07-14 04:43:21,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-14 04:43:21,724 INFO L413 NwaCegarLoop]: 1431 mSDtfsCounter, 1529 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 999 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 3772 SdHoareTripleChecker+Invalid, 3936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 999 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:21,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 3772 Invalid, 3936 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [999 Valid, 2933 Invalid, 4 Unknown, 0 Unchecked, 20.3s Time] [2022-07-14 04:43:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2022-07-14 04:43:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1849. [2022-07-14 04:43:21,831 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-14 04:43:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2519 transitions. [2022-07-14 04:43:21,838 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2519 transitions. Word has length 165 [2022-07-14 04:43:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:21,839 INFO L495 AbstractCegarLoop]: Abstraction has 1849 states and 2519 transitions. [2022-07-14 04:43:21,839 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-14 04:43:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2519 transitions. [2022-07-14 04:43:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-14 04:43:21,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:21,841 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-14 04:43:21,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:43:21,842 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-14 04:43:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash 754662761, now seen corresponding path program 1 times [2022-07-14 04:43:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:21,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634130931] [2022-07-14 04:43:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:21,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:43:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:43:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:43:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:43:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:43:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:43:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:43:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:43:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:43:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:43:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:43:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:43:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:43:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:43:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:43:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:43:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:43:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:22,344 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-14 04:43:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:22,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634130931] [2022-07-14 04:43:22,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634130931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:22,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:22,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:43:22,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064786364] [2022-07-14 04:43:22,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:22,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:43:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:43:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:43:22,348 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)