./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--net--ethernet--smsc--smc91c92_cs.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.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 ebfa7940163335da607aa8ab46e2b4dcf0d50ad01772adcf05712684027181a0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:03:59,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:03:59,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:03:59,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:03:59,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:03:59,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:03:59,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:03:59,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:03:59,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:03:59,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:03:59,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:03:59,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:03:59,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:03:59,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:03:59,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:03:59,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:03:59,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:03:59,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:03:59,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:03:59,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:03:59,714 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:03:59,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:03:59,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:03:59,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:03:59,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:03:59,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:03:59,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:03:59,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:03:59,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:03:59,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:03:59,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:03:59,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:03:59,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:03:59,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:03:59,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:03:59,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:03:59,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:03:59,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:03:59,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:03:59,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:03:59,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:03:59,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:03:59,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:03:59,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:03:59,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:03:59,775 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:03:59,775 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:03:59,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:03:59,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:03:59,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:03:59,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:03:59,777 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:03:59,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:03:59,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:03:59,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:03:59,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:03:59,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:03:59,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:03:59,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:03:59,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:03:59,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:03:59,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:03:59,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:03:59,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:03:59,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:03:59,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:03:59,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:03:59,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:03:59,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:03:59,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:03:59,781 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:03:59,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:03:59,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:03:59,782 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 -> ebfa7940163335da607aa8ab46e2b4dcf0d50ad01772adcf05712684027181a0 [2022-07-12 17:03:59,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:04:00,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:04:00,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:04:00,004 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:04:00,004 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:04:00,005 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--net--ethernet--smsc--smc91c92_cs.ko.cil.i [2022-07-12 17:04:00,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86ea443/0629085286aa4b0a9396c2e738fb4394/FLAG7aafe6f8b [2022-07-12 17:04:00,831 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:04:00,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i [2022-07-12 17:04:00,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86ea443/0629085286aa4b0a9396c2e738fb4394/FLAG7aafe6f8b [2022-07-12 17:04:01,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef86ea443/0629085286aa4b0a9396c2e738fb4394 [2022-07-12 17:04:01,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:04:01,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:04:01,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:04:01,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:04:01,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:04:01,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:04:01" (1/1) ... [2022-07-12 17:04:01,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e20c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:01, skipping insertion in model container [2022-07-12 17:04:01,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:04:01" (1/1) ... [2022-07-12 17:04:01,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:04:01,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:04:05,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424579,424592] [2022-07-12 17:04:05,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424724,424737] [2022-07-12 17:04:05,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424870,424883] [2022-07-12 17:04:05,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425035,425048] [2022-07-12 17:04:05,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425193,425206] [2022-07-12 17:04:05,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425351,425364] [2022-07-12 17:04:05,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425509,425522] [2022-07-12 17:04:05,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425669,425682] [2022-07-12 17:04:05,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425828,425841] [2022-07-12 17:04:05,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425967,425980] [2022-07-12 17:04:05,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426109,426122] [2022-07-12 17:04:05,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426258,426271] [2022-07-12 17:04:05,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426397,426410] [2022-07-12 17:04:05,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426552,426565] [2022-07-12 17:04:05,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426712,426725] [2022-07-12 17:04:05,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426863,426876] [2022-07-12 17:04:05,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427014,427027] [2022-07-12 17:04:05,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427166,427179] [2022-07-12 17:04:05,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427315,427328] [2022-07-12 17:04:05,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427463,427476] [2022-07-12 17:04:05,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427620,427633] [2022-07-12 17:04:05,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427769,427782] [2022-07-12 17:04:05,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427925,427938] [2022-07-12 17:04:05,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428078,428091] [2022-07-12 17:04:05,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428224,428237] [2022-07-12 17:04:05,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428367,428380] [2022-07-12 17:04:05,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428519,428532] [2022-07-12 17:04:05,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428665,428678] [2022-07-12 17:04:05,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428810,428823] [2022-07-12 17:04:05,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428964,428977] [2022-07-12 17:04:05,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429115,429128] [2022-07-12 17:04:05,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429270,429283] [2022-07-12 17:04:05,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429422,429435] [2022-07-12 17:04:05,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429577,429590] [2022-07-12 17:04:05,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429741,429754] [2022-07-12 17:04:05,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429897,429910] [2022-07-12 17:04:05,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430061,430074] [2022-07-12 17:04:05,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430203,430216] [2022-07-12 17:04:05,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430361,430374] [2022-07-12 17:04:05,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430528,430541] [2022-07-12 17:04:05,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430687,430700] [2022-07-12 17:04:05,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430846,430859] [2022-07-12 17:04:05,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430995,431008] [2022-07-12 17:04:05,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431142,431155] [2022-07-12 17:04:05,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431281,431294] [2022-07-12 17:04:05,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431444,431457] [2022-07-12 17:04:05,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431610,431623] [2022-07-12 17:04:05,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431774,431787] [2022-07-12 17:04:05,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431939,431952] [2022-07-12 17:04:05,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432104,432117] [2022-07-12 17:04:05,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432270,432283] [2022-07-12 17:04:05,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432435,432448] [2022-07-12 17:04:05,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432602,432615] [2022-07-12 17:04:05,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432762,432775] [2022-07-12 17:04:05,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432924,432937] [2022-07-12 17:04:05,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433083,433096] [2022-07-12 17:04:05,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433229,433242] [2022-07-12 17:04:05,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433372,433385] [2022-07-12 17:04:05,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433516,433529] [2022-07-12 17:04:05,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433659,433672] [2022-07-12 17:04:05,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433803,433816] [2022-07-12 17:04:05,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433944,433957] [2022-07-12 17:04:05,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434082,434095] [2022-07-12 17:04:05,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434240,434253] [2022-07-12 17:04:05,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434399,434412] [2022-07-12 17:04:05,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434555,434568] [2022-07-12 17:04:05,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434704,434717] [2022-07-12 17:04:05,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434856,434869] [2022-07-12 17:04:05,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435007,435020] [2022-07-12 17:04:05,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435156,435169] [2022-07-12 17:04:05,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435308,435321] [2022-07-12 17:04:05,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435456,435469] [2022-07-12 17:04:05,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435609,435622] [2022-07-12 17:04:05,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435760,435773] [2022-07-12 17:04:05,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435910,435923] [2022-07-12 17:04:05,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436057,436070] [2022-07-12 17:04:05,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436208,436221] [2022-07-12 17:04:05,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436359,436372] [2022-07-12 17:04:05,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436507,436520] [2022-07-12 17:04:05,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436673,436686] [2022-07-12 17:04:05,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436842,436855] [2022-07-12 17:04:05,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437009,437022] [2022-07-12 17:04:05,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437177,437190] [2022-07-12 17:04:05,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437327,437340] [2022-07-12 17:04:05,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437474,437487] [2022-07-12 17:04:05,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437635,437648] [2022-07-12 17:04:05,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437805,437818] [2022-07-12 17:04:05,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437967,437980] [2022-07-12 17:04:05,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:04:05,222 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:04:05,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424579,424592] [2022-07-12 17:04:05,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424724,424737] [2022-07-12 17:04:05,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424870,424883] [2022-07-12 17:04:05,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425035,425048] [2022-07-12 17:04:05,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425193,425206] [2022-07-12 17:04:05,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425351,425364] [2022-07-12 17:04:05,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425509,425522] [2022-07-12 17:04:05,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425669,425682] [2022-07-12 17:04:05,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425828,425841] [2022-07-12 17:04:05,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425967,425980] [2022-07-12 17:04:05,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426109,426122] [2022-07-12 17:04:05,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426258,426271] [2022-07-12 17:04:05,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426397,426410] [2022-07-12 17:04:05,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426552,426565] [2022-07-12 17:04:05,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426712,426725] [2022-07-12 17:04:05,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426863,426876] [2022-07-12 17:04:05,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427014,427027] [2022-07-12 17:04:05,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427166,427179] [2022-07-12 17:04:05,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427315,427328] [2022-07-12 17:04:05,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427463,427476] [2022-07-12 17:04:05,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427620,427633] [2022-07-12 17:04:05,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427769,427782] [2022-07-12 17:04:05,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427925,427938] [2022-07-12 17:04:05,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428078,428091] [2022-07-12 17:04:05,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428224,428237] [2022-07-12 17:04:05,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428367,428380] [2022-07-12 17:04:05,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428519,428532] [2022-07-12 17:04:05,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428665,428678] [2022-07-12 17:04:05,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428810,428823] [2022-07-12 17:04:05,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428964,428977] [2022-07-12 17:04:05,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429115,429128] [2022-07-12 17:04:05,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429270,429283] [2022-07-12 17:04:05,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429422,429435] [2022-07-12 17:04:05,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429577,429590] [2022-07-12 17:04:05,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429741,429754] [2022-07-12 17:04:05,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429897,429910] [2022-07-12 17:04:05,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430061,430074] [2022-07-12 17:04:05,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430203,430216] [2022-07-12 17:04:05,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430361,430374] [2022-07-12 17:04:05,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430528,430541] [2022-07-12 17:04:05,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430687,430700] [2022-07-12 17:04:05,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430846,430859] [2022-07-12 17:04:05,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430995,431008] [2022-07-12 17:04:05,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431142,431155] [2022-07-12 17:04:05,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431281,431294] [2022-07-12 17:04:05,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431444,431457] [2022-07-12 17:04:05,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431610,431623] [2022-07-12 17:04:05,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431774,431787] [2022-07-12 17:04:05,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431939,431952] [2022-07-12 17:04:05,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432104,432117] [2022-07-12 17:04:05,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432270,432283] [2022-07-12 17:04:05,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432435,432448] [2022-07-12 17:04:05,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432602,432615] [2022-07-12 17:04:05,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432762,432775] [2022-07-12 17:04:05,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432924,432937] [2022-07-12 17:04:05,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433083,433096] [2022-07-12 17:04:05,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433229,433242] [2022-07-12 17:04:05,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433372,433385] [2022-07-12 17:04:05,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433516,433529] [2022-07-12 17:04:05,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433659,433672] [2022-07-12 17:04:05,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433803,433816] [2022-07-12 17:04:05,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433944,433957] [2022-07-12 17:04:05,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434082,434095] [2022-07-12 17:04:05,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434240,434253] [2022-07-12 17:04:05,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434399,434412] [2022-07-12 17:04:05,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434555,434568] [2022-07-12 17:04:05,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434704,434717] [2022-07-12 17:04:05,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434856,434869] [2022-07-12 17:04:05,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435007,435020] [2022-07-12 17:04:05,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435156,435169] [2022-07-12 17:04:05,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435308,435321] [2022-07-12 17:04:05,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435456,435469] [2022-07-12 17:04:05,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435609,435622] [2022-07-12 17:04:05,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435760,435773] [2022-07-12 17:04:05,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435910,435923] [2022-07-12 17:04:05,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436057,436070] [2022-07-12 17:04:05,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436208,436221] [2022-07-12 17:04:05,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436359,436372] [2022-07-12 17:04:05,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436507,436520] [2022-07-12 17:04:05,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436673,436686] [2022-07-12 17:04:05,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436842,436855] [2022-07-12 17:04:05,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437009,437022] [2022-07-12 17:04:05,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437177,437190] [2022-07-12 17:04:05,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437327,437340] [2022-07-12 17:04:05,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437474,437487] [2022-07-12 17:04:05,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437635,437648] [2022-07-12 17:04:05,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437805,437818] [2022-07-12 17:04:05,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437967,437980] [2022-07-12 17:04:05,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:04:05,885 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:04:05,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05 WrapperNode [2022-07-12 17:04:05,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:04:05,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:04:05,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:04:05,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:04:05,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:05,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,171 INFO L137 Inliner]: procedures = 621, calls = 2758, calls flagged for inlining = 280, calls inlined = 165, statements flattened = 4672 [2022-07-12 17:04:06,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:04:06,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:04:06,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:04:06,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:04:06,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:04:06,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:04:06,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:04:06,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:04:06,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (1/1) ... [2022-07-12 17:04:06,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:04:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:04:06,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 17:04:06,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 17:04:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:04:06,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:04:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_write [2022-07-12 17:04:06,550 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_write [2022-07-12 17:04:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure smc91c92_detach [2022-07-12 17:04:06,550 INFO L138 BoogieDeclarations]: Found implementation of procedure smc91c92_detach [2022-07-12 17:04:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-12 17:04:06,550 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-12 17:04:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure mhz_3288_power [2022-07-12 17:04:06,551 INFO L138 BoogieDeclarations]: Found implementation of procedure mhz_3288_power [2022-07-12 17:04:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:04:06,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:04:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_request_io [2022-07-12 17:04:06,552 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_request_io [2022-07-12 17:04:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:04:06,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:04:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:04:06,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:04:06,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:04:06,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:04:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_smc_private [2022-07-12 17:04:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_smc_private [2022-07-12 17:04:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:04:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:04:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:04:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:04:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-12 17:04:06,555 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-12 17:04:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure smc91c92_resume [2022-07-12 17:04:06,555 INFO L138 BoogieDeclarations]: Found implementation of procedure smc91c92_resume [2022-07-12 17:04:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:04:06,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:04:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:04:06,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:04:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:04:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure smc91c92_suspend [2022-07-12 17:04:06,556 INFO L138 BoogieDeclarations]: Found implementation of procedure smc91c92_suspend [2022-07-12 17:04:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:04:06,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:04:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 17:04:06,556 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 17:04:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-07-12 17:04:06,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-07-12 17:04:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:04:06,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:04:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:04:06,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:04:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:04:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:04:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:04:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure set_rx_mode [2022-07-12 17:04:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure set_rx_mode [2022-07-12 17:04:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:04:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:04:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-12 17:04:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-12 17:04:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 17:04:06,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 17:04:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure cvt_ascii_address [2022-07-12 17:04:06,559 INFO L138 BoogieDeclarations]: Found implementation of procedure cvt_ascii_address [2022-07-12 17:04:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:04:06,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:04:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:04:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:04:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:04:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure __bitrev8 [2022-07-12 17:04:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __bitrev8 [2022-07-12 17:04:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:04:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:04:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:04:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-12 17:04:06,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-12 17:04:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:04:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure smc_tx_timeout [2022-07-12 17:04:06,564 INFO L138 BoogieDeclarations]: Found implementation of procedure smc_tx_timeout [2022-07-12 17:04:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:04:06,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:04:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-12 17:04:06,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-12 17:04:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure smc_reset [2022-07-12 17:04:06,565 INFO L138 BoogieDeclarations]: Found implementation of procedure smc_reset [2022-07-12 17:04:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-12 17:04:06,567 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-12 17:04:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_read [2022-07-12 17:04:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_read [2022-07-12 17:04:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:04:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:04:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:04:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:04:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure smc_hardware_send_packet [2022-07-12 17:04:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure smc_hardware_send_packet [2022-07-12 17:04:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:04:06,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:04:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-12 17:04:06,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-12 17:04:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2022-07-12 17:04:06,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2022-07-12 17:04:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure osi_load_firmware [2022-07-12 17:04:06,569 INFO L138 BoogieDeclarations]: Found implementation of procedure osi_load_firmware [2022-07-12 17:04:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 17:04:06,570 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 17:04:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:04:06,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:04:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure smc_set_xcvr [2022-07-12 17:04:06,570 INFO L138 BoogieDeclarations]: Found implementation of procedure smc_set_xcvr [2022-07-12 17:04:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:04:06,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:04:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2022-07-12 17:04:06,571 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2022-07-12 17:04:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:04:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:04:06,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:04:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-12 17:04:06,572 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-12 17:04:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:04:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-12 17:04:06,572 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-12 17:04:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure mot_config [2022-07-12 17:04:06,572 INFO L138 BoogieDeclarations]: Found implementation of procedure mot_config [2022-07-12 17:04:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:04:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:04:06,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:04:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure check_sig [2022-07-12 17:04:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure check_sig [2022-07-12 17:04:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-07-12 17:04:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-07-12 17:04:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 17:04:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 17:04:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-12 17:04:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-12 17:04:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:04:06,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:04:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_smc_private [2022-07-12 17:04:06,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_smc_private [2022-07-12 17:04:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-12 17:04:06,575 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-12 17:04:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_sync [2022-07-12 17:04:06,575 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_sync [2022-07-12 17:04:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:04:06,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:04:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:04:06,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:04:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 17:04:06,576 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 17:04:06,576 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:04:06,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:04:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 17:04:06,577 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 17:04:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:04:06,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:04:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:04:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:04:06,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:04:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure __bitrev16 [2022-07-12 17:04:06,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __bitrev16 [2022-07-12 17:04:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_loop_tuple [2022-07-12 17:04:06,578 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_loop_tuple [2022-07-12 17:04:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure smc91c92_release [2022-07-12 17:04:06,578 INFO L138 BoogieDeclarations]: Found implementation of procedure smc91c92_release [2022-07-12 17:04:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:04:06,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:04:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:04:06,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:04:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_loop_config [2022-07-12 17:04:06,579 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_loop_config [2022-07-12 17:04:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:04:06,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:04:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:04:06,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:04:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-12 17:04:06,580 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-12 17:04:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:04:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure inw [2022-07-12 17:04:06,580 INFO L138 BoogieDeclarations]: Found implementation of procedure inw [2022-07-12 17:04:06,580 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-12 17:04:06,581 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-12 17:04:06,581 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-12 17:04:06,581 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-12 17:04:07,180 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:04:07,182 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:04:07,410 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:04:12,937 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:04:12,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:04:12,963 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 17:04:12,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:04:12 BoogieIcfgContainer [2022-07-12 17:04:12,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:04:12,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:04:12,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:04:12,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:04:12,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:04:01" (1/3) ... [2022-07-12 17:04:12,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5a3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:04:12, skipping insertion in model container [2022-07-12 17:04:12,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:05" (2/3) ... [2022-07-12 17:04:12,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5a3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:04:12, skipping insertion in model container [2022-07-12 17:04:12,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:04:12" (3/3) ... [2022-07-12 17:04:12,979 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i [2022-07-12 17:04:12,992 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:04:12,992 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-07-12 17:04:13,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:04:13,079 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@e298edb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33fe83aa [2022-07-12 17:04:13,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-07-12 17:04:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 1397 states, 912 states have (on average 1.2883771929824561) internal successors, (1175), 957 states have internal predecessors, (1175), 378 states have call successors, (378), 83 states have call predecessors, (378), 82 states have return successors, (374), 371 states have call predecessors, (374), 374 states have call successors, (374) [2022-07-12 17:04:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 17:04:13,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:13,099 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:04:13,099 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 22 more)] === [2022-07-12 17:04:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash 590792471, now seen corresponding path program 1 times [2022-07-12 17:04:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252383957] [2022-07-12 17:04:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:13,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:14,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:14,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:14,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:04:14,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:14,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252383957] [2022-07-12 17:04:14,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252383957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:14,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:14,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:14,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75538368] [2022-07-12 17:04:14,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:14,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:14,142 INFO L87 Difference]: Start difference. First operand has 1397 states, 912 states have (on average 1.2883771929824561) internal successors, (1175), 957 states have internal predecessors, (1175), 378 states have call successors, (378), 83 states have call predecessors, (378), 82 states have return successors, (374), 371 states have call predecessors, (374), 374 states have call successors, (374) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 17:04:16,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:18,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:24,405 INFO L93 Difference]: Finished difference Result 4137 states and 5857 transitions. [2022-07-12 17:04:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:04:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-12 17:04:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:24,438 INFO L225 Difference]: With dead ends: 4137 [2022-07-12 17:04:24,438 INFO L226 Difference]: Without dead ends: 2741 [2022-07-12 17:04:24,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:04:24,456 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 3553 mSDsluCounter, 2721 mSDsCounter, 0 mSdLazyCounter, 3763 mSolverCounterSat, 2469 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3753 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 6234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2469 IncrementalHoareTripleChecker+Valid, 3763 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:24,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3753 Valid, 4683 Invalid, 6234 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2469 Valid, 3763 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2022-07-12 17:04:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-07-12 17:04:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2560. [2022-07-12 17:04:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1689 states have (on average 1.2504440497335703) internal successors, (2112), 1751 states have internal predecessors, (2112), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:04:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3519 transitions. [2022-07-12 17:04:24,698 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3519 transitions. Word has length 64 [2022-07-12 17:04:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:24,699 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3519 transitions. [2022-07-12 17:04:24,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 17:04:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3519 transitions. [2022-07-12 17:04:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 17:04:24,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:24,709 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:04:24,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:04:24,709 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 22 more)] === [2022-07-12 17:04:24,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2012828021, now seen corresponding path program 1 times [2022-07-12 17:04:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:24,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581556500] [2022-07-12 17:04:24,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:04:25,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:25,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581556500] [2022-07-12 17:04:25,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581556500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:25,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:25,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443858239] [2022-07-12 17:04:25,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:25,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:25,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:25,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:25,292 INFO L87 Difference]: Start difference. First operand 2560 states and 3519 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 17:04:27,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:29,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:32,537 INFO L93 Difference]: Finished difference Result 2560 states and 3519 transitions. [2022-07-12 17:04:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:32,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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 70 [2022-07-12 17:04:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:32,553 INFO L225 Difference]: With dead ends: 2560 [2022-07-12 17:04:32,554 INFO L226 Difference]: Without dead ends: 2558 [2022-07-12 17:04:32,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:32,557 INFO L413 NwaCegarLoop]: 1704 mSDtfsCounter, 2433 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2632 SdHoareTripleChecker+Valid, 3603 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:32,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2632 Valid, 3603 Invalid, 3083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1679 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 17:04:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2022-07-12 17:04:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2022-07-12 17:04:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 1688 states have (on average 1.25) internal successors, (2110), 1749 states have internal predecessors, (2110), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:04:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3517 transitions. [2022-07-12 17:04:32,667 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3517 transitions. Word has length 70 [2022-07-12 17:04:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:32,669 INFO L495 AbstractCegarLoop]: Abstraction has 2558 states and 3517 transitions. [2022-07-12 17:04:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 17:04:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3517 transitions. [2022-07-12 17:04:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 17:04:32,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:32,672 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 17:04:32,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:04:32,673 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 22 more)] === [2022-07-12 17:04:32,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1603005742, now seen corresponding path program 1 times [2022-07-12 17:04:32,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:32,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436224578] [2022-07-12 17:04:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:32,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:32,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:04:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:33,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436224578] [2022-07-12 17:04:33,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436224578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:33,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:33,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629716671] [2022-07-12 17:04:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:33,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:33,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:33,192 INFO L87 Difference]: Start difference. First operand 2558 states and 3517 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 17:04:35,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:37,254 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:40,110 INFO L93 Difference]: Finished difference Result 2558 states and 3517 transitions. [2022-07-12 17:04:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:40,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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 76 [2022-07-12 17:04:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:40,125 INFO L225 Difference]: With dead ends: 2558 [2022-07-12 17:04:40,126 INFO L226 Difference]: Without dead ends: 2556 [2022-07-12 17:04:40,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:40,131 INFO L413 NwaCegarLoop]: 1702 mSDtfsCounter, 2427 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:40,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 3601 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1677 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-12 17:04:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-12 17:04:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2556. [2022-07-12 17:04:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 1687 states have (on average 1.2495554238292828) internal successors, (2108), 1747 states have internal predecessors, (2108), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:04:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3515 transitions. [2022-07-12 17:04:40,248 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3515 transitions. Word has length 76 [2022-07-12 17:04:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:40,248 INFO L495 AbstractCegarLoop]: Abstraction has 2556 states and 3515 transitions. [2022-07-12 17:04:40,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 17:04:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3515 transitions. [2022-07-12 17:04:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 17:04:40,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:40,251 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:04:40,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:04:40,251 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 22 more)] === [2022-07-12 17:04:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1583848173, now seen corresponding path program 1 times [2022-07-12 17:04:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:40,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520749247] [2022-07-12 17:04:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:04:40,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:40,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520749247] [2022-07-12 17:04:40,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520749247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:40,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:40,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64332111] [2022-07-12 17:04:40,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:40,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:40,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:40,748 INFO L87 Difference]: Start difference. First operand 2556 states and 3515 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 17:04:42,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:44,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:47,283 INFO L93 Difference]: Finished difference Result 2556 states and 3515 transitions. [2022-07-12 17:04:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:47,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 82 [2022-07-12 17:04:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:47,297 INFO L225 Difference]: With dead ends: 2556 [2022-07-12 17:04:47,297 INFO L226 Difference]: Without dead ends: 2554 [2022-07-12 17:04:47,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:47,299 INFO L413 NwaCegarLoop]: 1700 mSDtfsCounter, 2421 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 3599 SdHoareTripleChecker+Invalid, 3079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:47,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 3599 Invalid, 3079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1675 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 17:04:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-07-12 17:04:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2022-07-12 17:04:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 1686 states have (on average 1.2491103202846976) internal successors, (2106), 1745 states have internal predecessors, (2106), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:04:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3513 transitions. [2022-07-12 17:04:47,461 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3513 transitions. Word has length 82 [2022-07-12 17:04:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:47,462 INFO L495 AbstractCegarLoop]: Abstraction has 2554 states and 3513 transitions. [2022-07-12 17:04:47,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 17:04:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3513 transitions. [2022-07-12 17:04:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 17:04:47,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:47,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:04:47,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:04:47,464 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 22 more)] === [2022-07-12 17:04:47,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash 51375118, now seen corresponding path program 1 times [2022-07-12 17:04:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:47,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677294772] [2022-07-12 17:04:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:04:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677294772] [2022-07-12 17:04:47,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677294772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:47,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:47,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338991776] [2022-07-12 17:04:47,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:47,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:47,882 INFO L87 Difference]: Start difference. First operand 2554 states and 3513 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:04:49,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:51,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:04:54,488 INFO L93 Difference]: Finished difference Result 2554 states and 3513 transitions. [2022-07-12 17:04:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:04:54,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 88 [2022-07-12 17:04:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:04:54,500 INFO L225 Difference]: With dead ends: 2554 [2022-07-12 17:04:54,500 INFO L226 Difference]: Without dead ends: 2552 [2022-07-12 17:04:54,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:04:54,502 INFO L413 NwaCegarLoop]: 1698 mSDtfsCounter, 2415 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:04:54,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 3597 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1673 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 17:04:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2022-07-12 17:04:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2022-07-12 17:04:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 1685 states have (on average 1.2486646884272996) internal successors, (2104), 1743 states have internal predecessors, (2104), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:04:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3511 transitions. [2022-07-12 17:04:54,620 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3511 transitions. Word has length 88 [2022-07-12 17:04:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:04:54,622 INFO L495 AbstractCegarLoop]: Abstraction has 2552 states and 3511 transitions. [2022-07-12 17:04:54,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:04:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3511 transitions. [2022-07-12 17:04:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 17:04:54,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:04:54,628 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:04:54,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:04:54,628 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 22 more)] === [2022-07-12 17:04:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:04:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash 817977721, now seen corresponding path program 1 times [2022-07-12 17:04:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:04:54,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460136425] [2022-07-12 17:04:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:04:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:04:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:04:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:04:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:54,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:04:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:54,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:04:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:54,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:04:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:54,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:04:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:04:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:04:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:04:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:04:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:55,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:04:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:04:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:04:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:04:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:04:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:04:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:04:55,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460136425] [2022-07-12 17:04:55,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460136425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:04:55,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:04:55,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:04:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489024735] [2022-07-12 17:04:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:04:55,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:04:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:04:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:04:55,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:04:55,072 INFO L87 Difference]: Start difference. First operand 2552 states and 3511 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:04:57,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:04:59,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:01,427 INFO L93 Difference]: Finished difference Result 2552 states and 3511 transitions. [2022-07-12 17:05:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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 94 [2022-07-12 17:05:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:01,438 INFO L225 Difference]: With dead ends: 2552 [2022-07-12 17:05:01,438 INFO L226 Difference]: Without dead ends: 2550 [2022-07-12 17:05:01,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:01,440 INFO L413 NwaCegarLoop]: 1696 mSDtfsCounter, 2409 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 3075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:01,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2604 Valid, 3595 Invalid, 3075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1671 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 17:05:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2022-07-12 17:05:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2550. [2022-07-12 17:05:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 1684 states have (on average 1.2482185273159145) internal successors, (2102), 1741 states have internal predecessors, (2102), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3509 transitions. [2022-07-12 17:05:01,542 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3509 transitions. Word has length 94 [2022-07-12 17:05:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:01,542 INFO L495 AbstractCegarLoop]: Abstraction has 2550 states and 3509 transitions. [2022-07-12 17:05:01,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:05:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3509 transitions. [2022-07-12 17:05:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 17:05:01,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:01,545 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:01,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:05:01,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2102210251, now seen corresponding path program 1 times [2022-07-12 17:05:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:01,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106365433] [2022-07-12 17:05:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:01,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:05:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106365433] [2022-07-12 17:05:01,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106365433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:01,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:01,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629742489] [2022-07-12 17:05:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:01,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:01,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:01,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:01,985 INFO L87 Difference]: Start difference. First operand 2550 states and 3509 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:05:04,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:06,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:08,519 INFO L93 Difference]: Finished difference Result 2550 states and 3509 transitions. [2022-07-12 17:05:08,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:08,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 100 [2022-07-12 17:05:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:08,529 INFO L225 Difference]: With dead ends: 2550 [2022-07-12 17:05:08,530 INFO L226 Difference]: Without dead ends: 2548 [2022-07-12 17:05:08,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:08,531 INFO L413 NwaCegarLoop]: 1694 mSDtfsCounter, 2403 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 3593 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:08,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 3593 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1669 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 17:05:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2022-07-12 17:05:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2548. [2022-07-12 17:05:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1683 states have (on average 1.2477718360071302) internal successors, (2100), 1739 states have internal predecessors, (2100), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3507 transitions. [2022-07-12 17:05:08,637 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3507 transitions. Word has length 100 [2022-07-12 17:05:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:08,638 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3507 transitions. [2022-07-12 17:05:08,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:05:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3507 transitions. [2022-07-12 17:05:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 17:05:08,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:08,640 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:08,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:05:08,640 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:08,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1247008982, now seen corresponding path program 1 times [2022-07-12 17:05:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:08,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267215978] [2022-07-12 17:05:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:09,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:09,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:05:09,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:09,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267215978] [2022-07-12 17:05:09,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267215978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:09,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:09,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575591013] [2022-07-12 17:05:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:09,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:09,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:09,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:09,035 INFO L87 Difference]: Start difference. First operand 2548 states and 3507 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:05:11,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:13,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:15,523 INFO L93 Difference]: Finished difference Result 2548 states and 3507 transitions. [2022-07-12 17:05:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 106 [2022-07-12 17:05:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:15,532 INFO L225 Difference]: With dead ends: 2548 [2022-07-12 17:05:15,532 INFO L226 Difference]: Without dead ends: 2546 [2022-07-12 17:05:15,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:15,534 INFO L413 NwaCegarLoop]: 1692 mSDtfsCounter, 2401 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 3591 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:15,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 3591 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1663 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 17:05:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-07-12 17:05:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2022-07-12 17:05:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1682 states have (on average 1.2473246135552913) internal successors, (2098), 1737 states have internal predecessors, (2098), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3505 transitions. [2022-07-12 17:05:15,677 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3505 transitions. Word has length 106 [2022-07-12 17:05:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:15,677 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 3505 transitions. [2022-07-12 17:05:15,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:05:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3505 transitions. [2022-07-12 17:05:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 17:05:15,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:15,681 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:15,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:05:15,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash -79612083, now seen corresponding path program 1 times [2022-07-12 17:05:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:15,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455976057] [2022-07-12 17:05:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:05:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:16,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455976057] [2022-07-12 17:05:16,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455976057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:16,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:16,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560148349] [2022-07-12 17:05:16,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:16,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:16,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:16,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:16,084 INFO L87 Difference]: Start difference. First operand 2546 states and 3505 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:05:18,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:20,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:22,561 INFO L93 Difference]: Finished difference Result 2546 states and 3505 transitions. [2022-07-12 17:05:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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 108 [2022-07-12 17:05:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:22,569 INFO L225 Difference]: With dead ends: 2546 [2022-07-12 17:05:22,569 INFO L226 Difference]: Without dead ends: 2544 [2022-07-12 17:05:22,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:22,570 INFO L413 NwaCegarLoop]: 1690 mSDtfsCounter, 2389 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 3589 SdHoareTripleChecker+Invalid, 3069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:22,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 3589 Invalid, 3069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1665 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 17:05:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2022-07-12 17:05:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2022-07-12 17:05:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1681 states have (on average 1.2468768590124926) internal successors, (2096), 1735 states have internal predecessors, (2096), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3503 transitions. [2022-07-12 17:05:22,682 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3503 transitions. Word has length 108 [2022-07-12 17:05:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:22,683 INFO L495 AbstractCegarLoop]: Abstraction has 2544 states and 3503 transitions. [2022-07-12 17:05:22,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:05:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3503 transitions. [2022-07-12 17:05:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 17:05:22,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:22,686 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:22,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:05:22,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash -953063554, now seen corresponding path program 1 times [2022-07-12 17:05:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:22,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929031910] [2022-07-12 17:05:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:22,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:22,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:22,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:22,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:22,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:05:23,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:23,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929031910] [2022-07-12 17:05:23,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929031910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:23,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:23,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122831188] [2022-07-12 17:05:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:23,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:23,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:23,072 INFO L87 Difference]: Start difference. First operand 2544 states and 3503 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:25,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:27,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:29,507 INFO L93 Difference]: Finished difference Result 2544 states and 3503 transitions. [2022-07-12 17:05:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:29,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 114 [2022-07-12 17:05:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:29,519 INFO L225 Difference]: With dead ends: 2544 [2022-07-12 17:05:29,519 INFO L226 Difference]: Without dead ends: 2542 [2022-07-12 17:05:29,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:29,521 INFO L413 NwaCegarLoop]: 1688 mSDtfsCounter, 2385 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2577 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:29,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2577 Valid, 3587 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1663 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 17:05:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2022-07-12 17:05:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2022-07-12 17:05:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1680 states have (on average 1.2464285714285714) internal successors, (2094), 1733 states have internal predecessors, (2094), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3501 transitions. [2022-07-12 17:05:29,636 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3501 transitions. Word has length 114 [2022-07-12 17:05:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:29,636 INFO L495 AbstractCegarLoop]: Abstraction has 2542 states and 3501 transitions. [2022-07-12 17:05:29,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3501 transitions. [2022-07-12 17:05:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 17:05:29,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:29,639 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:29,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:05:29,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash 480083321, now seen corresponding path program 1 times [2022-07-12 17:05:29,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:29,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696677378] [2022-07-12 17:05:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:29,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:05:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:30,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696677378] [2022-07-12 17:05:30,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696677378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:30,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:30,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104066939] [2022-07-12 17:05:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:30,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:30,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:30,033 INFO L87 Difference]: Start difference. First operand 2542 states and 3501 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:32,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:34,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:36,747 INFO L93 Difference]: Finished difference Result 2542 states and 3501 transitions. [2022-07-12 17:05:36,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:36,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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 120 [2022-07-12 17:05:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:36,759 INFO L225 Difference]: With dead ends: 2542 [2022-07-12 17:05:36,759 INFO L226 Difference]: Without dead ends: 2540 [2022-07-12 17:05:36,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:36,769 INFO L413 NwaCegarLoop]: 1686 mSDtfsCounter, 2379 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:36,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2570 Valid, 3585 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1661 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-12 17:05:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2022-07-12 17:05:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2540. [2022-07-12 17:05:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 1679 states have (on average 1.2459797498511018) internal successors, (2092), 1731 states have internal predecessors, (2092), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3499 transitions. [2022-07-12 17:05:36,982 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3499 transitions. Word has length 120 [2022-07-12 17:05:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:36,984 INFO L495 AbstractCegarLoop]: Abstraction has 2540 states and 3499 transitions. [2022-07-12 17:05:36,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3499 transitions. [2022-07-12 17:05:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 17:05:36,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:36,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:36,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:05:36,987 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -321350871, now seen corresponding path program 1 times [2022-07-12 17:05:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:36,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123256153] [2022-07-12 17:05:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:05:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123256153] [2022-07-12 17:05:37,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123256153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:37,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:37,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293743820] [2022-07-12 17:05:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:37,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:37,445 INFO L87 Difference]: Start difference. First operand 2540 states and 3499 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:05:39,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:41,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:43,959 INFO L93 Difference]: Finished difference Result 2540 states and 3499 transitions. [2022-07-12 17:05:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-12 17:05:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:43,970 INFO L225 Difference]: With dead ends: 2540 [2022-07-12 17:05:43,970 INFO L226 Difference]: Without dead ends: 2538 [2022-07-12 17:05:43,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:43,973 INFO L413 NwaCegarLoop]: 1684 mSDtfsCounter, 2373 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2563 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:43,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2563 Valid, 3583 Invalid, 3063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1659 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 17:05:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-07-12 17:05:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-07-12 17:05:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1678 states have (on average 1.2455303933253874) internal successors, (2090), 1729 states have internal predecessors, (2090), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3497 transitions. [2022-07-12 17:05:44,091 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3497 transitions. Word has length 126 [2022-07-12 17:05:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:44,092 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 3497 transitions. [2022-07-12 17:05:44,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:05:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3497 transitions. [2022-07-12 17:05:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 17:05:44,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:44,094 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:44,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 17:05:44,095 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:44,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1610445211, now seen corresponding path program 1 times [2022-07-12 17:05:44,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:44,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693475204] [2022-07-12 17:05:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:44,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:05:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:05:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:05:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:05:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:05:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:05:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:05:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:05:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:05:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:05:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:05:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:05:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:05:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:05:44,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:44,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693475204] [2022-07-12 17:05:44,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693475204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:44,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:44,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803679855] [2022-07-12 17:05:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:44,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:44,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:44,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:44,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:44,571 INFO L87 Difference]: Start difference. First operand 2538 states and 3497 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:05:46,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:48,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:51,028 INFO L93 Difference]: Finished difference Result 2538 states and 3497 transitions. [2022-07-12 17:05:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:51,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-12 17:05:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:51,037 INFO L225 Difference]: With dead ends: 2538 [2022-07-12 17:05:51,037 INFO L226 Difference]: Without dead ends: 2536 [2022-07-12 17:05:51,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:51,047 INFO L413 NwaCegarLoop]: 1682 mSDtfsCounter, 2367 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:51,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 3581 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1657 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 17:05:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2022-07-12 17:05:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2022-07-12 17:05:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 1677 states have (on average 1.2450805008944543) internal successors, (2088), 1727 states have internal predecessors, (2088), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3495 transitions. [2022-07-12 17:05:51,160 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3495 transitions. Word has length 132 [2022-07-12 17:05:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:51,160 INFO L495 AbstractCegarLoop]: Abstraction has 2536 states and 3495 transitions. [2022-07-12 17:05:51,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:05:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3495 transitions. [2022-07-12 17:05:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 17:05:51,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:51,163 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:51,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:05:51,163 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1095281589, now seen corresponding path program 1 times [2022-07-12 17:05:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:51,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319682314] [2022-07-12 17:05:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:51,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:05:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:05:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:05:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:05:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 17:05:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 17:05:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 17:05:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 17:05:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:05:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-12 17:05:51,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:51,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319682314] [2022-07-12 17:05:51,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319682314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:51,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:51,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:05:51,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344781065] [2022-07-12 17:05:51,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:51,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:05:51,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:05:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:05:51,751 INFO L87 Difference]: Start difference. First operand 2536 states and 3495 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:53,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:05:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:56,386 INFO L93 Difference]: Finished difference Result 5081 states and 7010 transitions. [2022-07-12 17:05:56,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:05:56,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 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 142 [2022-07-12 17:05:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:56,395 INFO L225 Difference]: With dead ends: 5081 [2022-07-12 17:05:56,395 INFO L226 Difference]: Without dead ends: 2564 [2022-07-12 17:05:56,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:05:56,405 INFO L413 NwaCegarLoop]: 1761 mSDtfsCounter, 380 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 375 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3591 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:56,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3591 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 1136 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-07-12 17:05:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2022-07-12 17:05:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2538. [2022-07-12 17:05:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1679 states have (on average 1.2447885646217987) internal successors, (2090), 1729 states have internal predecessors, (2090), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:05:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3497 transitions. [2022-07-12 17:05:56,575 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3497 transitions. Word has length 142 [2022-07-12 17:05:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:56,575 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 3497 transitions. [2022-07-12 17:05:56,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3497 transitions. [2022-07-12 17:05:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 17:05:56,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:56,578 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:56,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:05:56,578 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:05:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash -961268083, now seen corresponding path program 1 times [2022-07-12 17:05:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:56,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297522199] [2022-07-12 17:05:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:05:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:05:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:05:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:05:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:05:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:05:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:05:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 17:05:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 17:05:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 17:05:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 17:05:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:05:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-12 17:05:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:57,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297522199] [2022-07-12 17:05:57,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297522199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:57,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:57,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:05:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323211339] [2022-07-12 17:05:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:57,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:05:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:05:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:05:57,105 INFO L87 Difference]: Start difference. First operand 2538 states and 3497 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:59,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:02,714 INFO L93 Difference]: Finished difference Result 6287 states and 8860 transitions. [2022-07-12 17:06:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:06:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 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 142 [2022-07-12 17:06:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:02,726 INFO L225 Difference]: With dead ends: 6287 [2022-07-12 17:06:02,726 INFO L226 Difference]: Without dead ends: 3768 [2022-07-12 17:06:02,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:06:02,735 INFO L413 NwaCegarLoop]: 2488 mSDtfsCounter, 927 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 436 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 4843 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 4843 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 1342 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 17:06:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2022-07-12 17:06:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 2540. [2022-07-12 17:06:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 1681 states have (on average 1.2444973230220107) internal successors, (2092), 1731 states have internal predecessors, (2092), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:06:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3499 transitions. [2022-07-12 17:06:02,873 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3499 transitions. Word has length 142 [2022-07-12 17:06:02,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:02,873 INFO L495 AbstractCegarLoop]: Abstraction has 2540 states and 3499 transitions. [2022-07-12 17:06:02,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:06:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3499 transitions. [2022-07-12 17:06:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 17:06:02,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:02,876 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:02,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:06:02,876 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:06:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1338717108, now seen corresponding path program 1 times [2022-07-12 17:06:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:02,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860124686] [2022-07-12 17:06:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:06:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:06:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:06:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:06:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:06:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:06:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:06:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:06:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:06:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:06:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:06:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:06:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:06:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:06:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:06:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:06:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:06:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:06:03,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:03,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860124686] [2022-07-12 17:06:03,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860124686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:03,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:03,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966272399] [2022-07-12 17:06:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:03,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:03,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:03,316 INFO L87 Difference]: Start difference. First operand 2540 states and 3499 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:06:05,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:07,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:09,880 INFO L93 Difference]: Finished difference Result 2540 states and 3499 transitions. [2022-07-12 17:06:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-12 17:06:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:09,889 INFO L225 Difference]: With dead ends: 2540 [2022-07-12 17:06:09,889 INFO L226 Difference]: Without dead ends: 2538 [2022-07-12 17:06:09,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:09,891 INFO L413 NwaCegarLoop]: 1680 mSDtfsCounter, 2361 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2549 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:09,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2549 Valid, 3579 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1655 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-12 17:06:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-07-12 17:06:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-07-12 17:06:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1680 states have (on average 1.244047619047619) internal successors, (2090), 1729 states have internal predecessors, (2090), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:06:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3497 transitions. [2022-07-12 17:06:10,038 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3497 transitions. Word has length 138 [2022-07-12 17:06:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:10,039 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 3497 transitions. [2022-07-12 17:06:10,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:06:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3497 transitions. [2022-07-12 17:06:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-12 17:06:10,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:10,043 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:10,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:06:10,043 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:06:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2044121712, now seen corresponding path program 1 times [2022-07-12 17:06:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:10,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884552745] [2022-07-12 17:06:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:10,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:06:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:06:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:06:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:06:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:06:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:06:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:06:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 17:06:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 17:06:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 17:06:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:06:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 17:06:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-12 17:06:10,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:10,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884552745] [2022-07-12 17:06:10,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884552745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:10,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:10,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 17:06:10,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481733017] [2022-07-12 17:06:10,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:10,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 17:06:10,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:10,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 17:06:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:06:10,505 INFO L87 Difference]: Start difference. First operand 2538 states and 3497 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:06:12,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:15,138 INFO L93 Difference]: Finished difference Result 5085 states and 7014 transitions. [2022-07-12 17:06:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 17:06:15,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2022-07-12 17:06:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:15,148 INFO L225 Difference]: With dead ends: 5085 [2022-07-12 17:06:15,148 INFO L226 Difference]: Without dead ends: 2566 [2022-07-12 17:06:15,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 17:06:15,157 INFO L413 NwaCegarLoop]: 1759 mSDtfsCounter, 378 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 375 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:15,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3588 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 1135 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-07-12 17:06:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-07-12 17:06:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2540. [2022-07-12 17:06:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 1682 states have (on average 1.243757431629013) internal successors, (2092), 1731 states have internal predecessors, (2092), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:06:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3499 transitions. [2022-07-12 17:06:15,301 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3499 transitions. Word has length 148 [2022-07-12 17:06:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:15,302 INFO L495 AbstractCegarLoop]: Abstraction has 2540 states and 3499 transitions. [2022-07-12 17:06:15,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:06:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3499 transitions. [2022-07-12 17:06:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 17:06:15,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:15,304 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:15,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:06:15,305 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:06:15,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash 314205643, now seen corresponding path program 1 times [2022-07-12 17:06:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:15,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650205839] [2022-07-12 17:06:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:06:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:06:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:06:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:06:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:06:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:06:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:06:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 17:06:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 17:06:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 17:06:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:06:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:06:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 17:06:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-12 17:06:15,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:15,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650205839] [2022-07-12 17:06:15,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650205839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:15,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:15,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74537433] [2022-07-12 17:06:15,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:15,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:15,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:15,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:15,949 INFO L87 Difference]: Start difference. First operand 2540 states and 3499 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:06:18,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:21,601 INFO L93 Difference]: Finished difference Result 5313 states and 7363 transitions. [2022-07-12 17:06:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:06:21,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2022-07-12 17:06:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:21,643 INFO L225 Difference]: With dead ends: 5313 [2022-07-12 17:06:21,644 INFO L226 Difference]: Without dead ends: 2792 [2022-07-12 17:06:21,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:06:21,650 INFO L413 NwaCegarLoop]: 1926 mSDtfsCounter, 586 mSDsluCounter, 4309 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 584 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 6235 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:21,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 6235 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2648 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 17:06:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2022-07-12 17:06:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2546. [2022-07-12 17:06:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1688 states have (on average 1.2428909952606635) internal successors, (2098), 1737 states have internal predecessors, (2098), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:06:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3505 transitions. [2022-07-12 17:06:21,802 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3505 transitions. Word has length 149 [2022-07-12 17:06:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:21,802 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 3505 transitions. [2022-07-12 17:06:21,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:06:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3505 transitions. [2022-07-12 17:06:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 17:06:21,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:21,805 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:21,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:06:21,806 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:06:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1843540752, now seen corresponding path program 1 times [2022-07-12 17:06:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:21,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727325046] [2022-07-12 17:06:21,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:21,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:06:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:06:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:06:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:06:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:06:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:06:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:06:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:06:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:06:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:06:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:06:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:06:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:06:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:06:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:06:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:06:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:06:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:06:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:06:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727325046] [2022-07-12 17:06:22,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727325046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:22,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:22,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899857174] [2022-07-12 17:06:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:22,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:22,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:22,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:22,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:22,250 INFO L87 Difference]: Start difference. First operand 2546 states and 3505 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:06:24,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:26,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:28,992 INFO L93 Difference]: Finished difference Result 2546 states and 3505 transitions. [2022-07-12 17:06:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-12 17:06:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:29,000 INFO L225 Difference]: With dead ends: 2546 [2022-07-12 17:06:29,000 INFO L226 Difference]: Without dead ends: 2544 [2022-07-12 17:06:29,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:29,001 INFO L413 NwaCegarLoop]: 1678 mSDtfsCounter, 2355 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2542 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:29,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2542 Valid, 3577 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1653 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-12 17:06:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2022-07-12 17:06:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2022-07-12 17:06:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1687 states have (on average 1.2424422050978068) internal successors, (2096), 1735 states have internal predecessors, (2096), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:06:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3503 transitions. [2022-07-12 17:06:29,163 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3503 transitions. Word has length 144 [2022-07-12 17:06:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:29,163 INFO L495 AbstractCegarLoop]: Abstraction has 2544 states and 3503 transitions. [2022-07-12 17:06:29,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:06:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3503 transitions. [2022-07-12 17:06:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 17:06:29,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:29,166 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:29,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:06:29,166 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:06:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1641086931, now seen corresponding path program 1 times [2022-07-12 17:06:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:29,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445015809] [2022-07-12 17:06:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:06:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 17:06:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 17:06:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 17:06:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 17:06:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 17:06:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 17:06:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 17:06:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 17:06:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:06:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 17:06:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:06:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:06:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 17:06:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 17:06:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 17:06:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 17:06:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:06:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 17:06:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 17:06:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:29,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445015809] [2022-07-12 17:06:29,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445015809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:29,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:29,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256276807] [2022-07-12 17:06:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:29,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:29,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:29,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:29,623 INFO L87 Difference]: Start difference. First operand 2544 states and 3503 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:06:31,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:33,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:36,535 INFO L93 Difference]: Finished difference Result 2544 states and 3503 transitions. [2022-07-12 17:06:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-12 17:06:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:36,542 INFO L225 Difference]: With dead ends: 2544 [2022-07-12 17:06:36,543 INFO L226 Difference]: Without dead ends: 2542 [2022-07-12 17:06:36,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:36,544 INFO L413 NwaCegarLoop]: 1676 mSDtfsCounter, 2349 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2535 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:36,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2535 Valid, 3575 Invalid, 3055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1651 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-12 17:06:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2022-07-12 17:06:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2022-07-12 17:06:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1686 states have (on average 1.2419928825622777) internal successors, (2094), 1733 states have internal predecessors, (2094), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-12 17:06:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3501 transitions. [2022-07-12 17:06:36,711 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3501 transitions. Word has length 150 [2022-07-12 17:06:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:36,712 INFO L495 AbstractCegarLoop]: Abstraction has 2542 states and 3501 transitions. [2022-07-12 17:06:36,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:06:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3501 transitions. [2022-07-12 17:06:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-12 17:06:36,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:36,715 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:36,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:06:36,715 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:06:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:36,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1086141802, now seen corresponding path program 1 times [2022-07-12 17:06:36,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:36,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127286675] [2022-07-12 17:06:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:06:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:06:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:06:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:06:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:06:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:06:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:06:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:06:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:06:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 17:06:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:06:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 17:06:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 17:06:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:06:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 17:06:38,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:38,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127286675] [2022-07-12 17:06:38,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127286675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:38,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:38,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044088040] [2022-07-12 17:06:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:38,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:38,437 INFO L87 Difference]: Start difference. First operand 2542 states and 3501 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:06:40,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:48,752 INFO L93 Difference]: Finished difference Result 7997 states and 11450 transitions. [2022-07-12 17:06:48,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:48,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 170 [2022-07-12 17:06:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:48,774 INFO L225 Difference]: With dead ends: 7997 [2022-07-12 17:06:48,774 INFO L226 Difference]: Without dead ends: 5474 [2022-07-12 17:06:48,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:06:48,785 INFO L413 NwaCegarLoop]: 2942 mSDtfsCounter, 2715 mSDsluCounter, 5616 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 1531 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2989 SdHoareTripleChecker+Valid, 8558 SdHoareTripleChecker+Invalid, 5064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1531 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:48,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2989 Valid, 8558 Invalid, 5064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1531 Valid, 3532 Invalid, 1 Unknown, 0 Unchecked, 9.7s Time] [2022-07-12 17:06:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2022-07-12 17:06:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 2560. [2022-07-12 17:06:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1702 states have (on average 1.2408930669800236) internal successors, (2112), 1749 states have internal predecessors, (2112), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-12 17:06:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3523 transitions. [2022-07-12 17:06:49,089 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3523 transitions. Word has length 170 [2022-07-12 17:06:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:49,089 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3523 transitions. [2022-07-12 17:06:49,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:06:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3523 transitions. [2022-07-12 17:06:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 17:06:49,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:49,092 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:49,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:06:49,092 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:06:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1846211539, now seen corresponding path program 1 times [2022-07-12 17:06:49,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122480797] [2022-07-12 17:06:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:06:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:06:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:06:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:06:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:06:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:06:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:06:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:06:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:06:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 17:06:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:06:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 17:06:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:06:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 17:06:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:49,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122480797] [2022-07-12 17:06:49,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122480797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:49,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:49,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:49,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175451012] [2022-07-12 17:06:49,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:49,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:49,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:49,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:49,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:49,927 INFO L87 Difference]: Start difference. First operand 2560 states and 3523 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:06:51,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:59,093 INFO L93 Difference]: Finished difference Result 8035 states and 11486 transitions. [2022-07-12 17:06:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:59,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 171 [2022-07-12 17:06:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:59,109 INFO L225 Difference]: With dead ends: 8035 [2022-07-12 17:06:59,109 INFO L226 Difference]: Without dead ends: 5494 [2022-07-12 17:06:59,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 17:06:59,120 INFO L413 NwaCegarLoop]: 3067 mSDtfsCounter, 2643 mSDsluCounter, 5754 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 1513 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2916 SdHoareTripleChecker+Valid, 8821 SdHoareTripleChecker+Invalid, 5051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1513 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:59,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2916 Valid, 8821 Invalid, 5051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1513 Valid, 3537 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2022-07-12 17:06:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2022-07-12 17:06:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 2564. [2022-07-12 17:06:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 1706 states have (on average 1.2403282532239155) internal successors, (2116), 1753 states have internal predecessors, (2116), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-12 17:06:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3527 transitions. [2022-07-12 17:06:59,418 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3527 transitions. Word has length 171 [2022-07-12 17:06:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:59,419 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3527 transitions. [2022-07-12 17:06:59,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:06:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3527 transitions. [2022-07-12 17:06:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 17:06:59,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:59,423 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:59,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 17:06:59,423 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:06:59,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1423509713, now seen corresponding path program 1 times [2022-07-12 17:06:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:59,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968172524] [2022-07-12 17:06:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:07:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:07:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:07:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:07:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:07:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:07:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:07:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:07:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:07:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 17:07:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:07:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 17:07:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:07:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-12 17:07:01,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:01,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968172524] [2022-07-12 17:07:01,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968172524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:01,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514815741] [2022-07-12 17:07:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:01,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:01,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:01,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 17:07:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:09,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 5279 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 17:07:09,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-12 17:07:09,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:07:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-07-12 17:07:09,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514815741] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:09,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 17:07:09,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 8] total 18 [2022-07-12 17:07:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937949145] [2022-07-12 17:07:09,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:09,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:07:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:09,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:07:09,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2022-07-12 17:07:09,513 INFO L87 Difference]: Start difference. First operand 2564 states and 3527 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 17:07:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:10,028 INFO L93 Difference]: Finished difference Result 5109 states and 7035 transitions. [2022-07-12 17:07:10,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:07:10,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 171 [2022-07-12 17:07:10,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:10,043 INFO L225 Difference]: With dead ends: 5109 [2022-07-12 17:07:10,043 INFO L226 Difference]: Without dead ends: 2564 [2022-07-12 17:07:10,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-12 17:07:10,051 INFO L413 NwaCegarLoop]: 1824 mSDtfsCounter, 14 mSDsluCounter, 7260 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9084 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:10,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9084 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 17:07:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2022-07-12 17:07:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2564. [2022-07-12 17:07:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 1706 states have (on average 1.23915592028136) internal successors, (2114), 1753 states have internal predecessors, (2114), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-12 17:07:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3525 transitions. [2022-07-12 17:07:10,322 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3525 transitions. Word has length 171 [2022-07-12 17:07:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:10,323 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3525 transitions. [2022-07-12 17:07:10,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 17:07:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3525 transitions. [2022-07-12 17:07:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 17:07:10,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:10,326 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:10,390 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-12 17:07:10,539 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,SelfDestructingSolverStorable22 [2022-07-12 17:07:10,539 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:07:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1816536723, now seen corresponding path program 1 times [2022-07-12 17:07:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:10,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534358696] [2022-07-12 17:07:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:07:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:07:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:07:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:07:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:07:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:07:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:07:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:07:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:07:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 17:07:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:07:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 17:07:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:07:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-12 17:07:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:12,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534358696] [2022-07-12 17:07:12,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534358696] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:12,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468696578] [2022-07-12 17:07:12,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:12,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:12,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:12,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:12,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 17:07:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:14,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 5280 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 17:07:14,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-12 17:07:14,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:07:14,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468696578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:14,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:07:14,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-12 17:07:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510279971] [2022-07-12 17:07:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:14,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:07:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:14,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:07:14,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-12 17:07:14,319 INFO L87 Difference]: Start difference. First operand 2564 states and 3525 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 17:07:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:14,697 INFO L93 Difference]: Finished difference Result 5199 states and 7169 transitions. [2022-07-12 17:07:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:07:14,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 171 [2022-07-12 17:07:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:14,705 INFO L225 Difference]: With dead ends: 5199 [2022-07-12 17:07:14,705 INFO L226 Difference]: Without dead ends: 2654 [2022-07-12 17:07:14,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:07:14,712 INFO L413 NwaCegarLoop]: 1970 mSDtfsCounter, 547 mSDsluCounter, 7115 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 9085 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:14,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 9085 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:07:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2022-07-12 17:07:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2564. [2022-07-12 17:07:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 1706 states have (on average 1.2379835873388043) internal successors, (2112), 1753 states have internal predecessors, (2112), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-12 17:07:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3523 transitions. [2022-07-12 17:07:14,926 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3523 transitions. Word has length 171 [2022-07-12 17:07:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:14,926 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3523 transitions. [2022-07-12 17:07:14,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 17:07:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3523 transitions. [2022-07-12 17:07:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 17:07:14,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:14,928 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:14,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 17:07:15,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 17:07:15,156 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:07:15,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -465151505, now seen corresponding path program 1 times [2022-07-12 17:07:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:15,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551444897] [2022-07-12 17:07:15,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:07:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:07:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:07:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:07:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:07:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:07:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:07:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:07:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:07:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 17:07:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:07:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 17:07:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:07:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-12 17:07:15,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:15,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551444897] [2022-07-12 17:07:15,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551444897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:15,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345012539] [2022-07-12 17:07:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:15,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:15,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:15,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:15,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 17:07:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:17,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 5281 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 17:07:17,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-12 17:07:17,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:07:17,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345012539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:17,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:07:17,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-12 17:07:17,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254038721] [2022-07-12 17:07:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:17,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:07:17,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:17,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:07:17,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-07-12 17:07:17,893 INFO L87 Difference]: Start difference. First operand 2564 states and 3523 transitions. Second operand has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-12 17:07:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:19,477 INFO L93 Difference]: Finished difference Result 5449 states and 7540 transitions. [2022-07-12 17:07:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:07:19,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 171 [2022-07-12 17:07:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:19,486 INFO L225 Difference]: With dead ends: 5449 [2022-07-12 17:07:19,486 INFO L226 Difference]: Without dead ends: 2904 [2022-07-12 17:07:19,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-07-12 17:07:19,493 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 1094 mSDsluCounter, 13532 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 15702 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:19,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 15702 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 17:07:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2022-07-12 17:07:19,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2564. [2022-07-12 17:07:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 1706 states have (on average 1.2368112543962486) internal successors, (2110), 1753 states have internal predecessors, (2110), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-12 17:07:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3521 transitions. [2022-07-12 17:07:19,838 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3521 transitions. Word has length 171 [2022-07-12 17:07:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:19,839 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3521 transitions. [2022-07-12 17:07:19,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-12 17:07:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3521 transitions. [2022-07-12 17:07:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 17:07:19,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:19,841 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:19,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 17:07:20,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:20,062 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-12 17:07:20,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1585832493, now seen corresponding path program 1 times [2022-07-12 17:07:20,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:20,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204057916] [2022-07-12 17:07:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:20,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 17:07:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 17:07:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:07:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 17:07:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:07:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 17:07:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 17:07:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 17:07:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 17:07:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 17:07:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 17:07:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 17:07:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 17:07:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-12 17:07:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:21,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204057916] [2022-07-12 17:07:21,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204057916] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:21,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673420935] [2022-07-12 17:07:21,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:21,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:21,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:21,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:21,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 17:07:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:30,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 5282 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 17:07:30,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 101 proven. 3 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 17:07:30,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 17:07:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 17:07:30,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673420935] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 17:07:30,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 17:07:30,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 15 [2022-07-12 17:07:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049966273] [2022-07-12 17:07:30,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 17:07:30,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:07:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:07:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 17:07:30,949 INFO L87 Difference]: Start difference. First operand 2564 states and 3521 transitions. Second operand has 15 states, 14 states have (on average 7.785714285714286) internal successors, (109), 12 states have internal predecessors, (109), 5 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (43), 6 states have call predecessors, (43), 5 states have call successors, (43) [2022-07-12 17:07:33,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []