./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--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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--vme--bridges--vme_ca91cx42.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 a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:25:11,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:25:11,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:25:11,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:25:11,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:25:11,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:25:11,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:25:11,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:25:11,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:25:11,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:25:11,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:25:11,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:25:11,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:25:11,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:25:11,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:25:11,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:25:11,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:25:11,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:25:11,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:25:11,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:25:11,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:25:11,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:25:11,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:25:11,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:25:11,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:25:11,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:25:11,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:25:11,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:25:11,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:25:11,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:25:11,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:25:11,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:25:11,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:25:11,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:25:11,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:25:11,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:25:11,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:25:11,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:25:11,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:25:11,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:25:11,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:25:11,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 05:25:11,622 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:25:11,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:25:11,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:25:11,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:25:11,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:25:11,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:25:11,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:25:11,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:25:11,626 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:25:11,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:25:11,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:25:11,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:25:11,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 05:25:11,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:25:11,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 05:25:11,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 05:25:11,627 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:25:11,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 05:25:11,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:25:11,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:25:11,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:25:11,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:25:11,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:25:11,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:25:11,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 05:25:11,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:25:11,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:25:11,629 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 05:25:11,629 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 05:25:11,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 05:25:11,629 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 -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2021-12-28 05:25:11,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:25:11,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:25:11,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:25:11,918 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:25:11,919 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:25:11,920 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--vme--bridges--vme_ca91cx42.ko.cil.i [2021-12-28 05:25:11,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c653bed8a/6310639824964354917c124b5e8661ec/FLAG1f28dafd3 [2021-12-28 05:25:12,562 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:25:12,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2021-12-28 05:25:12,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c653bed8a/6310639824964354917c124b5e8661ec/FLAG1f28dafd3 [2021-12-28 05:25:12,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c653bed8a/6310639824964354917c124b5e8661ec [2021-12-28 05:25:12,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:25:12,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:25:12,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:25:12,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:25:12,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:25:12,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:25:12" (1/1) ... [2021-12-28 05:25:12,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fff3eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:12, skipping insertion in model container [2021-12-28 05:25:12,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:25:12" (1/1) ... [2021-12-28 05:25:12,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:25:12,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:25:14,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2021-12-28 05:25:14,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2021-12-28 05:25:14,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2021-12-28 05:25:14,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2021-12-28 05:25:14,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2021-12-28 05:25:14,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2021-12-28 05:25:14,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2021-12-28 05:25:14,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2021-12-28 05:25:14,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2021-12-28 05:25:14,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2021-12-28 05:25:14,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2021-12-28 05:25:14,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2021-12-28 05:25:14,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2021-12-28 05:25:14,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2021-12-28 05:25:14,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2021-12-28 05:25:14,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2021-12-28 05:25:14,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2021-12-28 05:25:14,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2021-12-28 05:25:14,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2021-12-28 05:25:14,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2021-12-28 05:25:14,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2021-12-28 05:25:14,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2021-12-28 05:25:14,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2021-12-28 05:25:14,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2021-12-28 05:25:14,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2021-12-28 05:25:14,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2021-12-28 05:25:14,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2021-12-28 05:25:14,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2021-12-28 05:25:14,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2021-12-28 05:25:14,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2021-12-28 05:25:14,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2021-12-28 05:25:14,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2021-12-28 05:25:14,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2021-12-28 05:25:14,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2021-12-28 05:25:14,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2021-12-28 05:25:14,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2021-12-28 05:25:14,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2021-12-28 05:25:14,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2021-12-28 05:25:14,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2021-12-28 05:25:14,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2021-12-28 05:25:14,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2021-12-28 05:25:14,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2021-12-28 05:25:14,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2021-12-28 05:25:14,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2021-12-28 05:25:14,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2021-12-28 05:25:14,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2021-12-28 05:25:14,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2021-12-28 05:25:14,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2021-12-28 05:25:14,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2021-12-28 05:25:14,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2021-12-28 05:25:14,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2021-12-28 05:25:14,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2021-12-28 05:25:14,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2021-12-28 05:25:14,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2021-12-28 05:25:14,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2021-12-28 05:25:14,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2021-12-28 05:25:14,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2021-12-28 05:25:14,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2021-12-28 05:25:14,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2021-12-28 05:25:14,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2021-12-28 05:25:14,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2021-12-28 05:25:14,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2021-12-28 05:25:14,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2021-12-28 05:25:14,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2021-12-28 05:25:14,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2021-12-28 05:25:14,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2021-12-28 05:25:14,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2021-12-28 05:25:14,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2021-12-28 05:25:14,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2021-12-28 05:25:14,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2021-12-28 05:25:14,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2021-12-28 05:25:14,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2021-12-28 05:25:14,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2021-12-28 05:25:14,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2021-12-28 05:25:14,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2021-12-28 05:25:14,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2021-12-28 05:25:14,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2021-12-28 05:25:14,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2021-12-28 05:25:14,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2021-12-28 05:25:14,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2021-12-28 05:25:14,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2021-12-28 05:25:14,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2021-12-28 05:25:14,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2021-12-28 05:25:14,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2021-12-28 05:25:14,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2021-12-28 05:25:14,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2021-12-28 05:25:14,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2021-12-28 05:25:14,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2021-12-28 05:25:14,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:25:14,985 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:25:15,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2021-12-28 05:25:15,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2021-12-28 05:25:15,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2021-12-28 05:25:15,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2021-12-28 05:25:15,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2021-12-28 05:25:15,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2021-12-28 05:25:15,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2021-12-28 05:25:15,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2021-12-28 05:25:15,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2021-12-28 05:25:15,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2021-12-28 05:25:15,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2021-12-28 05:25:15,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2021-12-28 05:25:15,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2021-12-28 05:25:15,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2021-12-28 05:25:15,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2021-12-28 05:25:15,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2021-12-28 05:25:15,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2021-12-28 05:25:15,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2021-12-28 05:25:15,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2021-12-28 05:25:15,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2021-12-28 05:25:15,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2021-12-28 05:25:15,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2021-12-28 05:25:15,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2021-12-28 05:25:15,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2021-12-28 05:25:15,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2021-12-28 05:25:15,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2021-12-28 05:25:15,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2021-12-28 05:25:15,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2021-12-28 05:25:15,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2021-12-28 05:25:15,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2021-12-28 05:25:15,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2021-12-28 05:25:15,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2021-12-28 05:25:15,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2021-12-28 05:25:15,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2021-12-28 05:25:15,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2021-12-28 05:25:15,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2021-12-28 05:25:15,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2021-12-28 05:25:15,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2021-12-28 05:25:15,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2021-12-28 05:25:15,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2021-12-28 05:25:15,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2021-12-28 05:25:15,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2021-12-28 05:25:15,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2021-12-28 05:25:15,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2021-12-28 05:25:15,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2021-12-28 05:25:15,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2021-12-28 05:25:15,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2021-12-28 05:25:15,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2021-12-28 05:25:15,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2021-12-28 05:25:15,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2021-12-28 05:25:15,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2021-12-28 05:25:15,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2021-12-28 05:25:15,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2021-12-28 05:25:15,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2021-12-28 05:25:15,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2021-12-28 05:25:15,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2021-12-28 05:25:15,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2021-12-28 05:25:15,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2021-12-28 05:25:15,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2021-12-28 05:25:15,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2021-12-28 05:25:15,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2021-12-28 05:25:15,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2021-12-28 05:25:15,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2021-12-28 05:25:15,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2021-12-28 05:25:15,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2021-12-28 05:25:15,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2021-12-28 05:25:15,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2021-12-28 05:25:15,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2021-12-28 05:25:15,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2021-12-28 05:25:15,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2021-12-28 05:25:15,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2021-12-28 05:25:15,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2021-12-28 05:25:15,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2021-12-28 05:25:15,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2021-12-28 05:25:15,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2021-12-28 05:25:15,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2021-12-28 05:25:15,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2021-12-28 05:25:15,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2021-12-28 05:25:15,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2021-12-28 05:25:15,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2021-12-28 05:25:15,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2021-12-28 05:25:15,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2021-12-28 05:25:15,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2021-12-28 05:25:15,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2021-12-28 05:25:15,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2021-12-28 05:25:15,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2021-12-28 05:25:15,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2021-12-28 05:25:15,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2021-12-28 05:25:15,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:25:15,505 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:25:15,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15 WrapperNode [2021-12-28 05:25:15,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:25:15,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:25:15,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:25:15,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:25:15,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,683 INFO L137 Inliner]: procedures = 571, calls = 1721, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2362 [2021-12-28 05:25:15,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:25:15,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:25:15,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:25:15,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:25:15,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:25:15,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:25:15,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:25:15,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:25:15,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (1/1) ... [2021-12-28 05:25:15,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:25:15,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:25:15,847 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) [2021-12-28 05:25:15,860 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 [2021-12-28 05:25:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:25:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:25:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2021-12-28 05:25:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2021-12-28 05:25:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-28 05:25:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-28 05:25:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 05:25:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 05:25:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2021-12-28 05:25:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2021-12-28 05:25:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:25:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:25:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2021-12-28 05:25:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2021-12-28 05:25:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:25:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:25:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:25:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:25:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2021-12-28 05:25:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2021-12-28 05:25:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-28 05:25:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-28 05:25:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2021-12-28 05:25:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2021-12-28 05:25:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-28 05:25:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-28 05:25:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:25:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:25:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:25:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-12-28 05:25:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-12-28 05:25:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-28 05:25:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-28 05:25:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:25:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:25:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2021-12-28 05:25:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2021-12-28 05:25:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2021-12-28 05:25:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2021-12-28 05:25:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2021-12-28 05:25:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2021-12-28 05:25:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-28 05:25:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-28 05:25:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-28 05:25:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-28 05:25:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-28 05:25:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:25:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:25:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:25:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:25:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:25:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-28 05:25:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-28 05:25:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:25:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:25:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-12-28 05:25:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-12-28 05:25:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-28 05:25:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-28 05:25:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2021-12-28 05:25:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2021-12-28 05:25:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2021-12-28 05:25:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2021-12-28 05:25:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2021-12-28 05:25:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2021-12-28 05:25:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:25:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:25:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2021-12-28 05:25:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2021-12-28 05:25:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:25:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:25:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2021-12-28 05:25:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2021-12-28 05:25:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:25:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-12-28 05:25:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-12-28 05:25:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:25:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-28 05:25:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-28 05:25:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:25:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-12-28 05:25:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-12-28 05:25:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-28 05:25:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-28 05:25:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2021-12-28 05:25:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2021-12-28 05:25:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:25:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:25:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-12-28 05:25:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-12-28 05:25:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2021-12-28 05:25:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2021-12-28 05:25:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:25:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:25:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-28 05:25:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-28 05:25:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-28 05:25:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-28 05:25:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2021-12-28 05:25:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2021-12-28 05:25:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:25:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:25:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:25:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:25:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:25:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-28 05:25:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-28 05:25:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:25:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:25:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:25:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:25:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2021-12-28 05:25:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2021-12-28 05:25:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2021-12-28 05:25:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2021-12-28 05:25:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-28 05:25:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-28 05:25:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2021-12-28 05:25:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2021-12-28 05:25:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:25:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:25:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-28 05:25:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-28 05:25:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2021-12-28 05:25:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2021-12-28 05:25:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-28 05:25:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-28 05:25:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:25:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:25:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-28 05:25:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-28 05:25:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:25:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:25:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2021-12-28 05:25:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2021-12-28 05:25:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:25:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:25:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-28 05:25:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-28 05:25:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-28 05:25:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-28 05:25:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:25:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2021-12-28 05:25:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2021-12-28 05:25:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:25:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:25:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-28 05:25:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-28 05:25:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:25:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:25:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-12-28 05:25:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-12-28 05:25:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-28 05:25:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-28 05:25:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:25:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:25:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2021-12-28 05:25:15,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2021-12-28 05:25:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:25:16,397 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:25:16,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:25:16,480 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-28 05:25:18,296 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:25:18,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:25:18,312 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 05:25:18,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:25:18 BoogieIcfgContainer [2021-12-28 05:25:18,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:25:18,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:25:18,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:25:18,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:25:18,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:25:12" (1/3) ... [2021-12-28 05:25:18,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e319a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:25:18, skipping insertion in model container [2021-12-28 05:25:18,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:25:15" (2/3) ... [2021-12-28 05:25:18,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e319a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:25:18, skipping insertion in model container [2021-12-28 05:25:18,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:25:18" (3/3) ... [2021-12-28 05:25:18,321 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2021-12-28 05:25:18,324 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:25:18,325 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-28 05:25:18,359 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:25:18,363 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:25:18,363 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-28 05:25:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 959 states, 608 states have (on average 1.238486842105263) internal successors, (753), 649 states have internal predecessors, (753), 250 states have call successors, (250), 73 states have call predecessors, (250), 72 states have return successors, (247), 247 states have call predecessors, (247), 247 states have call successors, (247) [2021-12-28 05:25:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-28 05:25:18,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:18,401 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:18,401 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash 628355767, now seen corresponding path program 1 times [2021-12-28 05:25:18,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:18,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845015239] [2021-12-28 05:25:18,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:18,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:18,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:18,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845015239] [2021-12-28 05:25:18,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845015239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:18,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:18,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:18,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332618105] [2021-12-28 05:25:18,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:18,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:18,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:18,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:18,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:18,971 INFO L87 Difference]: Start difference. First operand has 959 states, 608 states have (on average 1.238486842105263) internal successors, (753), 649 states have internal predecessors, (753), 250 states have call successors, (250), 73 states have call predecessors, (250), 72 states have return successors, (247), 247 states have call predecessors, (247), 247 states have call successors, (247) 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) [2021-12-28 05:25:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:22,135 INFO L93 Difference]: Finished difference Result 2805 states and 3794 transitions. [2021-12-28 05:25:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:25:22,137 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 [2021-12-28 05:25:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:22,163 INFO L225 Difference]: With dead ends: 2805 [2021-12-28 05:25:22,163 INFO L226 Difference]: Without dead ends: 1852 [2021-12-28 05:25:22,177 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:22,180 INFO L933 BasicCegarLoop]: 1476 mSDtfsCounter, 2409 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 1418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2548 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 4006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1418 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:22,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2548 Valid, 3377 Invalid, 4006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1418 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-28 05:25:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-12-28 05:25:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1659. [2021-12-28 05:25:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1067 states have (on average 1.1883786316776008) internal successors, (1268), 1122 states have internal predecessors, (1268), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2153 transitions. [2021-12-28 05:25:22,318 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2153 transitions. Word has length 64 [2021-12-28 05:25:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:22,319 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2153 transitions. [2021-12-28 05:25:22,319 INFO L471 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) [2021-12-28 05:25:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2153 transitions. [2021-12-28 05:25:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 05:25:22,322 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:22,322 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:22,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:25:22,323 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:22,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1959425756, now seen corresponding path program 1 times [2021-12-28 05:25:22,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:22,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558563200] [2021-12-28 05:25:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:22,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:22,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:22,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558563200] [2021-12-28 05:25:22,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558563200] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:22,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:22,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:22,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973993884] [2021-12-28 05:25:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:22,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:22,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:22,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:22,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:22,519 INFO L87 Difference]: Start difference. First operand 1659 states and 2153 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) [2021-12-28 05:25:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:23,861 INFO L93 Difference]: Finished difference Result 1659 states and 2153 transitions. [2021-12-28 05:25:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:23,862 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 [2021-12-28 05:25:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:23,869 INFO L225 Difference]: With dead ends: 1659 [2021-12-28 05:25:23,870 INFO L226 Difference]: Without dead ends: 1657 [2021-12-28 05:25:23,871 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:23,871 INFO L933 BasicCegarLoop]: 1102 mSDtfsCounter, 1652 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:23,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1792 Valid, 2150 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-12-28 05:25:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-12-28 05:25:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1066 states have (on average 1.1876172607879925) internal successors, (1266), 1120 states have internal predecessors, (1266), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2151 transitions. [2021-12-28 05:25:23,922 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2151 transitions. Word has length 70 [2021-12-28 05:25:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:23,922 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2151 transitions. [2021-12-28 05:25:23,922 INFO L471 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) [2021-12-28 05:25:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2151 transitions. [2021-12-28 05:25:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-28 05:25:23,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:23,924 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:23,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:25:23,925 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1402994656, now seen corresponding path program 1 times [2021-12-28 05:25:23,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:23,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420073805] [2021-12-28 05:25:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:23,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:24,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:24,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420073805] [2021-12-28 05:25:24,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420073805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:24,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:24,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:24,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281933271] [2021-12-28 05:25:24,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:24,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:24,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:24,064 INFO L87 Difference]: Start difference. First operand 1657 states and 2151 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) [2021-12-28 05:25:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:25,485 INFO L93 Difference]: Finished difference Result 1657 states and 2151 transitions. [2021-12-28 05:25:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:25,485 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 [2021-12-28 05:25:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:25,493 INFO L225 Difference]: With dead ends: 1657 [2021-12-28 05:25:25,493 INFO L226 Difference]: Without dead ends: 1655 [2021-12-28 05:25:25,495 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:25,496 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 1646 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1785 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:25,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1785 Valid, 2148 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-28 05:25:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2021-12-28 05:25:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2021-12-28 05:25:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1065 states have (on average 1.1868544600938966) internal successors, (1264), 1118 states have internal predecessors, (1264), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2149 transitions. [2021-12-28 05:25:25,586 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2149 transitions. Word has length 76 [2021-12-28 05:25:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:25,587 INFO L470 AbstractCegarLoop]: Abstraction has 1655 states and 2149 transitions. [2021-12-28 05:25:25,587 INFO L471 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) [2021-12-28 05:25:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2149 transitions. [2021-12-28 05:25:25,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-28 05:25:25,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:25,588 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:25,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:25:25,589 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1342220052, now seen corresponding path program 1 times [2021-12-28 05:25:25,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:25,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371710677] [2021-12-28 05:25:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:25,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:25,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371710677] [2021-12-28 05:25:25,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371710677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:25,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:25,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:25,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229880564] [2021-12-28 05:25:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:25,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:25,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:25,808 INFO L87 Difference]: Start difference. First operand 1655 states and 2149 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) [2021-12-28 05:25:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:27,121 INFO L93 Difference]: Finished difference Result 1655 states and 2149 transitions. [2021-12-28 05:25:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:27,122 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 [2021-12-28 05:25:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:27,129 INFO L225 Difference]: With dead ends: 1655 [2021-12-28 05:25:27,129 INFO L226 Difference]: Without dead ends: 1653 [2021-12-28 05:25:27,130 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:27,131 INFO L933 BasicCegarLoop]: 1098 mSDtfsCounter, 1640 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:27,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1778 Valid, 2146 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-12-28 05:25:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2021-12-28 05:25:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1064 states have (on average 1.1860902255639099) internal successors, (1262), 1116 states have internal predecessors, (1262), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2147 transitions. [2021-12-28 05:25:27,219 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2147 transitions. Word has length 82 [2021-12-28 05:25:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:27,220 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2147 transitions. [2021-12-28 05:25:27,220 INFO L471 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) [2021-12-28 05:25:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2147 transitions. [2021-12-28 05:25:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-28 05:25:27,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:27,221 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:27,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:25:27,222 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 148000434, now seen corresponding path program 1 times [2021-12-28 05:25:27,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:27,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292314640] [2021-12-28 05:25:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:27,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:27,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:27,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292314640] [2021-12-28 05:25:27,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292314640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:27,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:27,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:27,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444078140] [2021-12-28 05:25:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:27,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:27,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:27,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:27,421 INFO L87 Difference]: Start difference. First operand 1653 states and 2147 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) [2021-12-28 05:25:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:28,723 INFO L93 Difference]: Finished difference Result 1653 states and 2147 transitions. [2021-12-28 05:25:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:28,724 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 [2021-12-28 05:25:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:28,730 INFO L225 Difference]: With dead ends: 1653 [2021-12-28 05:25:28,730 INFO L226 Difference]: Without dead ends: 1651 [2021-12-28 05:25:28,731 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:28,733 INFO L933 BasicCegarLoop]: 1096 mSDtfsCounter, 1634 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:28,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1771 Valid, 2144 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-12-28 05:25:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2021-12-28 05:25:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1063 states have (on average 1.1853245531514582) internal successors, (1260), 1114 states have internal predecessors, (1260), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2145 transitions. [2021-12-28 05:25:28,787 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2145 transitions. Word has length 88 [2021-12-28 05:25:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:28,788 INFO L470 AbstractCegarLoop]: Abstraction has 1651 states and 2145 transitions. [2021-12-28 05:25:28,788 INFO L471 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) [2021-12-28 05:25:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2145 transitions. [2021-12-28 05:25:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-28 05:25:28,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:28,793 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:28,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:25:28,793 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1268832777, now seen corresponding path program 1 times [2021-12-28 05:25:28,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:28,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704926296] [2021-12-28 05:25:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:28,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:25:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:25:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:25:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 05:25:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:25:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-28 05:25:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-28 05:25:29,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704926296] [2021-12-28 05:25:29,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704926296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:29,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:29,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:25:29,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578357559] [2021-12-28 05:25:29,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:29,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:25:29,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:25:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:25:29,085 INFO L87 Difference]: Start difference. First operand 1651 states and 2145 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 05:25:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:31,452 INFO L93 Difference]: Finished difference Result 3395 states and 4442 transitions. [2021-12-28 05:25:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:25:31,452 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2021-12-28 05:25:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:31,459 INFO L225 Difference]: With dead ends: 3395 [2021-12-28 05:25:31,460 INFO L226 Difference]: Without dead ends: 1765 [2021-12-28 05:25:31,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-28 05:25:31,465 INFO L933 BasicCegarLoop]: 1090 mSDtfsCounter, 2007 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 1327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 3251 SdHoareTripleChecker+Invalid, 4495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1327 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:31,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2147 Valid, 3251 Invalid, 4495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1327 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-28 05:25:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2021-12-28 05:25:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1669. [2021-12-28 05:25:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1075 states have (on average 1.1813953488372093) internal successors, (1270), 1126 states have internal predecessors, (1270), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2155 transitions. [2021-12-28 05:25:31,516 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2155 transitions. Word has length 116 [2021-12-28 05:25:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:31,517 INFO L470 AbstractCegarLoop]: Abstraction has 1669 states and 2155 transitions. [2021-12-28 05:25:31,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 05:25:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2155 transitions. [2021-12-28 05:25:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-28 05:25:31,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:31,518 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:31,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:25:31,518 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:31,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1268773195, now seen corresponding path program 1 times [2021-12-28 05:25:31,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:31,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257946187] [2021-12-28 05:25:31,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:31,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:25:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:25:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:25:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 05:25:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:25:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-28 05:25:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-28 05:25:31,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:31,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257946187] [2021-12-28 05:25:31,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257946187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:31,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:31,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:25:31,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166894113] [2021-12-28 05:25:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:31,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:25:31,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:25:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:25:31,742 INFO L87 Difference]: Start difference. First operand 1669 states and 2155 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2021-12-28 05:25:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:33,580 INFO L93 Difference]: Finished difference Result 1765 states and 2308 transitions. [2021-12-28 05:25:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:25:33,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2021-12-28 05:25:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:33,587 INFO L225 Difference]: With dead ends: 1765 [2021-12-28 05:25:33,588 INFO L226 Difference]: Without dead ends: 1763 [2021-12-28 05:25:33,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:25:33,589 INFO L933 BasicCegarLoop]: 1087 mSDtfsCounter, 1210 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:33,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1210 Valid, 2875 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1088 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-28 05:25:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2021-12-28 05:25:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1667. [2021-12-28 05:25:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1074 states have (on average 1.179702048417132) internal successors, (1267), 1124 states have internal predecessors, (1267), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2152 transitions. [2021-12-28 05:25:33,651 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2152 transitions. Word has length 116 [2021-12-28 05:25:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:33,651 INFO L470 AbstractCegarLoop]: Abstraction has 1667 states and 2152 transitions. [2021-12-28 05:25:33,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2021-12-28 05:25:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2152 transitions. [2021-12-28 05:25:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 05:25:33,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:33,653 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:33,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:25:33,653 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash -93320400, now seen corresponding path program 1 times [2021-12-28 05:25:33,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:33,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009578776] [2021-12-28 05:25:33,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:33,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:33,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:33,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009578776] [2021-12-28 05:25:33,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009578776] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:33,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:33,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:33,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812808127] [2021-12-28 05:25:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:33,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:33,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:33,835 INFO L87 Difference]: Start difference. First operand 1667 states and 2152 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) [2021-12-28 05:25:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:35,004 INFO L93 Difference]: Finished difference Result 1667 states and 2152 transitions. [2021-12-28 05:25:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:35,005 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 [2021-12-28 05:25:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:35,011 INFO L225 Difference]: With dead ends: 1667 [2021-12-28 05:25:35,011 INFO L226 Difference]: Without dead ends: 1665 [2021-12-28 05:25:35,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:25:35,012 INFO L933 BasicCegarLoop]: 1091 mSDtfsCounter, 1619 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:35,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1755 Valid, 2139 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2021-12-28 05:25:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2021-12-28 05:25:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1073 states have (on average 1.1789375582479031) internal successors, (1265), 1122 states have internal predecessors, (1265), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2150 transitions. [2021-12-28 05:25:35,065 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2150 transitions. Word has length 94 [2021-12-28 05:25:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:35,065 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 2150 transitions. [2021-12-28 05:25:35,066 INFO L471 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) [2021-12-28 05:25:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2150 transitions. [2021-12-28 05:25:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-28 05:25:35,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:35,067 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:35,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:25:35,067 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1533254331, now seen corresponding path program 1 times [2021-12-28 05:25:35,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:35,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953926580] [2021-12-28 05:25:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:35,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:25:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:25:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:25:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 05:25:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:25:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-28 05:25:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-28 05:25:35,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:35,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953926580] [2021-12-28 05:25:35,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953926580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:35,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:35,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:35,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103131830] [2021-12-28 05:25:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:35,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:35,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:35,232 INFO L87 Difference]: Start difference. First operand 1665 states and 2150 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 05:25:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:36,522 INFO L93 Difference]: Finished difference Result 3399 states and 4433 transitions. [2021-12-28 05:25:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:36,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-12-28 05:25:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:36,529 INFO L225 Difference]: With dead ends: 3399 [2021-12-28 05:25:36,529 INFO L226 Difference]: Without dead ends: 1755 [2021-12-28 05:25:36,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:25:36,534 INFO L933 BasicCegarLoop]: 1081 mSDtfsCounter, 2011 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 1321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1321 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:36,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2161 Valid, 1965 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1321 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-12-28 05:25:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1659. [2021-12-28 05:25:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1068 states have (on average 1.1760299625468165) internal successors, (1256), 1116 states have internal predecessors, (1256), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2141 transitions. [2021-12-28 05:25:36,591 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2141 transitions. Word has length 120 [2021-12-28 05:25:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:36,592 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2141 transitions. [2021-12-28 05:25:36,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 05:25:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2141 transitions. [2021-12-28 05:25:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 05:25:36,593 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:36,593 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:36,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:25:36,593 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1709105799, now seen corresponding path program 1 times [2021-12-28 05:25:36,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:36,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745112075] [2021-12-28 05:25:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:36,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:36,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:36,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745112075] [2021-12-28 05:25:36,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745112075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:36,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:36,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:36,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110515216] [2021-12-28 05:25:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:36,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:36,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:36,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:36,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:36,729 INFO L87 Difference]: Start difference. First operand 1659 states and 2141 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) [2021-12-28 05:25:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:38,012 INFO L93 Difference]: Finished difference Result 1659 states and 2141 transitions. [2021-12-28 05:25:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:38,013 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 [2021-12-28 05:25:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:38,019 INFO L225 Difference]: With dead ends: 1659 [2021-12-28 05:25:38,019 INFO L226 Difference]: Without dead ends: 1657 [2021-12-28 05:25:38,020 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:38,020 INFO L933 BasicCegarLoop]: 1084 mSDtfsCounter, 1598 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:38,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1733 Valid, 2132 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-12-28 05:25:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-12-28 05:25:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1067 states have (on average 1.175257731958763) internal successors, (1254), 1114 states have internal predecessors, (1254), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2139 transitions. [2021-12-28 05:25:38,125 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2139 transitions. Word has length 100 [2021-12-28 05:25:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:38,125 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2139 transitions. [2021-12-28 05:25:38,126 INFO L471 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) [2021-12-28 05:25:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2139 transitions. [2021-12-28 05:25:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-28 05:25:38,127 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:38,127 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:38,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:25:38,128 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2127900869, now seen corresponding path program 1 times [2021-12-28 05:25:38,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:38,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201231146] [2021-12-28 05:25:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:38,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:38,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201231146] [2021-12-28 05:25:38,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201231146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:38,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:38,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:38,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410487160] [2021-12-28 05:25:38,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:38,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:38,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:38,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:38,260 INFO L87 Difference]: Start difference. First operand 1657 states and 2139 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) [2021-12-28 05:25:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:39,463 INFO L93 Difference]: Finished difference Result 1657 states and 2139 transitions. [2021-12-28 05:25:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:39,464 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 [2021-12-28 05:25:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:39,470 INFO L225 Difference]: With dead ends: 1657 [2021-12-28 05:25:39,470 INFO L226 Difference]: Without dead ends: 1655 [2021-12-28 05:25:39,470 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:39,471 INFO L933 BasicCegarLoop]: 1082 mSDtfsCounter, 1596 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:39,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1730 Valid, 2130 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2021-12-28 05:25:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2021-12-28 05:25:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1066 states have (on average 1.174484052532833) internal successors, (1252), 1112 states have internal predecessors, (1252), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2137 transitions. [2021-12-28 05:25:39,535 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2137 transitions. Word has length 106 [2021-12-28 05:25:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:39,535 INFO L470 AbstractCegarLoop]: Abstraction has 1655 states and 2137 transitions. [2021-12-28 05:25:39,536 INFO L471 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) [2021-12-28 05:25:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2137 transitions. [2021-12-28 05:25:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-28 05:25:39,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:39,537 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:39,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:25:39,537 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash 508438824, now seen corresponding path program 1 times [2021-12-28 05:25:39,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777866227] [2021-12-28 05:25:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:39,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:39,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:39,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777866227] [2021-12-28 05:25:39,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777866227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:39,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:39,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:39,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845596634] [2021-12-28 05:25:39,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:39,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:39,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:39,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:39,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:39,691 INFO L87 Difference]: Start difference. First operand 1655 states and 2137 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) [2021-12-28 05:25:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:40,946 INFO L93 Difference]: Finished difference Result 1655 states and 2137 transitions. [2021-12-28 05:25:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:40,946 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 [2021-12-28 05:25:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:40,953 INFO L225 Difference]: With dead ends: 1655 [2021-12-28 05:25:40,953 INFO L226 Difference]: Without dead ends: 1653 [2021-12-28 05:25:40,954 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:40,955 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 1584 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:40,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1718 Valid, 2128 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-12-28 05:25:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2021-12-28 05:25:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1065 states have (on average 1.1737089201877935) internal successors, (1250), 1110 states have internal predecessors, (1250), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2135 transitions. [2021-12-28 05:25:41,019 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2135 transitions. Word has length 108 [2021-12-28 05:25:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:41,019 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2135 transitions. [2021-12-28 05:25:41,020 INFO L471 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) [2021-12-28 05:25:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2135 transitions. [2021-12-28 05:25:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-28 05:25:41,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:41,021 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:41,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:25:41,021 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1683136456, now seen corresponding path program 1 times [2021-12-28 05:25:41,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:41,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185327669] [2021-12-28 05:25:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:41,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:41,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:41,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185327669] [2021-12-28 05:25:41,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185327669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:41,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:41,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:41,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537322427] [2021-12-28 05:25:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:41,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:41,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:41,166 INFO L87 Difference]: Start difference. First operand 1653 states and 2135 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) [2021-12-28 05:25:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:42,397 INFO L93 Difference]: Finished difference Result 1653 states and 2135 transitions. [2021-12-28 05:25:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:42,398 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 [2021-12-28 05:25:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:42,403 INFO L225 Difference]: With dead ends: 1653 [2021-12-28 05:25:42,403 INFO L226 Difference]: Without dead ends: 1651 [2021-12-28 05:25:42,404 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:42,404 INFO L933 BasicCegarLoop]: 1078 mSDtfsCounter, 1580 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:42,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1713 Valid, 2126 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-12-28 05:25:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2021-12-28 05:25:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1064 states have (on average 1.1729323308270676) internal successors, (1248), 1108 states have internal predecessors, (1248), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2133 transitions. [2021-12-28 05:25:42,465 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2133 transitions. Word has length 114 [2021-12-28 05:25:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:42,466 INFO L470 AbstractCegarLoop]: Abstraction has 1651 states and 2133 transitions. [2021-12-28 05:25:42,466 INFO L471 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) [2021-12-28 05:25:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2133 transitions. [2021-12-28 05:25:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-28 05:25:42,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:42,467 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:42,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:25:42,467 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1638841309, now seen corresponding path program 1 times [2021-12-28 05:25:42,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849929608] [2021-12-28 05:25:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:42,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:42,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:42,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849929608] [2021-12-28 05:25:42,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849929608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:42,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:42,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:42,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454307319] [2021-12-28 05:25:42,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:42,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:42,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:42,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:42,616 INFO L87 Difference]: Start difference. First operand 1651 states and 2133 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) [2021-12-28 05:25:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:43,846 INFO L93 Difference]: Finished difference Result 1651 states and 2133 transitions. [2021-12-28 05:25:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:43,875 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 [2021-12-28 05:25:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:43,881 INFO L225 Difference]: With dead ends: 1651 [2021-12-28 05:25:43,881 INFO L226 Difference]: Without dead ends: 1649 [2021-12-28 05:25:43,882 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:43,883 INFO L933 BasicCegarLoop]: 1076 mSDtfsCounter, 1574 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:43,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1706 Valid, 2124 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2021-12-28 05:25:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2021-12-28 05:25:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1063 states have (on average 1.1721542803386642) internal successors, (1246), 1106 states have internal predecessors, (1246), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2131 transitions. [2021-12-28 05:25:43,952 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2131 transitions. Word has length 120 [2021-12-28 05:25:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:43,952 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2131 transitions. [2021-12-28 05:25:43,952 INFO L471 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) [2021-12-28 05:25:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2131 transitions. [2021-12-28 05:25:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-28 05:25:43,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:43,954 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:43,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:25:43,954 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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 26 more)] === [2021-12-28 05:25:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash 941688793, now seen corresponding path program 1 times [2021-12-28 05:25:43,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:43,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184082957] [2021-12-28 05:25:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:43,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:44,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:44,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184082957] [2021-12-28 05:25:44,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184082957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:44,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:44,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:44,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818256375] [2021-12-28 05:25:44,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:44,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:44,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:44,116 INFO L87 Difference]: Start difference. First operand 1649 states and 2131 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) [2021-12-28 05:25:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:45,392 INFO L93 Difference]: Finished difference Result 1649 states and 2131 transitions. [2021-12-28 05:25:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:45,399 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 [2021-12-28 05:25:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:45,421 INFO L225 Difference]: With dead ends: 1649 [2021-12-28 05:25:45,421 INFO L226 Difference]: Without dead ends: 1647 [2021-12-28 05:25:45,422 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:45,422 INFO L933 BasicCegarLoop]: 1074 mSDtfsCounter, 1568 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:45,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1699 Valid, 2122 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2021-12-28 05:25:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2021-12-28 05:25:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1062 states have (on average 1.1713747645951036) internal successors, (1244), 1104 states have internal predecessors, (1244), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2129 transitions. [2021-12-28 05:25:45,511 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2129 transitions. Word has length 126 [2021-12-28 05:25:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:45,511 INFO L470 AbstractCegarLoop]: Abstraction has 1647 states and 2129 transitions. [2021-12-28 05:25:45,511 INFO L471 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) [2021-12-28 05:25:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2129 transitions. [2021-12-28 05:25:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-28 05:25:45,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:45,513 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 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] [2021-12-28 05:25:45,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:25:45,513 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1629151933, now seen corresponding path program 1 times [2021-12-28 05:25:45,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:45,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226517364] [2021-12-28 05:25:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:45,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:25:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:25:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:25:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 05:25:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:25:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:25:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-12-28 05:25:45,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:45,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226517364] [2021-12-28 05:25:45,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226517364] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:45,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:45,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:25:45,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086359679] [2021-12-28 05:25:45,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:45,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:25:45,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:45,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:25:45,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:25:45,693 INFO L87 Difference]: Start difference. First operand 1647 states and 2129 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-28 05:25:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:47,063 INFO L93 Difference]: Finished difference Result 3369 states and 4381 transitions. [2021-12-28 05:25:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2021-12-28 05:25:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:47,078 INFO L225 Difference]: With dead ends: 3369 [2021-12-28 05:25:47,078 INFO L226 Difference]: Without dead ends: 1743 [2021-12-28 05:25:47,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:25:47,083 INFO L933 BasicCegarLoop]: 910 mSDtfsCounter, 2289 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 1658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2443 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1658 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:47,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2443 Valid, 1778 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1658 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2021-12-28 05:25:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1641. [2021-12-28 05:25:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1057 states have (on average 1.1684011352885526) internal successors, (1235), 1098 states have internal predecessors, (1235), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2120 transitions. [2021-12-28 05:25:47,151 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2120 transitions. Word has length 149 [2021-12-28 05:25:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:47,152 INFO L470 AbstractCegarLoop]: Abstraction has 1641 states and 2120 transitions. [2021-12-28 05:25:47,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-28 05:25:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2120 transitions. [2021-12-28 05:25:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-28 05:25:47,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:47,153 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:47,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:25:47,153 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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 26 more)] === [2021-12-28 05:25:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -547875515, now seen corresponding path program 1 times [2021-12-28 05:25:47,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:47,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329141825] [2021-12-28 05:25:47,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:47,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:25:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:47,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:47,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329141825] [2021-12-28 05:25:47,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329141825] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:47,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:47,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:47,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211708576] [2021-12-28 05:25:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:47,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:47,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:47,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:47,321 INFO L87 Difference]: Start difference. First operand 1641 states and 2120 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) [2021-12-28 05:25:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:48,492 INFO L93 Difference]: Finished difference Result 1641 states and 2120 transitions. [2021-12-28 05:25:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:48,493 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 [2021-12-28 05:25:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:48,504 INFO L225 Difference]: With dead ends: 1641 [2021-12-28 05:25:48,504 INFO L226 Difference]: Without dead ends: 1639 [2021-12-28 05:25:48,505 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:48,506 INFO L933 BasicCegarLoop]: 1067 mSDtfsCounter, 1557 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:48,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1687 Valid, 2101 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2021-12-28 05:25:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2021-12-28 05:25:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1056 states have (on average 1.1676136363636365) internal successors, (1233), 1096 states have internal predecessors, (1233), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2118 transitions. [2021-12-28 05:25:48,572 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2118 transitions. Word has length 132 [2021-12-28 05:25:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:48,573 INFO L470 AbstractCegarLoop]: Abstraction has 1639 states and 2118 transitions. [2021-12-28 05:25:48,573 INFO L471 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) [2021-12-28 05:25:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2118 transitions. [2021-12-28 05:25:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-28 05:25:48,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:48,574 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:48,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:25:48,575 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2144276236, now seen corresponding path program 1 times [2021-12-28 05:25:48,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:48,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570359419] [2021-12-28 05:25:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:48,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:25:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:25:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:25:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 05:25:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:25:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:25:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-28 05:25:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-12-28 05:25:48,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:48,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570359419] [2021-12-28 05:25:48,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570359419] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:25:48,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814128599] [2021-12-28 05:25:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:48,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:25:48,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:25:48,786 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) [2021-12-28 05:25:48,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 05:25:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:49,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 1801 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 05:25:49,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:25:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-28 05:25:49,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:25:49,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814128599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:49,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 05:25:49,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-28 05:25:49,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61166495] [2021-12-28 05:25:49,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:49,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:25:49,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:49,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:25:49,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:25:49,545 INFO L87 Difference]: Start difference. First operand 1639 states and 2118 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-28 05:25:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:49,624 INFO L93 Difference]: Finished difference Result 3251 states and 4198 transitions. [2021-12-28 05:25:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:25:49,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2021-12-28 05:25:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:49,630 INFO L225 Difference]: With dead ends: 3251 [2021-12-28 05:25:49,630 INFO L226 Difference]: Without dead ends: 1633 [2021-12-28 05:25:49,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:25:49,636 INFO L933 BasicCegarLoop]: 1159 mSDtfsCounter, 1104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:49,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1104 Valid, 1159 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:25:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-12-28 05:25:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2021-12-28 05:25:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1051 states have (on average 1.164605137963844) internal successors, (1224), 1090 states have internal predecessors, (1224), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2109 transitions. [2021-12-28 05:25:49,711 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2109 transitions. Word has length 155 [2021-12-28 05:25:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:49,711 INFO L470 AbstractCegarLoop]: Abstraction has 1633 states and 2109 transitions. [2021-12-28 05:25:49,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-28 05:25:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2109 transitions. [2021-12-28 05:25:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-28 05:25:49,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:49,713 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:49,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 05:25:49,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-28 05:25:49,926 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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 26 more)] === [2021-12-28 05:25:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 90130754, now seen corresponding path program 1 times [2021-12-28 05:25:49,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:49,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273671447] [2021-12-28 05:25:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:49,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:25:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:25:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:50,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:50,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273671447] [2021-12-28 05:25:50,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273671447] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:50,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:50,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:50,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943923441] [2021-12-28 05:25:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:50,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:50,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:50,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:50,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:50,119 INFO L87 Difference]: Start difference. First operand 1633 states and 2109 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) [2021-12-28 05:25:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:51,443 INFO L93 Difference]: Finished difference Result 1633 states and 2109 transitions. [2021-12-28 05:25:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:51,444 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 [2021-12-28 05:25:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:51,448 INFO L225 Difference]: With dead ends: 1633 [2021-12-28 05:25:51,448 INFO L226 Difference]: Without dead ends: 1631 [2021-12-28 05:25:51,448 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:51,449 INFO L933 BasicCegarLoop]: 1060 mSDtfsCounter, 1546 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:51,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1675 Valid, 2080 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-12-28 05:25:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-12-28 05:25:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1050 states have (on average 1.1638095238095238) internal successors, (1222), 1088 states have internal predecessors, (1222), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2107 transitions. [2021-12-28 05:25:51,521 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2107 transitions. Word has length 138 [2021-12-28 05:25:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:51,521 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2107 transitions. [2021-12-28 05:25:51,521 INFO L471 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) [2021-12-28 05:25:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2107 transitions. [2021-12-28 05:25:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-28 05:25:51,522 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:51,522 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:51,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 05:25:51,523 INFO L402 AbstractCegarLoop]: === Iteration 20 === 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 26 more)] === [2021-12-28 05:25:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:51,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1354484047, now seen corresponding path program 1 times [2021-12-28 05:25:51,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:51,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405679250] [2021-12-28 05:25:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:51,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:25:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:25:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-28 05:25:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:51,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:51,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405679250] [2021-12-28 05:25:51,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405679250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:51,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:51,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:51,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048758675] [2021-12-28 05:25:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:51,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:51,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:51,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:51,672 INFO L87 Difference]: Start difference. First operand 1631 states and 2107 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) [2021-12-28 05:25:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:52,974 INFO L93 Difference]: Finished difference Result 1631 states and 2107 transitions. [2021-12-28 05:25:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:52,974 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 [2021-12-28 05:25:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:52,978 INFO L225 Difference]: With dead ends: 1631 [2021-12-28 05:25:52,978 INFO L226 Difference]: Without dead ends: 1629 [2021-12-28 05:25:52,979 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:52,981 INFO L933 BasicCegarLoop]: 1058 mSDtfsCounter, 1540 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:52,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1668 Valid, 2078 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2021-12-28 05:25:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2021-12-28 05:25:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1049 states have (on average 1.1630123927550047) internal successors, (1220), 1086 states have internal predecessors, (1220), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2105 transitions. [2021-12-28 05:25:53,061 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2105 transitions. Word has length 144 [2021-12-28 05:25:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:53,061 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2105 transitions. [2021-12-28 05:25:53,061 INFO L471 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) [2021-12-28 05:25:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2105 transitions. [2021-12-28 05:25:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-28 05:25:53,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:53,063 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:53,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 05:25:53,063 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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 26 more)] === [2021-12-28 05:25:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1382898488, now seen corresponding path program 1 times [2021-12-28 05:25:53,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:53,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572141581] [2021-12-28 05:25:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:53,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:25:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:25:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-28 05:25:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 05:25:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:53,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:53,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572141581] [2021-12-28 05:25:53,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572141581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:53,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:53,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:53,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768098491] [2021-12-28 05:25:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:53,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:53,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:53,250 INFO L87 Difference]: Start difference. First operand 1629 states and 2105 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) [2021-12-28 05:25:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:54,534 INFO L93 Difference]: Finished difference Result 1629 states and 2105 transitions. [2021-12-28 05:25:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:54,534 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 [2021-12-28 05:25:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:54,538 INFO L225 Difference]: With dead ends: 1629 [2021-12-28 05:25:54,538 INFO L226 Difference]: Without dead ends: 1627 [2021-12-28 05:25:54,539 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:54,539 INFO L933 BasicCegarLoop]: 1056 mSDtfsCounter, 1534 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:54,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1661 Valid, 2076 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-12-28 05:25:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2021-12-28 05:25:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1048 states have (on average 1.1622137404580153) internal successors, (1218), 1084 states have internal predecessors, (1218), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2103 transitions. [2021-12-28 05:25:54,618 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2103 transitions. Word has length 150 [2021-12-28 05:25:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:54,618 INFO L470 AbstractCegarLoop]: Abstraction has 1627 states and 2103 transitions. [2021-12-28 05:25:54,618 INFO L471 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) [2021-12-28 05:25:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2103 transitions. [2021-12-28 05:25:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-28 05:25:54,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:54,623 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:54,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 05:25:54,624 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1820291379, now seen corresponding path program 1 times [2021-12-28 05:25:54,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:54,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607560929] [2021-12-28 05:25:54,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:54,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:25:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:25:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-28 05:25:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 05:25:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 05:25:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:54,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:54,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607560929] [2021-12-28 05:25:54,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607560929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:54,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:54,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:54,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615880041] [2021-12-28 05:25:54,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:54,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:54,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:54,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:54,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:54,772 INFO L87 Difference]: Start difference. First operand 1627 states and 2103 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-28 05:25:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:56,061 INFO L93 Difference]: Finished difference Result 1627 states and 2103 transitions. [2021-12-28 05:25:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2021-12-28 05:25:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:56,066 INFO L225 Difference]: With dead ends: 1627 [2021-12-28 05:25:56,067 INFO L226 Difference]: Without dead ends: 1625 [2021-12-28 05:25:56,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:25:56,068 INFO L933 BasicCegarLoop]: 1054 mSDtfsCounter, 1528 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:56,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1654 Valid, 2074 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2021-12-28 05:25:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1625. [2021-12-28 05:25:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1047 states have (on average 1.1614135625596944) internal successors, (1216), 1082 states have internal predecessors, (1216), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2101 transitions. [2021-12-28 05:25:56,150 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2101 transitions. Word has length 156 [2021-12-28 05:25:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:56,150 INFO L470 AbstractCegarLoop]: Abstraction has 1625 states and 2101 transitions. [2021-12-28 05:25:56,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-28 05:25:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2101 transitions. [2021-12-28 05:25:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-28 05:25:56,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:56,152 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:56,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 05:25:56,152 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1658758885, now seen corresponding path program 1 times [2021-12-28 05:25:56,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:56,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415295412] [2021-12-28 05:25:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:56,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:25:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:25:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-28 05:25:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 05:25:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 05:25:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-28 05:25:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:56,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:56,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415295412] [2021-12-28 05:25:56,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415295412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:56,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:56,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:56,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770541404] [2021-12-28 05:25:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:56,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:56,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:56,310 INFO L87 Difference]: Start difference. First operand 1625 states and 2101 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-28 05:25:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:57,653 INFO L93 Difference]: Finished difference Result 1625 states and 2101 transitions. [2021-12-28 05:25:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:57,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2021-12-28 05:25:57,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:57,658 INFO L225 Difference]: With dead ends: 1625 [2021-12-28 05:25:57,658 INFO L226 Difference]: Without dead ends: 1623 [2021-12-28 05:25:57,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:25:57,658 INFO L933 BasicCegarLoop]: 1052 mSDtfsCounter, 1522 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:57,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1647 Valid, 2072 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:25:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-12-28 05:25:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1623. [2021-12-28 05:25:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1046 states have (on average 1.1606118546845123) internal successors, (1214), 1080 states have internal predecessors, (1214), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2099 transitions. [2021-12-28 05:25:57,751 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2099 transitions. Word has length 162 [2021-12-28 05:25:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:57,753 INFO L470 AbstractCegarLoop]: Abstraction has 1623 states and 2099 transitions. [2021-12-28 05:25:57,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-28 05:25:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2099 transitions. [2021-12-28 05:25:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-12-28 05:25:57,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:57,755 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:25:57,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 05:25:57,756 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:57,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:57,756 INFO L85 PathProgramCache]: Analyzing trace with hash 243227707, now seen corresponding path program 1 times [2021-12-28 05:25:57,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:57,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920692282] [2021-12-28 05:25:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:57,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 05:25:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 05:25:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 05:25:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 05:25:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:25:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:25:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:25:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:25:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 05:25:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:25:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:25:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:25:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-28 05:25:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-28 05:25:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 05:25:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 05:25:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-28 05:25:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-28 05:25:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-28 05:25:57,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:57,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920692282] [2021-12-28 05:25:57,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920692282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:57,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:57,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:57,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268582954] [2021-12-28 05:25:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:57,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:57,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:57,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:57,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:57,915 INFO L87 Difference]: Start difference. First operand 1623 states and 2099 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-28 05:25:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:59,151 INFO L93 Difference]: Finished difference Result 1623 states and 2099 transitions. [2021-12-28 05:25:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2021-12-28 05:25:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:59,155 INFO L225 Difference]: With dead ends: 1623 [2021-12-28 05:25:59,155 INFO L226 Difference]: Without dead ends: 1621 [2021-12-28 05:25:59,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:25:59,156 INFO L933 BasicCegarLoop]: 1050 mSDtfsCounter, 1516 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:59,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1640 Valid, 2070 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:25:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2021-12-28 05:25:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2021-12-28 05:25:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1045 states have (on average 1.1598086124401914) internal successors, (1212), 1078 states have internal predecessors, (1212), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-28 05:25:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2097 transitions. [2021-12-28 05:25:59,233 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2097 transitions. Word has length 168 [2021-12-28 05:25:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:59,233 INFO L470 AbstractCegarLoop]: Abstraction has 1621 states and 2097 transitions. [2021-12-28 05:25:59,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-28 05:25:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2097 transitions. [2021-12-28 05:25:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-28 05:25:59,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:59,235 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-28 05:25:59,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-28 05:25:59,236 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-28 05:25:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:59,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1956759216, now seen corresponding path program 1 times [2021-12-28 05:25:59,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:59,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562266076] [2021-12-28 05:25:59,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:59,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:25:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 05:25:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-28 05:25:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:25:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 05:25:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:25:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:25:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:25:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-28 05:25:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:25:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-28 05:25:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-28 05:25:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-12-28 05:25:59,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:59,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562266076] [2021-12-28 05:25:59,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562266076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:59,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:59,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:25:59,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801077832] [2021-12-28 05:25:59,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:59,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:25:59,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:25:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:25:59,546 INFO L87 Difference]: Start difference. First operand 1621 states and 2097 transitions. Second operand has 13 states, 12 states have (on average 6.916666666666667) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23)