./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.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 a63a35a997d4cef3a03c29c7166a2a1f9c94c58040c56bbf24b94b5923949bbd --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:09:13,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:09:13,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:09:13,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:09:13,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:09:13,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:09:13,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:09:13,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:09:13,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:09:13,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:09:13,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:09:13,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:09:13,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:09:13,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:09:13,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:09:13,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:09:13,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:09:13,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:09:13,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:09:13,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:09:13,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:09:13,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:09:13,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:09:13,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:09:13,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:09:13,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:09:13,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:09:13,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:09:13,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:09:13,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:09:13,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:09:13,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:09:13,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:09:13,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:09:13,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:09:13,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:09:13,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:09:13,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:09:13,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:09:13,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:09:13,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:09:13,820 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 19:09:13,837 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:09:13,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:09:13,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:09:13,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:09:13,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:09:13,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:09:13,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:09:13,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:09:13,839 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:09:13,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:09:13,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:09:13,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:09:13,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 19:09:13,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:09:13,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 19:09:13,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 19:09:13,841 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:09:13,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 19:09:13,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:09:13,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:09:13,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:09:13,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:09:13,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:09:13,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:09:13,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 19:09:13,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:09:13,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:09:13,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 19:09:13,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 19:09:13,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 19:09:13,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:09:13,844 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 -> a63a35a997d4cef3a03c29c7166a2a1f9c94c58040c56bbf24b94b5923949bbd [2021-12-14 19:09:14,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:09:14,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:09:14,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:09:14,047 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:09:14,048 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:09:14,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2021-12-14 19:09:14,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7161a4453/fc0af45a191d4a9da263abf263fa7032/FLAG7ed1cc16b [2021-12-14 19:09:14,777 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:09:14,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2021-12-14 19:09:14,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7161a4453/fc0af45a191d4a9da263abf263fa7032/FLAG7ed1cc16b [2021-12-14 19:09:14,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7161a4453/fc0af45a191d4a9da263abf263fa7032 [2021-12-14 19:09:14,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:09:14,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:09:14,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:09:14,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:09:14,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:09:14,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:09:14" (1/1) ... [2021-12-14 19:09:14,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4695c29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:14, skipping insertion in model container [2021-12-14 19:09:14,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:09:14" (1/1) ... [2021-12-14 19:09:14,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:09:14,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:09:17,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397439,397452] [2021-12-14 19:09:17,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397584,397597] [2021-12-14 19:09:17,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397730,397743] [2021-12-14 19:09:17,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397895,397908] [2021-12-14 19:09:17,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398053,398066] [2021-12-14 19:09:17,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398211,398224] [2021-12-14 19:09:17,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398369,398382] [2021-12-14 19:09:17,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398529,398542] [2021-12-14 19:09:17,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398688,398701] [2021-12-14 19:09:17,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398827,398840] [2021-12-14 19:09:17,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398969,398982] [2021-12-14 19:09:17,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399118,399131] [2021-12-14 19:09:17,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399257,399270] [2021-12-14 19:09:17,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399412,399425] [2021-12-14 19:09:17,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399572,399585] [2021-12-14 19:09:17,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399723,399736] [2021-12-14 19:09:17,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399874,399887] [2021-12-14 19:09:17,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400026,400039] [2021-12-14 19:09:17,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400175,400188] [2021-12-14 19:09:17,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400323,400336] [2021-12-14 19:09:17,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400480,400493] [2021-12-14 19:09:17,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400629,400642] [2021-12-14 19:09:17,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400785,400798] [2021-12-14 19:09:17,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400938,400951] [2021-12-14 19:09:17,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401084,401097] [2021-12-14 19:09:17,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401227,401240] [2021-12-14 19:09:17,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401379,401392] [2021-12-14 19:09:17,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401525,401538] [2021-12-14 19:09:17,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401670,401683] [2021-12-14 19:09:17,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401824,401837] [2021-12-14 19:09:17,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401975,401988] [2021-12-14 19:09:17,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402130,402143] [2021-12-14 19:09:17,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402282,402295] [2021-12-14 19:09:17,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402437,402450] [2021-12-14 19:09:17,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402601,402614] [2021-12-14 19:09:17,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402757,402770] [2021-12-14 19:09:17,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402921,402934] [2021-12-14 19:09:17,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403063,403076] [2021-12-14 19:09:17,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403221,403234] [2021-12-14 19:09:17,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403388,403401] [2021-12-14 19:09:17,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403547,403560] [2021-12-14 19:09:17,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403706,403719] [2021-12-14 19:09:17,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403855,403868] [2021-12-14 19:09:17,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404002,404015] [2021-12-14 19:09:17,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404141,404154] [2021-12-14 19:09:17,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404304,404317] [2021-12-14 19:09:17,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404470,404483] [2021-12-14 19:09:17,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404634,404647] [2021-12-14 19:09:17,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404799,404812] [2021-12-14 19:09:17,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404964,404977] [2021-12-14 19:09:17,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405130,405143] [2021-12-14 19:09:17,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405295,405308] [2021-12-14 19:09:17,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405462,405475] [2021-12-14 19:09:17,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405622,405635] [2021-12-14 19:09:17,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405784,405797] [2021-12-14 19:09:17,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405943,405956] [2021-12-14 19:09:17,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406089,406102] [2021-12-14 19:09:17,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406232,406245] [2021-12-14 19:09:17,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406376,406389] [2021-12-14 19:09:17,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406519,406532] [2021-12-14 19:09:17,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406663,406676] [2021-12-14 19:09:17,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406804,406817] [2021-12-14 19:09:17,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406942,406955] [2021-12-14 19:09:17,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407100,407113] [2021-12-14 19:09:17,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407259,407272] [2021-12-14 19:09:17,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407415,407428] [2021-12-14 19:09:17,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407564,407577] [2021-12-14 19:09:17,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407716,407729] [2021-12-14 19:09:17,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407867,407880] [2021-12-14 19:09:17,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408016,408029] [2021-12-14 19:09:17,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408168,408181] [2021-12-14 19:09:17,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408316,408329] [2021-12-14 19:09:17,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2021-12-14 19:09:17,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408620,408633] [2021-12-14 19:09:17,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408770,408783] [2021-12-14 19:09:17,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408917,408930] [2021-12-14 19:09:17,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409068,409081] [2021-12-14 19:09:17,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409219,409232] [2021-12-14 19:09:17,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409367,409380] [2021-12-14 19:09:17,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2021-12-14 19:09:17,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2021-12-14 19:09:17,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2021-12-14 19:09:17,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2021-12-14 19:09:17,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2021-12-14 19:09:17,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2021-12-14 19:09:17,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410495,410508] [2021-12-14 19:09:17,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410665,410678] [2021-12-14 19:09:17,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410827,410840] [2021-12-14 19:09:17,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:09:17,893 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:09:18,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397439,397452] [2021-12-14 19:09:18,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397584,397597] [2021-12-14 19:09:18,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397730,397743] [2021-12-14 19:09:18,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397895,397908] [2021-12-14 19:09:18,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398053,398066] [2021-12-14 19:09:18,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398211,398224] [2021-12-14 19:09:18,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398369,398382] [2021-12-14 19:09:18,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398529,398542] [2021-12-14 19:09:18,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398688,398701] [2021-12-14 19:09:18,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398827,398840] [2021-12-14 19:09:18,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398969,398982] [2021-12-14 19:09:18,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399118,399131] [2021-12-14 19:09:18,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399257,399270] [2021-12-14 19:09:18,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399412,399425] [2021-12-14 19:09:18,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399572,399585] [2021-12-14 19:09:18,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399723,399736] [2021-12-14 19:09:18,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399874,399887] [2021-12-14 19:09:18,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400026,400039] [2021-12-14 19:09:18,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400175,400188] [2021-12-14 19:09:18,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400323,400336] [2021-12-14 19:09:18,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400480,400493] [2021-12-14 19:09:18,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400629,400642] [2021-12-14 19:09:18,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400785,400798] [2021-12-14 19:09:18,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400938,400951] [2021-12-14 19:09:18,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401084,401097] [2021-12-14 19:09:18,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401227,401240] [2021-12-14 19:09:18,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401379,401392] [2021-12-14 19:09:18,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401525,401538] [2021-12-14 19:09:18,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401670,401683] [2021-12-14 19:09:18,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401824,401837] [2021-12-14 19:09:18,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401975,401988] [2021-12-14 19:09:18,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402130,402143] [2021-12-14 19:09:18,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402282,402295] [2021-12-14 19:09:18,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402437,402450] [2021-12-14 19:09:18,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402601,402614] [2021-12-14 19:09:18,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402757,402770] [2021-12-14 19:09:18,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402921,402934] [2021-12-14 19:09:18,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403063,403076] [2021-12-14 19:09:18,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403221,403234] [2021-12-14 19:09:18,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403388,403401] [2021-12-14 19:09:18,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403547,403560] [2021-12-14 19:09:18,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403706,403719] [2021-12-14 19:09:18,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403855,403868] [2021-12-14 19:09:18,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404002,404015] [2021-12-14 19:09:18,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404141,404154] [2021-12-14 19:09:18,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404304,404317] [2021-12-14 19:09:18,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404470,404483] [2021-12-14 19:09:18,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404634,404647] [2021-12-14 19:09:18,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404799,404812] [2021-12-14 19:09:18,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404964,404977] [2021-12-14 19:09:18,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405130,405143] [2021-12-14 19:09:18,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405295,405308] [2021-12-14 19:09:18,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405462,405475] [2021-12-14 19:09:18,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405622,405635] [2021-12-14 19:09:18,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405784,405797] [2021-12-14 19:09:18,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405943,405956] [2021-12-14 19:09:18,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406089,406102] [2021-12-14 19:09:18,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406232,406245] [2021-12-14 19:09:18,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406376,406389] [2021-12-14 19:09:18,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406519,406532] [2021-12-14 19:09:18,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406663,406676] [2021-12-14 19:09:18,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406804,406817] [2021-12-14 19:09:18,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406942,406955] [2021-12-14 19:09:18,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407100,407113] [2021-12-14 19:09:18,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407259,407272] [2021-12-14 19:09:18,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407415,407428] [2021-12-14 19:09:18,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407564,407577] [2021-12-14 19:09:18,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407716,407729] [2021-12-14 19:09:18,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407867,407880] [2021-12-14 19:09:18,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408016,408029] [2021-12-14 19:09:18,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408168,408181] [2021-12-14 19:09:18,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408316,408329] [2021-12-14 19:09:18,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[408620,408633] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[408770,408783] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[408917,408930] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[409068,409081] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[409219,409232] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[409367,409380] [2021-12-14 19:09:18,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2021-12-14 19:09:18,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2021-12-14 19:09:18,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2021-12-14 19:09:18,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2021-12-14 19:09:18,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2021-12-14 19:09:18,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[410495,410508] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[410665,410678] [2021-12-14 19:09:18,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--net--can--janz-ican3.ko.cil.i[410827,410840] [2021-12-14 19:09:18,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:09:18,409 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:09:18,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18 WrapperNode [2021-12-14 19:09:18,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:09:18,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:09:18,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:09:18,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:09:18,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,617 INFO L137 Inliner]: procedures = 641, calls = 2560, calls flagged for inlining = 300, calls inlined = 195, statements flattened = 3283 [2021-12-14 19:09:18,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:09:18,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:09:18,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:09:18,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:09:18,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:09:18,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:09:18,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:09:18,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:09:18,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (1/1) ... [2021-12-14 19:09:18,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:09:18,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:09:18,800 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-14 19:09:18,835 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-14 19:09:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:09:18,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:09:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_open [2021-12-14 19:09:18,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_open [2021-12-14 19:09:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-14 19:09:18,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-14 19:09:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:09:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:09:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2021-12-14 19:09:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2021-12-14 19:09:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-14 19:09:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-14 19:09:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2021-12-14 19:09:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2021-12-14 19:09:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-12-14 19:09:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-12-14 19:09:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2021-12-14 19:09:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2021-12-14 19:09:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:09:18,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:09:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:09:18,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:09:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-12-14 19:09:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-12-14 19:09:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_reset_module [2021-12-14 19:09:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_reset_module [2021-12-14 19:09:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_bus_state [2021-12-14 19:09:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_bus_state [2021-12-14 19:09:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-14 19:09:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-14 19:09:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-14 19:09:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-14 19:09:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:09:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:09:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2021-12-14 19:09:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2021-12-14 19:09:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:09:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_buserror [2021-12-14 19:09:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_buserror [2021-12-14 19:09:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:09:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:09:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-14 19:09:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-14 19:09:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-14 19:09:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_remove [2021-12-14 19:09:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_remove [2021-12-14 19:09:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-12-14 19:09:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-12-14 19:09:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-14 19:09:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-14 19:09:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-14 19:09:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-14 19:09:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-14 19:09:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:09:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:09:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:09:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:09:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:09:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-14 19:09:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-14 19:09:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:09:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:09:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-14 19:09:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-14 19:09:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_txok [2021-12-14 19:09:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_txok [2021-12-14 19:09:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_termination [2021-12-14 19:09:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_termination [2021-12-14 19:09:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_msg [2021-12-14 19:09:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_msg [2021-12-14 19:09:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_page [2021-12-14 19:09:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_page [2021-12-14 19:09:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:09:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:09:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:09:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:09:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:09:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_inquiry [2021-12-14 19:09:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_inquiry [2021-12-14 19:09:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:09:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-14 19:09:18,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-14 19:09:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:09:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-12-14 19:09:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-12-14 19:09:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-14 19:09:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-14 19:09:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2021-12-14 19:09:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2021-12-14 19:09:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure napi_disable [2021-12-14 19:09:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_disable [2021-12-14 19:09:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-12-14 19:09:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-12-14 19:09:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:09:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:09:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2021-12-14 19:09:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2021-12-14 19:09:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:09:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:09:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-14 19:09:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-14 19:09:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-14 19:09:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-14 19:09:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_fromio [2021-12-14 19:09:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_fromio [2021-12-14 19:09:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-14 19:09:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-14 19:09:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2021-12-14 19:09:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2021-12-14 19:09:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_stop [2021-12-14 19:09:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_stop [2021-12-14 19:09:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-14 19:09:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-14 19:09:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2021-12-14 19:09:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2021-12-14 19:09:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-14 19:09:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-14 19:09:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_127 [2021-12-14 19:09:18,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_127 [2021-12-14 19:09:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:09:18,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:09:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:09:18,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:09:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:09:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:09:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:09:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:09:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2021-12-14 19:09:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2021-12-14 19:09:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_probe [2021-12-14 19:09:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_probe [2021-12-14 19:09:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:09:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2021-12-14 19:09:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2021-12-14 19:09:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2021-12-14 19:09:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2021-12-14 19:09:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:09:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:09:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-14 19:09:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-14 19:09:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2021-12-14 19:09:18,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2021-12-14 19:09:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-14 19:09:18,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-14 19:09:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2021-12-14 19:09:18,889 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2021-12-14 19:09:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2021-12-14 19:09:18,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2021-12-14 19:09:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:09:18,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:09:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:09:18,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:09:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-14 19:09:18,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-14 19:09:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-12-14 19:09:18,890 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-12-14 19:09:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:09:18,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:09:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:09:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:09:18,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:09:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-14 19:09:18,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-14 19:09:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:09:18,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:09:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-14 19:09:18,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-14 19:09:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:09:18,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:09:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:09:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2021-12-14 19:09:18,892 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2021-12-14 19:09:19,415 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:09:19,419 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:09:19,603 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-14 19:09:23,510 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:09:23,530 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:09:23,536 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 19:09:23,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:09:23 BoogieIcfgContainer [2021-12-14 19:09:23,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:09:23,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:09:23,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:09:23,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:09:23,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:09:14" (1/3) ... [2021-12-14 19:09:23,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f911e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:09:23, skipping insertion in model container [2021-12-14 19:09:23,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:09:18" (2/3) ... [2021-12-14 19:09:23,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f911e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:09:23, skipping insertion in model container [2021-12-14 19:09:23,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:09:23" (3/3) ... [2021-12-14 19:09:23,547 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2021-12-14 19:09:23,551 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:09:23,551 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-12-14 19:09:23,593 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:09:23,597 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-14 19:09:23,597 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-12-14 19:09:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 1246 states, 831 states have (on average 1.2551143200962696) internal successors, (1043), 878 states have internal predecessors, (1043), 308 states have call successors, (308), 78 states have call predecessors, (308), 77 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2021-12-14 19:09:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 19:09:23,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:23,640 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-14 19:09:23,640 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 27 more)] === [2021-12-14 19:09:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1775150892, now seen corresponding path program 1 times [2021-12-14 19:09:23,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:23,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007991348] [2021-12-14 19:09:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:23,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:09:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:09:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:09:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:09:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:09:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:24,226 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-14 19:09:24,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:24,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007991348] [2021-12-14 19:09:24,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007991348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:24,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:24,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:09:24,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133025296] [2021-12-14 19:09:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:24,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:09:24,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:09:24,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:09:24,261 INFO L87 Difference]: Start difference. First operand has 1246 states, 831 states have (on average 1.2551143200962696) internal successors, (1043), 878 states have internal predecessors, (1043), 308 states have call successors, (308), 78 states have call predecessors, (308), 77 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) 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-14 19:09:26,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 19:09:31,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 19:09:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:34,281 INFO L93 Difference]: Finished difference Result 3672 states and 5151 transitions. [2021-12-14 19:09:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:09:34,287 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-14 19:09:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:34,317 INFO L225 Difference]: With dead ends: 3672 [2021-12-14 19:09:34,317 INFO L226 Difference]: Without dead ends: 2423 [2021-12-14 19:09:34,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:09:34,332 INFO L933 BasicCegarLoop]: 1974 mSDtfsCounter, 3418 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 2167 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3495 SdHoareTripleChecker+Valid, 4022 SdHoareTripleChecker+Invalid, 5422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2167 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:34,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3495 Valid, 4022 Invalid, 5422 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2167 Valid, 3253 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2021-12-14 19:09:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2021-12-14 19:09:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2224. [2021-12-14 19:09:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 1509 states have (on average 1.216699801192843) internal successors, (1836), 1568 states have internal predecessors, (1836), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2021-12-14 19:09:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 2968 transitions. [2021-12-14 19:09:34,510 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 2968 transitions. Word has length 64 [2021-12-14 19:09:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:34,513 INFO L470 AbstractCegarLoop]: Abstraction has 2224 states and 2968 transitions. [2021-12-14 19:09:34,513 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-14 19:09:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2968 transitions. [2021-12-14 19:09:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 19:09:34,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:34,520 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-14 19:09:34,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:09:34,521 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 27 more)] === [2021-12-14 19:09:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1267938721, now seen corresponding path program 1 times [2021-12-14 19:09:34,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:34,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360929250] [2021-12-14 19:09:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:34,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:09:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:09:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:09:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:09:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:09:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:34,740 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-14 19:09:34,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360929250] [2021-12-14 19:09:34,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360929250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:34,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:34,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:09:34,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787423108] [2021-12-14 19:09:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:34,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:09:34,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:09:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:09:34,744 INFO L87 Difference]: Start difference. First operand 2224 states and 2968 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-14 19:09:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:37,575 INFO L93 Difference]: Finished difference Result 2224 states and 2968 transitions. [2021-12-14 19:09:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:09:37,575 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-14 19:09:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:37,585 INFO L225 Difference]: With dead ends: 2224 [2021-12-14 19:09:37,585 INFO L226 Difference]: Without dead ends: 2222 [2021-12-14 19:09:37,586 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-14 19:09:37,587 INFO L933 BasicCegarLoop]: 1402 mSDtfsCounter, 2583 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:37,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2681 Valid, 2546 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-14 19:09:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2021-12-14 19:09:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2222. [2021-12-14 19:09:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 1508 states have (on average 1.2161803713527852) internal successors, (1834), 1566 states have internal predecessors, (1834), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2021-12-14 19:09:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2966 transitions. [2021-12-14 19:09:37,692 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2966 transitions. Word has length 70 [2021-12-14 19:09:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:37,693 INFO L470 AbstractCegarLoop]: Abstraction has 2222 states and 2966 transitions. [2021-12-14 19:09:37,693 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-14 19:09:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2966 transitions. [2021-12-14 19:09:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-14 19:09:37,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:37,694 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-14 19:09:37,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:09:37,695 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 27 more)] === [2021-12-14 19:09:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash -221746204, now seen corresponding path program 1 times [2021-12-14 19:09:37,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:37,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345659561] [2021-12-14 19:09:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:37,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:09:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:09:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:09:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:09:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:09:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:37,878 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-14 19:09:37,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:37,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345659561] [2021-12-14 19:09:37,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345659561] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:37,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:37,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:09:37,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138206762] [2021-12-14 19:09:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:37,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:09:37,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:37,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:09:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:09:37,881 INFO L87 Difference]: Start difference. First operand 2222 states and 2966 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-14 19:09:39,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 19:09:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:41,400 INFO L93 Difference]: Finished difference Result 2222 states and 2966 transitions. [2021-12-14 19:09:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:09:41,400 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-14 19:09:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:41,409 INFO L225 Difference]: With dead ends: 2222 [2021-12-14 19:09:41,409 INFO L226 Difference]: Without dead ends: 2220 [2021-12-14 19:09:41,410 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-14 19:09:41,410 INFO L933 BasicCegarLoop]: 1400 mSDtfsCounter, 2577 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:41,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2674 Valid, 2544 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-14 19:09:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2021-12-14 19:09:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2220. [2021-12-14 19:09:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 1507 states have (on average 1.2156602521566024) internal successors, (1832), 1564 states have internal predecessors, (1832), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2021-12-14 19:09:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2964 transitions. [2021-12-14 19:09:41,475 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2964 transitions. Word has length 76 [2021-12-14 19:09:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:41,476 INFO L470 AbstractCegarLoop]: Abstraction has 2220 states and 2964 transitions. [2021-12-14 19:09:41,476 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-14 19:09:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2964 transitions. [2021-12-14 19:09:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-14 19:09:41,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:41,477 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-14 19:09:41,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:09:41,477 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 27 more)] === [2021-12-14 19:09:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1928615397, now seen corresponding path program 1 times [2021-12-14 19:09:41,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:41,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861955055] [2021-12-14 19:09:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:41,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:09:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:09:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:09:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:09:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:09:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:09:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:41,668 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-14 19:09:41,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:41,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861955055] [2021-12-14 19:09:41,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861955055] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:41,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:41,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:09:41,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361911087] [2021-12-14 19:09:41,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:41,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:09:41,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:09:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:09:41,671 INFO L87 Difference]: Start difference. First operand 2220 states and 2964 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-14 19:09:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:44,627 INFO L93 Difference]: Finished difference Result 2220 states and 2964 transitions. [2021-12-14 19:09:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:09:44,628 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-14 19:09:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:44,638 INFO L225 Difference]: With dead ends: 2220 [2021-12-14 19:09:44,638 INFO L226 Difference]: Without dead ends: 2218 [2021-12-14 19:09:44,639 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-14 19:09:44,640 INFO L933 BasicCegarLoop]: 1398 mSDtfsCounter, 2571 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:44,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2667 Valid, 2542 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-14 19:09:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2021-12-14 19:09:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2021-12-14 19:09:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 1506 states have (on average 1.2151394422310757) internal successors, (1830), 1562 states have internal predecessors, (1830), 554 states have call successors, (554), 134 states have call predecessors, (554), 132 states have return successors, (578), 546 states have call predecessors, (578), 552 states have call successors, (578) [2021-12-14 19:09:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 2962 transitions. [2021-12-14 19:09:44,705 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 2962 transitions. Word has length 82 [2021-12-14 19:09:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:44,706 INFO L470 AbstractCegarLoop]: Abstraction has 2218 states and 2962 transitions. [2021-12-14 19:09:44,706 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-14 19:09:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2962 transitions. [2021-12-14 19:09:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 19:09:44,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:44,707 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-14 19:09:44,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:09:44,707 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1132420187, now seen corresponding path program 1 times [2021-12-14 19:09:44,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:44,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566082949] [2021-12-14 19:09:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:44,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:09:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:09:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:09:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:09:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:09:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:09:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-14 19:09:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-14 19:09:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-12-14 19:09:44,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566082949] [2021-12-14 19:09:44,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566082949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:44,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:44,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:09:44,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103784653] [2021-12-14 19:09:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:44,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:09:44,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:44,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:09:44,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:09:44,995 INFO L87 Difference]: Start difference. First operand 2218 states and 2962 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-14 19:09:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:48,044 INFO L93 Difference]: Finished difference Result 4480 states and 6099 transitions. [2021-12-14 19:09:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:09:48,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2021-12-14 19:09:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:48,086 INFO L225 Difference]: With dead ends: 4480 [2021-12-14 19:09:48,086 INFO L226 Difference]: Without dead ends: 2281 [2021-12-14 19:09:48,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:09:48,094 INFO L933 BasicCegarLoop]: 1259 mSDtfsCounter, 3233 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 2255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2255 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:48,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3337 Valid, 1967 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2255 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-14 19:09:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2021-12-14 19:09:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2225. [2021-12-14 19:09:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1510 states have (on average 1.2125827814569536) internal successors, (1831), 1567 states have internal predecessors, (1831), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2021-12-14 19:09:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2993 transitions. [2021-12-14 19:09:48,178 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2993 transitions. Word has length 93 [2021-12-14 19:09:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:48,179 INFO L470 AbstractCegarLoop]: Abstraction has 2225 states and 2993 transitions. [2021-12-14 19:09:48,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-14 19:09:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2993 transitions. [2021-12-14 19:09:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-14 19:09:48,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:48,182 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-14 19:09:48,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:09:48,183 INFO L402 AbstractCegarLoop]: === Iteration 6 === 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 27 more)] === [2021-12-14 19:09:48,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:48,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1986609266, now seen corresponding path program 1 times [2021-12-14 19:09:48,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:48,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673022143] [2021-12-14 19:09:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:48,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:09:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:09:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:09:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:09:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:09:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:09:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:09:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:48,362 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-14 19:09:48,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:48,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673022143] [2021-12-14 19:09:48,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673022143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:48,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:48,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:09:48,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664336177] [2021-12-14 19:09:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:48,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:09:48,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:09:48,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:09:48,365 INFO L87 Difference]: Start difference. First operand 2225 states and 2993 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-14 19:09:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:51,118 INFO L93 Difference]: Finished difference Result 2225 states and 2993 transitions. [2021-12-14 19:09:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:09:51,118 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-14 19:09:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:51,128 INFO L225 Difference]: With dead ends: 2225 [2021-12-14 19:09:51,128 INFO L226 Difference]: Without dead ends: 2223 [2021-12-14 19:09:51,129 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-14 19:09:51,129 INFO L933 BasicCegarLoop]: 1391 mSDtfsCounter, 2560 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2655 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:51,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2655 Valid, 2521 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-14 19:09:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2021-12-14 19:09:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2223. [2021-12-14 19:09:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1509 states have (on average 1.2120609675281644) internal successors, (1829), 1565 states have internal predecessors, (1829), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2021-12-14 19:09:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2991 transitions. [2021-12-14 19:09:51,207 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2991 transitions. Word has length 88 [2021-12-14 19:09:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:51,207 INFO L470 AbstractCegarLoop]: Abstraction has 2223 states and 2991 transitions. [2021-12-14 19:09:51,207 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-14 19:09:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2991 transitions. [2021-12-14 19:09:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-14 19:09:51,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:51,208 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-14 19:09:51,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:09:51,209 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:09:51,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash -905244364, now seen corresponding path program 1 times [2021-12-14 19:09:51,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:51,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456721329] [2021-12-14 19:09:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:51,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:09:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:09:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:09:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:09:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:09:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:09:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 19:09:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-14 19:09:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-14 19:09:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 19:09:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-14 19:09:51,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456721329] [2021-12-14 19:09:51,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456721329] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:09:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886388231] [2021-12-14 19:09:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:51,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:09:51,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:09:51,464 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-14 19:09:51,467 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-14 19:09:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:51,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:09:51,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:09:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-12-14 19:09:52,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:09:52,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886388231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:52,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:09:52,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-14 19:09:52,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316267578] [2021-12-14 19:09:52,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:52,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:09:52,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:52,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:09:52,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:09:52,068 INFO L87 Difference]: Start difference. First operand 2223 states and 2991 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:09:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:52,159 INFO L93 Difference]: Finished difference Result 4421 states and 5947 transitions. [2021-12-14 19:09:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:09:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2021-12-14 19:09:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:52,170 INFO L225 Difference]: With dead ends: 4421 [2021-12-14 19:09:52,170 INFO L226 Difference]: Without dead ends: 2217 [2021-12-14 19:09:52,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:09:52,179 INFO L933 BasicCegarLoop]: 1580 mSDtfsCounter, 1560 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 1580 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-14 19:09:52,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1560 Valid, 1580 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:09:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2021-12-14 19:09:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2021-12-14 19:09:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1504 states have (on average 1.2101063829787233) internal successors, (1820), 1559 states have internal predecessors, (1820), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2021-12-14 19:09:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2982 transitions. [2021-12-14 19:09:52,262 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2982 transitions. Word has length 99 [2021-12-14 19:09:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:52,262 INFO L470 AbstractCegarLoop]: Abstraction has 2217 states and 2982 transitions. [2021-12-14 19:09:52,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:09:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2982 transitions. [2021-12-14 19:09:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-14 19:09:52,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:52,263 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-14 19:09:52,287 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-14 19:09:52,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:09:52,480 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 27 more)] === [2021-12-14 19:09:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash 735978523, now seen corresponding path program 1 times [2021-12-14 19:09:52,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:52,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829119660] [2021-12-14 19:09:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:52,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:09:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:09:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:09:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:09:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:09:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:09:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:09:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:09:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:52,654 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-14 19:09:52,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:52,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829119660] [2021-12-14 19:09:52,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829119660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:52,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:52,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:09:52,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064453211] [2021-12-14 19:09:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:52,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:09:52,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:09:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:09:52,656 INFO L87 Difference]: Start difference. First operand 2217 states and 2982 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-14 19:09:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:55,082 INFO L93 Difference]: Finished difference Result 2217 states and 2982 transitions. [2021-12-14 19:09:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:09:55,082 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-14 19:09:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:55,092 INFO L225 Difference]: With dead ends: 2217 [2021-12-14 19:09:55,092 INFO L226 Difference]: Without dead ends: 2215 [2021-12-14 19:09:55,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:09:55,094 INFO L933 BasicCegarLoop]: 1384 mSDtfsCounter, 2549 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2643 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:55,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2643 Valid, 2500 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-14 19:09:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2021-12-14 19:09:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2215. [2021-12-14 19:09:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1503 states have (on average 1.2095808383233533) internal successors, (1818), 1557 states have internal predecessors, (1818), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2021-12-14 19:09:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 2980 transitions. [2021-12-14 19:09:55,185 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 2980 transitions. Word has length 94 [2021-12-14 19:09:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:55,185 INFO L470 AbstractCegarLoop]: Abstraction has 2215 states and 2980 transitions. [2021-12-14 19:09:55,186 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-14 19:09:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2980 transitions. [2021-12-14 19:09:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 19:09:55,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:55,188 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-14 19:09:55,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:09:55,188 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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 27 more)] === [2021-12-14 19:09:55,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1396005126, now seen corresponding path program 1 times [2021-12-14 19:09:55,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:55,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545579644] [2021-12-14 19:09:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:55,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:09:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:09:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:09:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:09:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:09:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:09:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:09:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:09:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:09:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:55,359 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-14 19:09:55,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545579644] [2021-12-14 19:09:55,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545579644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:55,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:55,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:09:55,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93119694] [2021-12-14 19:09:55,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:55,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:09:55,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:09:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:09:55,362 INFO L87 Difference]: Start difference. First operand 2215 states and 2980 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-14 19:09:57,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 19:09:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:09:58,984 INFO L93 Difference]: Finished difference Result 2215 states and 2980 transitions. [2021-12-14 19:09:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:09:58,986 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-14 19:09:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:09:58,994 INFO L225 Difference]: With dead ends: 2215 [2021-12-14 19:09:58,994 INFO L226 Difference]: Without dead ends: 2213 [2021-12-14 19:09:58,995 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-14 19:09:58,995 INFO L933 BasicCegarLoop]: 1382 mSDtfsCounter, 2543 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2636 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:09:58,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2636 Valid, 2498 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-12-14 19:09:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2021-12-14 19:09:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2213. [2021-12-14 19:09:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 1502 states have (on average 1.2090545938748336) internal successors, (1816), 1555 states have internal predecessors, (1816), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2021-12-14 19:09:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2978 transitions. [2021-12-14 19:09:59,095 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2978 transitions. Word has length 100 [2021-12-14 19:09:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:09:59,095 INFO L470 AbstractCegarLoop]: Abstraction has 2213 states and 2978 transitions. [2021-12-14 19:09:59,095 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-14 19:09:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2978 transitions. [2021-12-14 19:09:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-14 19:09:59,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:09:59,097 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-14 19:09:59,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:09:59,097 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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 27 more)] === [2021-12-14 19:09:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:09:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash 441346265, now seen corresponding path program 1 times [2021-12-14 19:09:59,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:09:59,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360011463] [2021-12-14 19:09:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:09:59,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:09:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:09:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:09:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:09:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:09:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:09:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:09:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:09:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:09:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:09:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:09:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:09:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:09:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:09:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:09:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:09:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:09:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:09:59,243 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-14 19:09:59,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:09:59,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360011463] [2021-12-14 19:09:59,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360011463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:09:59,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:09:59,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:09:59,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964185456] [2021-12-14 19:09:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:09:59,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:09:59,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:09:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:09:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:09:59,245 INFO L87 Difference]: Start difference. First operand 2213 states and 2978 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-14 19:10:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:10:02,076 INFO L93 Difference]: Finished difference Result 2213 states and 2978 transitions. [2021-12-14 19:10:02,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:10:02,077 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-14 19:10:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:10:02,084 INFO L225 Difference]: With dead ends: 2213 [2021-12-14 19:10:02,085 INFO L226 Difference]: Without dead ends: 2211 [2021-12-14 19:10:02,085 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-14 19:10:02,086 INFO L933 BasicCegarLoop]: 1380 mSDtfsCounter, 2541 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2633 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:10:02,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2633 Valid, 2496 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-14 19:10:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2021-12-14 19:10:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2211. [2021-12-14 19:10:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 1501 states have (on average 1.2085276482345104) internal successors, (1814), 1553 states have internal predecessors, (1814), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2021-12-14 19:10:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2976 transitions. [2021-12-14 19:10:02,162 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2976 transitions. Word has length 106 [2021-12-14 19:10:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:10:02,163 INFO L470 AbstractCegarLoop]: Abstraction has 2211 states and 2976 transitions. [2021-12-14 19:10:02,163 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-14 19:10:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2976 transitions. [2021-12-14 19:10:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-14 19:10:02,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:02,164 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-14 19:10:02,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:10:02,165 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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 27 more)] === [2021-12-14 19:10:02,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1067863908, now seen corresponding path program 1 times [2021-12-14 19:10:02,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:02,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648737469] [2021-12-14 19:10:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:02,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:10:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:10:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:10:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:10:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:10:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:10:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:10:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:10:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:10:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:10:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:10:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:10:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:10:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:02,305 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-14 19:10:02,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:02,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648737469] [2021-12-14 19:10:02,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648737469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:02,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:02,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:10:02,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332403962] [2021-12-14 19:10:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:02,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:10:02,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:10:02,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:10:02,307 INFO L87 Difference]: Start difference. First operand 2211 states and 2976 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-14 19:10:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:10:04,794 INFO L93 Difference]: Finished difference Result 2211 states and 2976 transitions. [2021-12-14 19:10:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:10:04,794 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-14 19:10:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:10:04,802 INFO L225 Difference]: With dead ends: 2211 [2021-12-14 19:10:04,802 INFO L226 Difference]: Without dead ends: 2209 [2021-12-14 19:10:04,807 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-14 19:10:04,807 INFO L933 BasicCegarLoop]: 1378 mSDtfsCounter, 2529 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2621 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:10:04,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2621 Valid, 2494 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-14 19:10:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2021-12-14 19:10:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 2209. [2021-12-14 19:10:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1500 states have (on average 1.208) internal successors, (1812), 1551 states have internal predecessors, (1812), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2021-12-14 19:10:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2974 transitions. [2021-12-14 19:10:04,948 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2974 transitions. Word has length 108 [2021-12-14 19:10:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:10:04,951 INFO L470 AbstractCegarLoop]: Abstraction has 2209 states and 2974 transitions. [2021-12-14 19:10:04,951 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-14 19:10:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2974 transitions. [2021-12-14 19:10:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-14 19:10:04,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:04,953 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-14 19:10:04,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:10:04,953 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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 27 more)] === [2021-12-14 19:10:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash 267562045, now seen corresponding path program 1 times [2021-12-14 19:10:04,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:04,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536491146] [2021-12-14 19:10:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:04,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:10:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:10:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:10:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:10:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:10:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:10:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:10:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:10:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:10:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:10:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:10:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:10:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:10:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:10:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:05,108 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-14 19:10:05,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:05,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536491146] [2021-12-14 19:10:05,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536491146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:05,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:05,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:10:05,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560552550] [2021-12-14 19:10:05,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:05,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:10:05,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:05,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:10:05,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:10:05,111 INFO L87 Difference]: Start difference. First operand 2209 states and 2974 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-14 19:10:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:10:07,659 INFO L93 Difference]: Finished difference Result 2209 states and 2974 transitions. [2021-12-14 19:10:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:10:07,660 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-14 19:10:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:10:07,667 INFO L225 Difference]: With dead ends: 2209 [2021-12-14 19:10:07,668 INFO L226 Difference]: Without dead ends: 2207 [2021-12-14 19:10:07,668 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-14 19:10:07,669 INFO L933 BasicCegarLoop]: 1376 mSDtfsCounter, 2525 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2616 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:10:07,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2616 Valid, 2492 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-14 19:10:07,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2021-12-14 19:10:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2021-12-14 19:10:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 1499 states have (on average 1.2074716477651768) internal successors, (1810), 1549 states have internal predecessors, (1810), 554 states have call successors, (554), 134 states have call predecessors, (554), 136 states have return successors, (608), 548 states have call predecessors, (608), 552 states have call successors, (608) [2021-12-14 19:10:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 2972 transitions. [2021-12-14 19:10:07,754 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 2972 transitions. Word has length 114 [2021-12-14 19:10:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:10:07,755 INFO L470 AbstractCegarLoop]: Abstraction has 2207 states and 2972 transitions. [2021-12-14 19:10:07,755 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-14 19:10:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2972 transitions. [2021-12-14 19:10:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-12-14 19:10:07,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:10:07,756 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:10:07,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:10:07,757 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-14 19:10:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:10:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash 381189444, now seen corresponding path program 1 times [2021-12-14 19:10:07,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:10:07,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78501339] [2021-12-14 19:10:07,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:10:07,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:10:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:10:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:10:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:10:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:10:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:10:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:10:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:10:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:10:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 19:10:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:10:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:10:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:10:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 19:10:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:10:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:10:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:10:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:10:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-14 19:10:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-14 19:10:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-14 19:10:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:10:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-14 19:10:07,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:10:07,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78501339] [2021-12-14 19:10:07,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78501339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:10:07,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:10:07,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:10:07,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867439352] [2021-12-14 19:10:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:10:07,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:10:07,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:10:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:10:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:10:07,992 INFO L87 Difference]: Start difference. First operand 2207 states and 2972 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-14 19:10:10,439 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []