./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--iio--accel--kxcjk-1013.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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--iio--accel--kxcjk-1013.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 1b1b5191f5abeb283778652e64649fc081867a41ba9a2c202bdf0434abd3ccc0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 03:56:53,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 03:56:53,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 03:56:53,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 03:56:53,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 03:56:53,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 03:56:53,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 03:56:53,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 03:56:53,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 03:56:53,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 03:56:53,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 03:56:53,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 03:56:53,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 03:56:53,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 03:56:53,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 03:56:53,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 03:56:53,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 03:56:53,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 03:56:53,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 03:56:53,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 03:56:53,320 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 03:56:53,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 03:56:53,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 03:56:53,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 03:56:53,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 03:56:53,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 03:56:53,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 03:56:53,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 03:56:53,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 03:56:53,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 03:56:53,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 03:56:53,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 03:56:53,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 03:56:53,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 03:56:53,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 03:56:53,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 03:56:53,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 03:56:53,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 03:56:53,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 03:56:53,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 03:56:53,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 03:56:53,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 03:56:53,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 03:56:53,363 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 03:56:53,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 03:56:53,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 03:56:53,364 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 03:56:53,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 03:56:53,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 03:56:53,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 03:56:53,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 03:56:53,365 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 03:56:53,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 03:56:53,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 03:56:53,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 03:56:53,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 03:56:53,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 03:56:53,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 03:56:53,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 03:56:53,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 03:56:53,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 03:56:53,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 03:56:53,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 03:56:53,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 03:56:53,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:56:53,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 03:56:53,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 03:56:53,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 03:56:53,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 03:56:53,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 03:56:53,370 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 03:56:53,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 03:56:53,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 03:56:53,370 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 -> 1b1b5191f5abeb283778652e64649fc081867a41ba9a2c202bdf0434abd3ccc0 [2022-07-20 03:56:53,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 03:56:53,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 03:56:53,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 03:56:53,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 03:56:53,621 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 03:56:53,627 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--iio--accel--kxcjk-1013.ko.cil.i [2022-07-20 03:56:53,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1fd1eca2/c895b1eb95e54d30952333d7ce637b1b/FLAGfbdc86960 [2022-07-20 03:56:54,639 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 03:56:54,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2022-07-20 03:56:54,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1fd1eca2/c895b1eb95e54d30952333d7ce637b1b/FLAGfbdc86960 [2022-07-20 03:56:55,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1fd1eca2/c895b1eb95e54d30952333d7ce637b1b [2022-07-20 03:56:55,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 03:56:55,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 03:56:55,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 03:56:55,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 03:56:55,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 03:56:55,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:56:55" (1/1) ... [2022-07-20 03:56:55,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e328db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:55, skipping insertion in model container [2022-07-20 03:56:55,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:56:55" (1/1) ... [2022-07-20 03:56:55,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 03:56:55,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 03:56:57,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2022-07-20 03:56:57,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330833,330846] [2022-07-20 03:56:57,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2022-07-20 03:56:57,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2022-07-20 03:56:57,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2022-07-20 03:56:57,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2022-07-20 03:56:57,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331618,331631] [2022-07-20 03:56:57,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331778,331791] [2022-07-20 03:56:57,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331937,331950] [2022-07-20 03:56:57,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332076,332089] [2022-07-20 03:56:57,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332218,332231] [2022-07-20 03:56:57,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332367,332380] [2022-07-20 03:56:57,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332506,332519] [2022-07-20 03:56:57,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332661,332674] [2022-07-20 03:56:57,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332821,332834] [2022-07-20 03:56:57,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332972,332985] [2022-07-20 03:56:57,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2022-07-20 03:56:57,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2022-07-20 03:56:57,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2022-07-20 03:56:57,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333572,333585] [2022-07-20 03:56:57,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333729,333742] [2022-07-20 03:56:57,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333878,333891] [2022-07-20 03:56:57,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334034,334047] [2022-07-20 03:56:57,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334187,334200] [2022-07-20 03:56:57,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334333,334346] [2022-07-20 03:56:57,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334476,334489] [2022-07-20 03:56:57,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334628,334641] [2022-07-20 03:56:57,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334774,334787] [2022-07-20 03:56:57,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334919,334932] [2022-07-20 03:56:57,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335073,335086] [2022-07-20 03:56:57,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335224,335237] [2022-07-20 03:56:57,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335379,335392] [2022-07-20 03:56:57,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335531,335544] [2022-07-20 03:56:57,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335686,335699] [2022-07-20 03:56:57,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335850,335863] [2022-07-20 03:56:57,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336006,336019] [2022-07-20 03:56:57,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2022-07-20 03:56:57,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2022-07-20 03:56:57,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2022-07-20 03:56:57,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336637,336650] [2022-07-20 03:56:57,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336796,336809] [2022-07-20 03:56:57,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336955,336968] [2022-07-20 03:56:57,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337104,337117] [2022-07-20 03:56:57,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337251,337264] [2022-07-20 03:56:57,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337390,337403] [2022-07-20 03:56:57,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337553,337566] [2022-07-20 03:56:57,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337719,337732] [2022-07-20 03:56:57,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337883,337896] [2022-07-20 03:56:57,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338048,338061] [2022-07-20 03:56:57,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2022-07-20 03:56:57,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2022-07-20 03:56:57,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2022-07-20 03:56:57,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2022-07-20 03:56:57,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338871,338884] [2022-07-20 03:56:57,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339033,339046] [2022-07-20 03:56:57,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339192,339205] [2022-07-20 03:56:57,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339338,339351] [2022-07-20 03:56:57,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339481,339494] [2022-07-20 03:56:57,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339625,339638] [2022-07-20 03:56:57,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339768,339781] [2022-07-20 03:56:57,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339912,339925] [2022-07-20 03:56:57,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340053,340066] [2022-07-20 03:56:57,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340191,340204] [2022-07-20 03:56:57,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340349,340362] [2022-07-20 03:56:57,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340508,340521] [2022-07-20 03:56:57,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2022-07-20 03:56:57,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2022-07-20 03:56:57,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2022-07-20 03:56:57,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341116,341129] [2022-07-20 03:56:57,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341265,341278] [2022-07-20 03:56:57,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341417,341430] [2022-07-20 03:56:57,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341565,341578] [2022-07-20 03:56:57,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341718,341731] [2022-07-20 03:56:57,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341869,341882] [2022-07-20 03:56:57,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342019,342032] [2022-07-20 03:56:57,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2022-07-20 03:56:57,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2022-07-20 03:56:57,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2022-07-20 03:56:57,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342616,342629] [2022-07-20 03:56:57,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342782,342795] [2022-07-20 03:56:57,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342951,342964] [2022-07-20 03:56:57,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343118,343131] [2022-07-20 03:56:57,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343286,343299] [2022-07-20 03:56:57,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343436,343449] [2022-07-20 03:56:57,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343583,343596] [2022-07-20 03:56:57,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343744,343757] [2022-07-20 03:56:57,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343914,343927] [2022-07-20 03:56:57,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[344076,344089] [2022-07-20 03:56:57,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:56:57,677 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 03:56:57,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330688,330701] [2022-07-20 03:56:57,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330833,330846] [2022-07-20 03:56:57,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[330979,330992] [2022-07-20 03:56:57,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331144,331157] [2022-07-20 03:56:57,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331302,331315] [2022-07-20 03:56:57,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331460,331473] [2022-07-20 03:56:57,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331618,331631] [2022-07-20 03:56:57,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331778,331791] [2022-07-20 03:56:57,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[331937,331950] [2022-07-20 03:56:57,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332076,332089] [2022-07-20 03:56:57,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332218,332231] [2022-07-20 03:56:57,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332367,332380] [2022-07-20 03:56:57,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332506,332519] [2022-07-20 03:56:57,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332661,332674] [2022-07-20 03:56:57,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332821,332834] [2022-07-20 03:56:57,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[332972,332985] [2022-07-20 03:56:57,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333123,333136] [2022-07-20 03:56:57,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333275,333288] [2022-07-20 03:56:57,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333424,333437] [2022-07-20 03:56:57,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333572,333585] [2022-07-20 03:56:57,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333729,333742] [2022-07-20 03:56:57,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[333878,333891] [2022-07-20 03:56:57,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334034,334047] [2022-07-20 03:56:57,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334187,334200] [2022-07-20 03:56:57,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334333,334346] [2022-07-20 03:56:57,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334476,334489] [2022-07-20 03:56:57,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334628,334641] [2022-07-20 03:56:57,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334774,334787] [2022-07-20 03:56:57,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[334919,334932] [2022-07-20 03:56:57,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335073,335086] [2022-07-20 03:56:57,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335224,335237] [2022-07-20 03:56:57,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335379,335392] [2022-07-20 03:56:57,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335531,335544] [2022-07-20 03:56:57,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335686,335699] [2022-07-20 03:56:57,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[335850,335863] [2022-07-20 03:56:57,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336006,336019] [2022-07-20 03:56:57,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336170,336183] [2022-07-20 03:56:57,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336312,336325] [2022-07-20 03:56:57,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336470,336483] [2022-07-20 03:56:57,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336637,336650] [2022-07-20 03:56:57,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336796,336809] [2022-07-20 03:56:57,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[336955,336968] [2022-07-20 03:56:57,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337104,337117] [2022-07-20 03:56:57,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337251,337264] [2022-07-20 03:56:57,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337390,337403] [2022-07-20 03:56:57,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337553,337566] [2022-07-20 03:56:57,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337719,337732] [2022-07-20 03:56:57,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[337883,337896] [2022-07-20 03:56:57,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338048,338061] [2022-07-20 03:56:57,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338213,338226] [2022-07-20 03:56:57,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338379,338392] [2022-07-20 03:56:57,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338544,338557] [2022-07-20 03:56:57,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338711,338724] [2022-07-20 03:56:57,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[338871,338884] [2022-07-20 03:56:57,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339033,339046] [2022-07-20 03:56:57,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339192,339205] [2022-07-20 03:56:57,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339338,339351] [2022-07-20 03:56:57,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339481,339494] [2022-07-20 03:56:57,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339625,339638] [2022-07-20 03:56:57,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339768,339781] [2022-07-20 03:56:57,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[339912,339925] [2022-07-20 03:56:57,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340053,340066] [2022-07-20 03:56:57,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340191,340204] [2022-07-20 03:56:57,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340349,340362] [2022-07-20 03:56:57,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340508,340521] [2022-07-20 03:56:57,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340664,340677] [2022-07-20 03:56:57,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340813,340826] [2022-07-20 03:56:57,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[340965,340978] [2022-07-20 03:56:57,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341116,341129] [2022-07-20 03:56:57,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341265,341278] [2022-07-20 03:56:57,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341417,341430] [2022-07-20 03:56:57,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341565,341578] [2022-07-20 03:56:57,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341718,341731] [2022-07-20 03:56:57,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[341869,341882] [2022-07-20 03:56:57,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342019,342032] [2022-07-20 03:56:57,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342166,342179] [2022-07-20 03:56:57,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342317,342330] [2022-07-20 03:56:57,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342468,342481] [2022-07-20 03:56:57,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342616,342629] [2022-07-20 03:56:57,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342782,342795] [2022-07-20 03:56:57,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[342951,342964] [2022-07-20 03:56:57,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343118,343131] [2022-07-20 03:56:57,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343286,343299] [2022-07-20 03:56:57,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343436,343449] [2022-07-20 03:56:57,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343583,343596] [2022-07-20 03:56:57,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343744,343757] [2022-07-20 03:56:57,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[343914,343927] [2022-07-20 03:56:57,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i[344076,344089] [2022-07-20 03:56:57,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:56:58,093 INFO L208 MainTranslator]: Completed translation [2022-07-20 03:56:58,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58 WrapperNode [2022-07-20 03:56:58,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 03:56:58,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 03:56:58,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 03:56:58,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 03:56:58,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,298 INFO L137 Inliner]: procedures = 591, calls = 1808, calls flagged for inlining = 314, calls inlined = 232, statements flattened = 4571 [2022-07-20 03:56:58,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 03:56:58,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 03:56:58,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 03:56:58,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 03:56:58,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 03:56:58,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 03:56:58,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 03:56:58,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 03:56:58,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (1/1) ... [2022-07-20 03:56:58,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:56:58,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:56:58,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 03:56:58,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 03:56:58,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 03:56:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 03:56:58,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 03:56:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 03:56:58,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 03:56:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 03:56:58,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 03:56:58,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 03:56:58,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 03:56:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 03:56:58,531 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_unregister [2022-07-20 03:56:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_unregister [2022-07-20 03:56:58,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 03:56:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 03:56:58,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 03:56:58,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 03:56:58,531 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_get_drvdata [2022-07-20 03:56:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_get_drvdata [2022-07-20 03:56:58,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 03:56:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 03:56:58,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 03:56:58,532 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_poll [2022-07-20 03:56:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_poll [2022-07-20 03:56:58,532 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_put_noidle [2022-07-20 03:56:58,532 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_put_noidle [2022-07-20 03:56:58,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 03:56:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 03:56:58,533 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-20 03:56:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-20 03:56:58,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 03:56:58,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 03:56:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 03:56:58,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 03:56:58,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 03:56:58,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 03:56:58,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 03:56:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 03:56:58,534 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2022-07-20 03:56:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2022-07-20 03:56:58,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 03:56:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 03:56:58,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-20 03:56:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-20 03:56:58,535 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_resume [2022-07-20 03:56:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_resume [2022-07-20 03:56:58,535 INFO L130 BoogieDeclarations]: Found specification of procedure iio_priv [2022-07-20 03:56:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_priv [2022-07-20 03:56:58,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 03:56:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 03:56:58,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 03:56:58,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 03:56:58,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 03:56:58,535 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_acc_reg [2022-07-20 03:56:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_acc_reg [2022-07-20 03:56:58,536 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_get_mode [2022-07-20 03:56:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_get_mode [2022-07-20 03:56:58,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 03:56:58,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 03:56:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 03:56:58,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 03:56:58,536 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 03:56:58,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 03:56:58,536 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 03:56:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 03:56:58,537 INFO L130 BoogieDeclarations]: Found specification of procedure iio_push_event [2022-07-20 03:56:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_push_event [2022-07-20 03:56:58,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 03:56:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 03:56:58,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2022-07-20 03:56:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2022-07-20 03:56:58,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2022-07-20 03:56:58,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_kxcjk1013_data [2022-07-20 03:56:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 03:56:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 03:56:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2022-07-20 03:56:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_trig_try_reen [2022-07-20 03:56:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_trig_try_reen [2022-07-20 03:56:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 03:56:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 03:56:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_remove [2022-07-20 03:56:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_remove [2022-07-20 03:56:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-20 03:56:58,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-20 03:56:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_range [2022-07-20 03:56:58,539 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_range [2022-07-20 03:56:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 03:56:58,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 03:56:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 03:56:58,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 03:56:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 03:56:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_register [2022-07-20 03:56:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_register [2022-07-20 03:56:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 03:56:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 03:56:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2022-07-20 03:56:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_kxcjk1013_data [2022-07-20 03:56:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_read_byte_data [2022-07-20 03:56:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_read_byte_data [2022-07-20 03:56:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 03:56:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure iio_triggered_buffer_cleanup [2022-07-20 03:56:58,541 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_triggered_buffer_cleanup [2022-07-20 03:56:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_runtime_suspend [2022-07-20 03:56:58,541 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_runtime_suspend [2022-07-20 03:56:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-20 03:56:58,541 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-20 03:56:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 03:56:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 03:56:58,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 03:56:58,541 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_power_state [2022-07-20 03:56:58,541 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_power_state [2022-07-20 03:56:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 03:56:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 03:56:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_set_drvdata [2022-07-20 03:56:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_set_drvdata [2022-07-20 03:56:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_register [2022-07-20 03:56:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_register [2022-07-20 03:56:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 03:56:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 03:56:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure __pm_runtime_set_status [2022-07-20 03:56:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __pm_runtime_set_status [2022-07-20 03:56:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 03:56:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 03:56:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 03:56:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 03:56:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_trigger_unregister [2022-07-20 03:56:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_trigger_unregister [2022-07-20 03:56:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 03:56:58,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 03:56:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure iio_device_unregister [2022-07-20 03:56:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_device_unregister [2022-07-20 03:56:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 03:56:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 03:56:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_setup_any_motion_interrupt [2022-07-20 03:56:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_setup_any_motion_interrupt [2022-07-20 03:56:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_iio_triggered_buffer_cleanup [2022-07-20 03:56:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_iio_triggered_buffer_cleanup [2022-07-20 03:56:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 03:56:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 03:56:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 03:56:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 03:56:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 03:56:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 03:56:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 03:56:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_set_mode [2022-07-20 03:56:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_set_mode [2022-07-20 03:56:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_resume [2022-07-20 03:56:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_resume [2022-07-20 03:56:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 03:56:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 03:56:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 03:56:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 03:56:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure kxcjk1013_suspend [2022-07-20 03:56:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure kxcjk1013_suspend [2022-07-20 03:56:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 03:56:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_smbus_write_byte_data [2022-07-20 03:56:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_smbus_write_byte_data [2022-07-20 03:56:59,055 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 03:56:59,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 03:56:59,140 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 03:57:11,958 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 03:57:11,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 03:57:11,978 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 03:57:11,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:57:11 BoogieIcfgContainer [2022-07-20 03:57:11,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 03:57:11,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 03:57:11,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 03:57:11,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 03:57:11,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:56:55" (1/3) ... [2022-07-20 03:57:11,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f66a655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:57:11, skipping insertion in model container [2022-07-20 03:57:11,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:56:58" (2/3) ... [2022-07-20 03:57:11,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f66a655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:57:11, skipping insertion in model container [2022-07-20 03:57:11,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:57:11" (3/3) ... [2022-07-20 03:57:11,989 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--iio--accel--kxcjk-1013.ko.cil.i [2022-07-20 03:57:11,998 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 03:57:11,999 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-07-20 03:57:12,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 03:57:12,071 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f8beb47, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12bb9838 [2022-07-20 03:57:12,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-07-20 03:57:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 1460 states, 1023 states have (on average 1.3333333333333333) internal successors, (1364), 1069 states have internal predecessors, (1364), 340 states have call successors, (340), 71 states have call predecessors, (340), 70 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2022-07-20 03:57:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 03:57:12,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:12,087 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:57:12,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:57:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash -727309348, now seen corresponding path program 1 times [2022-07-20 03:57:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:12,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612763785] [2022-07-20 03:57:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:12,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:57:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:57:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:57:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:57:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:57:12,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:12,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612763785] [2022-07-20 03:57:12,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612763785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:12,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:12,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264276616] [2022-07-20 03:57:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:12,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:12,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:12,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:12,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:12,743 INFO L87 Difference]: Start difference. First operand has 1460 states, 1023 states have (on average 1.3333333333333333) internal successors, (1364), 1069 states have internal predecessors, (1364), 340 states have call successors, (340), 71 states have call predecessors, (340), 70 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 03:57:14,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:16,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:20,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:20,692 INFO L93 Difference]: Finished difference Result 2884 states and 4163 transitions. [2022-07-20 03:57:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-20 03:57:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:20,723 INFO L225 Difference]: With dead ends: 2884 [2022-07-20 03:57:20,723 INFO L226 Difference]: Without dead ends: 1436 [2022-07-20 03:57:20,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:20,740 INFO L413 NwaCegarLoop]: 1815 mSDtfsCounter, 2973 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 1235 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3160 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 3002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1235 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:20,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3160 Valid, 3587 Invalid, 3002 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1235 Valid, 1765 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-07-20 03:57:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2022-07-20 03:57:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2022-07-20 03:57:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1008 states have (on average 1.2599206349206349) internal successors, (1270), 1048 states have internal predecessors, (1270), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:57:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1936 transitions. [2022-07-20 03:57:20,860 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1936 transitions. Word has length 64 [2022-07-20 03:57:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:20,862 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 1936 transitions. [2022-07-20 03:57:20,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 03:57:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1936 transitions. [2022-07-20 03:57:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 03:57:20,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:20,865 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:57:20,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 03:57:20,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:57:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1915016473, now seen corresponding path program 1 times [2022-07-20 03:57:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:20,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881359996] [2022-07-20 03:57:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:57:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:57:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:57:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:57:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:57:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:57:21,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:21,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881359996] [2022-07-20 03:57:21,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881359996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:21,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:21,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:21,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763028717] [2022-07-20 03:57:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:21,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:21,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:21,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:21,271 INFO L87 Difference]: Start difference. First operand 1436 states and 1936 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 03:57:23,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:25,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:29,186 INFO L93 Difference]: Finished difference Result 1436 states and 1936 transitions. [2022-07-20 03:57:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:29,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-20 03:57:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:29,195 INFO L225 Difference]: With dead ends: 1436 [2022-07-20 03:57:29,199 INFO L226 Difference]: Without dead ends: 1434 [2022-07-20 03:57:29,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:29,203 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 2936 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3120 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:29,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3120 Valid, 3545 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1749 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-07-20 03:57:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2022-07-20 03:57:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2022-07-20 03:57:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1007 states have (on average 1.259185700099305) internal successors, (1268), 1046 states have internal predecessors, (1268), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:57:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1934 transitions. [2022-07-20 03:57:29,288 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1934 transitions. Word has length 70 [2022-07-20 03:57:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:29,290 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1934 transitions. [2022-07-20 03:57:29,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 03:57:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1934 transitions. [2022-07-20 03:57:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 03:57:29,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:29,299 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:57:29,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 03:57:29,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:57:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash 154427305, now seen corresponding path program 1 times [2022-07-20 03:57:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:29,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888903596] [2022-07-20 03:57:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:29,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:57:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:57:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:57:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:57:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:57:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:57:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:57:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:29,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888903596] [2022-07-20 03:57:29,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888903596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:29,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:29,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410924266] [2022-07-20 03:57:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:29,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:29,768 INFO L87 Difference]: Start difference. First operand 1434 states and 1934 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 03:57:31,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:33,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:37,119 INFO L93 Difference]: Finished difference Result 1434 states and 1934 transitions. [2022-07-20 03:57:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:37,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-20 03:57:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:37,129 INFO L225 Difference]: With dead ends: 1434 [2022-07-20 03:57:37,129 INFO L226 Difference]: Without dead ends: 1432 [2022-07-20 03:57:37,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:37,131 INFO L413 NwaCegarLoop]: 1791 mSDtfsCounter, 2930 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3113 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:37,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 3543 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1747 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-20 03:57:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-07-20 03:57:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2022-07-20 03:57:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1006 states have (on average 1.2584493041749503) internal successors, (1266), 1044 states have internal predecessors, (1266), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:57:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1932 transitions. [2022-07-20 03:57:37,189 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1932 transitions. Word has length 76 [2022-07-20 03:57:37,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:37,191 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1932 transitions. [2022-07-20 03:57:37,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 03:57:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1932 transitions. [2022-07-20 03:57:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 03:57:37,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:37,194 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:57:37,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 03:57:37,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:57:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash 400513827, now seen corresponding path program 1 times [2022-07-20 03:57:37,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:37,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915695668] [2022-07-20 03:57:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:37,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:57:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:57:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:57:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:57:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:57:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:57:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:57:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:57:37,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:37,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915695668] [2022-07-20 03:57:37,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915695668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:37,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:37,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489289733] [2022-07-20 03:57:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:37,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:37,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:37,592 INFO L87 Difference]: Start difference. First operand 1432 states and 1932 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 03:57:39,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:41,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:44,280 INFO L93 Difference]: Finished difference Result 1432 states and 1932 transitions. [2022-07-20 03:57:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-20 03:57:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:44,291 INFO L225 Difference]: With dead ends: 1432 [2022-07-20 03:57:44,291 INFO L226 Difference]: Without dead ends: 1430 [2022-07-20 03:57:44,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:44,295 INFO L413 NwaCegarLoop]: 1789 mSDtfsCounter, 2924 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3106 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:44,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3106 Valid, 3541 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1745 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-20 03:57:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2022-07-20 03:57:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2022-07-20 03:57:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1005 states have (on average 1.2577114427860696) internal successors, (1264), 1042 states have internal predecessors, (1264), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:57:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1930 transitions. [2022-07-20 03:57:44,356 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1930 transitions. Word has length 82 [2022-07-20 03:57:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:44,357 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1930 transitions. [2022-07-20 03:57:44,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 03:57:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1930 transitions. [2022-07-20 03:57:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 03:57:44,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:44,359 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:57:44,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 03:57:44,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:57:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1771881735, now seen corresponding path program 1 times [2022-07-20 03:57:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:44,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695188812] [2022-07-20 03:57:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:44,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:57:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:57:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:57:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:57:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:57:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:57:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:57:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:57:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:57:44,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:44,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695188812] [2022-07-20 03:57:44,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695188812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:44,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:44,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:44,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333628942] [2022-07-20 03:57:44,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:44,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:44,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:44,655 INFO L87 Difference]: Start difference. First operand 1430 states and 1930 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 03:57:46,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:48,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:51,338 INFO L93 Difference]: Finished difference Result 1430 states and 1930 transitions. [2022-07-20 03:57:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-20 03:57:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:51,344 INFO L225 Difference]: With dead ends: 1430 [2022-07-20 03:57:51,344 INFO L226 Difference]: Without dead ends: 1428 [2022-07-20 03:57:51,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:51,345 INFO L413 NwaCegarLoop]: 1787 mSDtfsCounter, 2918 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:51,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 3539 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1743 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-20 03:57:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2022-07-20 03:57:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2022-07-20 03:57:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1004 states have (on average 1.2569721115537849) internal successors, (1262), 1040 states have internal predecessors, (1262), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:57:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1928 transitions. [2022-07-20 03:57:51,385 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1928 transitions. Word has length 88 [2022-07-20 03:57:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:51,386 INFO L495 AbstractCegarLoop]: Abstraction has 1428 states and 1928 transitions. [2022-07-20 03:57:51,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 03:57:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1928 transitions. [2022-07-20 03:57:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 03:57:51,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:51,392 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:57:51,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 03:57:51,393 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:57:51,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 408227580, now seen corresponding path program 1 times [2022-07-20 03:57:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:51,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575302877] [2022-07-20 03:57:51,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:57:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:57:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:57:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:57:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:57:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:57:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:57:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:57:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:57:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:57:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:51,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575302877] [2022-07-20 03:57:51,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575302877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:51,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:51,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:51,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159811041] [2022-07-20 03:57:51,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:51,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:51,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:51,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:51,638 INFO L87 Difference]: Start difference. First operand 1428 states and 1928 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 03:57:53,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:55,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:58,619 INFO L93 Difference]: Finished difference Result 1428 states and 1928 transitions. [2022-07-20 03:57:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:58,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-20 03:57:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:58,625 INFO L225 Difference]: With dead ends: 1428 [2022-07-20 03:57:58,626 INFO L226 Difference]: Without dead ends: 1426 [2022-07-20 03:57:58,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:58,627 INFO L413 NwaCegarLoop]: 1785 mSDtfsCounter, 2912 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:58,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3092 Valid, 3537 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1741 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-20 03:57:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2022-07-20 03:57:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2022-07-20 03:57:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1003 states have (on average 1.2562313060817547) internal successors, (1260), 1038 states have internal predecessors, (1260), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:57:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1926 transitions. [2022-07-20 03:57:58,680 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1926 transitions. Word has length 94 [2022-07-20 03:57:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:58,681 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 1926 transitions. [2022-07-20 03:57:58,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 03:57:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1926 transitions. [2022-07-20 03:57:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-20 03:57:58,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:58,682 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:57:58,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 03:57:58,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:57:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1237999984, now seen corresponding path program 1 times [2022-07-20 03:57:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:58,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948003264] [2022-07-20 03:57:58,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:57:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:57:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:57:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:57:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:57:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:57:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:57:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:57:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:57:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:57:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:57:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:58,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948003264] [2022-07-20 03:57:58,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948003264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:58,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:58,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923907794] [2022-07-20 03:57:58,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:58,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:58,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:58,984 INFO L87 Difference]: Start difference. First operand 1426 states and 1926 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 03:58:01,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:03,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:05,759 INFO L93 Difference]: Finished difference Result 1426 states and 1926 transitions. [2022-07-20 03:58:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:05,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-20 03:58:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:05,765 INFO L225 Difference]: With dead ends: 1426 [2022-07-20 03:58:05,765 INFO L226 Difference]: Without dead ends: 1424 [2022-07-20 03:58:05,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:05,767 INFO L413 NwaCegarLoop]: 1783 mSDtfsCounter, 2906 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3085 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:05,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3085 Valid, 3535 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1739 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-20 03:58:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-07-20 03:58:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2022-07-20 03:58:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1002 states have (on average 1.255489021956088) internal successors, (1258), 1036 states have internal predecessors, (1258), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:58:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1924 transitions. [2022-07-20 03:58:05,809 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1924 transitions. Word has length 100 [2022-07-20 03:58:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:05,810 INFO L495 AbstractCegarLoop]: Abstraction has 1424 states and 1924 transitions. [2022-07-20 03:58:05,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 03:58:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1924 transitions. [2022-07-20 03:58:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 03:58:05,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:05,812 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:58:05,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 03:58:05,812 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:58:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1395575479, now seen corresponding path program 1 times [2022-07-20 03:58:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:05,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087324221] [2022-07-20 03:58:05,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:58:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:58:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:58:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:58:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:58:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:58:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:58:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:58:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:58:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:58:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:58:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:58:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:58:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:58:06,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:06,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087324221] [2022-07-20 03:58:06,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087324221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:06,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:06,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:06,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599864674] [2022-07-20 03:58:06,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:06,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:06,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:06,212 INFO L87 Difference]: Start difference. First operand 1424 states and 1924 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 03:58:08,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:10,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:13,270 INFO L93 Difference]: Finished difference Result 1424 states and 1924 transitions. [2022-07-20 03:58:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-20 03:58:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:13,276 INFO L225 Difference]: With dead ends: 1424 [2022-07-20 03:58:13,276 INFO L226 Difference]: Without dead ends: 1422 [2022-07-20 03:58:13,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:13,277 INFO L413 NwaCegarLoop]: 1781 mSDtfsCounter, 2904 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3082 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:13,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3082 Valid, 3533 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1733 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-20 03:58:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-07-20 03:58:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2022-07-20 03:58:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1001 states have (on average 1.2547452547452547) internal successors, (1256), 1034 states have internal predecessors, (1256), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:58:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1922 transitions. [2022-07-20 03:58:13,322 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1922 transitions. Word has length 106 [2022-07-20 03:58:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:13,323 INFO L495 AbstractCegarLoop]: Abstraction has 1422 states and 1922 transitions. [2022-07-20 03:58:13,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 03:58:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1922 transitions. [2022-07-20 03:58:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 03:58:13,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:13,324 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:58:13,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 03:58:13,325 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:58:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:13,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1118375354, now seen corresponding path program 1 times [2022-07-20 03:58:13,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:13,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49555086] [2022-07-20 03:58:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:58:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:58:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:58:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:58:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:58:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:58:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:58:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:58:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:58:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:58:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:58:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:58:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:58:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:58:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:13,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49555086] [2022-07-20 03:58:13,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49555086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:13,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:13,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391369362] [2022-07-20 03:58:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:13,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:13,626 INFO L87 Difference]: Start difference. First operand 1422 states and 1922 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 03:58:15,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:17,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:20,215 INFO L93 Difference]: Finished difference Result 1422 states and 1922 transitions. [2022-07-20 03:58:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-20 03:58:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:20,221 INFO L225 Difference]: With dead ends: 1422 [2022-07-20 03:58:20,222 INFO L226 Difference]: Without dead ends: 1420 [2022-07-20 03:58:20,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:20,224 INFO L413 NwaCegarLoop]: 1779 mSDtfsCounter, 2892 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3070 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:20,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3070 Valid, 3531 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1735 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-20 03:58:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-07-20 03:58:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2022-07-20 03:58:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1000 states have (on average 1.254) internal successors, (1254), 1032 states have internal predecessors, (1254), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:58:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1920 transitions. [2022-07-20 03:58:20,275 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1920 transitions. Word has length 108 [2022-07-20 03:58:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:20,276 INFO L495 AbstractCegarLoop]: Abstraction has 1420 states and 1920 transitions. [2022-07-20 03:58:20,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 03:58:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1920 transitions. [2022-07-20 03:58:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 03:58:20,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:20,279 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:58:20,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 03:58:20,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:58:20,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1557431567, now seen corresponding path program 1 times [2022-07-20 03:58:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:20,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607084215] [2022-07-20 03:58:20,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:58:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:58:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:58:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:58:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:58:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:58:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:58:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:58:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:58:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:58:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 03:58:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 03:58:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-20 03:58:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:20,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607084215] [2022-07-20 03:58:20,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607084215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:20,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:20,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976168908] [2022-07-20 03:58:20,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:20,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:20,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:20,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:20,603 INFO L87 Difference]: Start difference. First operand 1420 states and 1920 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 03:58:22,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:24,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:26,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:29,301 INFO L93 Difference]: Finished difference Result 2026 states and 2650 transitions. [2022-07-20 03:58:29,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 03:58:29,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2022-07-20 03:58:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:29,327 INFO L225 Difference]: With dead ends: 2026 [2022-07-20 03:58:29,328 INFO L226 Difference]: Without dead ends: 1420 [2022-07-20 03:58:29,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 03:58:29,348 INFO L413 NwaCegarLoop]: 1578 mSDtfsCounter, 3266 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 1625 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3461 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1625 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:29,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3461 Valid, 3092 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1625 Valid, 1393 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2022-07-20 03:58:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-07-20 03:58:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1416. [2022-07-20 03:58:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 997 states have (on average 1.2527582748244734) internal successors, (1249), 1028 states have internal predecessors, (1249), 334 states have call successors, (334), 70 states have call predecessors, (334), 69 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-20 03:58:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1915 transitions. [2022-07-20 03:58:29,436 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1915 transitions. Word has length 129 [2022-07-20 03:58:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:29,437 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 1915 transitions. [2022-07-20 03:58:29,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 03:58:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1915 transitions. [2022-07-20 03:58:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 03:58:29,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:29,445 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:58:29,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 03:58:29,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 24 more)] === [2022-07-20 03:58:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 382673920, now seen corresponding path program 1 times [2022-07-20 03:58:29,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:29,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216297950] [2022-07-20 03:58:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:58:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:58:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:58:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:58:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:58:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:58:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:58:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:58:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:58:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:58:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:58:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:58:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:58:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:58:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:58:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:29,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216297950] [2022-07-20 03:58:29,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216297950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:29,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:29,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:29,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013299734] [2022-07-20 03:58:29,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:29,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:29,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:29,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:29,679 INFO L87 Difference]: Start difference. First operand 1416 states and 1915 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 03:58:31,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:33,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:40,377 INFO L93 Difference]: Finished difference Result 2811 states and 3799 transitions. [2022-07-20 03:58:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 03:58:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-20 03:58:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:40,411 INFO L225 Difference]: With dead ends: 2811 [2022-07-20 03:58:40,411 INFO L226 Difference]: Without dead ends: 2809 [2022-07-20 03:58:40,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-20 03:58:40,414 INFO L413 NwaCegarLoop]: 2522 mSDtfsCounter, 3566 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 4240 mSolverCounterSat, 1939 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3743 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 6181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 4240 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:40,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3743 Valid, 5171 Invalid, 6181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 4240 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2022-07-20 03:58:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-07-20 03:58:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2705. [2022-07-20 03:58:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 1923 states have (on average 1.2553302132085284) internal successors, (2414), 1970 states have internal predecessors, (2414), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-20 03:58:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3688 transitions. [2022-07-20 03:58:40,515 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3688 transitions. Word has length 114 [2022-07-20 03:58:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:40,517 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 3688 transitions. [2022-07-20 03:58:40,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 03:58:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3688 transitions. [2022-07-20 03:58:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-20 03:58:40,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:40,519 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:58:40,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 03:58:40,520 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:58:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 13417120, now seen corresponding path program 1 times [2022-07-20 03:58:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:40,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859187371] [2022-07-20 03:58:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:58:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:58:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:58:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:58:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:58:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:58:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:58:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:58:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:58:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:58:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 03:58:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 03:58:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-20 03:58:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-20 03:58:40,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:40,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859187371] [2022-07-20 03:58:40,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859187371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:58:40,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841069517] [2022-07-20 03:58:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:58:40,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:58:40,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 03:58:40,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 03:58:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:41,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 03:58:41,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:58:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-20 03:58:41,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 03:58:41,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841069517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:41,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 03:58:41,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-20 03:58:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160342354] [2022-07-20 03:58:41,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:41,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 03:58:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 03:58:41,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:41,919 INFO L87 Difference]: Start difference. First operand 2705 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 03:58:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:42,059 INFO L93 Difference]: Finished difference Result 3810 states and 5034 transitions. [2022-07-20 03:58:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 03:58:42,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 135 [2022-07-20 03:58:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:42,070 INFO L225 Difference]: With dead ends: 3810 [2022-07-20 03:58:42,071 INFO L226 Difference]: Without dead ends: 2699 [2022-07-20 03:58:42,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:42,075 INFO L413 NwaCegarLoop]: 1909 mSDtfsCounter, 1895 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1909 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 [2022-07-20 03:58:42,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1909 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 03:58:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-07-20 03:58:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2699. [2022-07-20 03:58:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 1918 states have (on average 1.253910323253389) internal successors, (2405), 1964 states have internal predecessors, (2405), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-20 03:58:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3679 transitions. [2022-07-20 03:58:42,197 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3679 transitions. Word has length 135 [2022-07-20 03:58:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:42,198 INFO L495 AbstractCegarLoop]: Abstraction has 2699 states and 3679 transitions. [2022-07-20 03:58:42,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 03:58:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3679 transitions. [2022-07-20 03:58:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 03:58:42,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:42,200 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:58:42,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 03:58:42,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-20 03:58:42,423 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:58:42,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1128396839, now seen corresponding path program 1 times [2022-07-20 03:58:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:42,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697364094] [2022-07-20 03:58:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:42,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:58:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:58:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:58:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:58:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:58:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:58:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:58:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:58:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:58:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:58:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:58:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:58:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:58:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:58:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:58:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:58:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:42,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697364094] [2022-07-20 03:58:42,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697364094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:42,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:42,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326301475] [2022-07-20 03:58:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:42,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:42,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:42,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:42,689 INFO L87 Difference]: Start difference. First operand 2699 states and 3679 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 03:58:44,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:46,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:49,793 INFO L93 Difference]: Finished difference Result 2699 states and 3679 transitions. [2022-07-20 03:58:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:49,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-20 03:58:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:49,804 INFO L225 Difference]: With dead ends: 2699 [2022-07-20 03:58:49,804 INFO L226 Difference]: Without dead ends: 2697 [2022-07-20 03:58:49,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:49,806 INFO L413 NwaCegarLoop]: 1767 mSDtfsCounter, 2878 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:49,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3054 Valid, 3491 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1731 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-20 03:58:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2022-07-20 03:58:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2697. [2022-07-20 03:58:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 1917 states have (on average 1.2535211267605635) internal successors, (2403), 1962 states have internal predecessors, (2403), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-20 03:58:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3677 transitions. [2022-07-20 03:58:49,903 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3677 transitions. Word has length 120 [2022-07-20 03:58:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:49,903 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 3677 transitions. [2022-07-20 03:58:49,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 03:58:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3677 transitions. [2022-07-20 03:58:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 03:58:49,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:49,905 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:58:49,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 03:58:49,906 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:58:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:49,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1109898579, now seen corresponding path program 1 times [2022-07-20 03:58:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:49,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279730180] [2022-07-20 03:58:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:58:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:58:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:58:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:58:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:58:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:58:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:58:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:58:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:58:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:58:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:58:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:58:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:58:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:58:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:58:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:58:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:58:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:50,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279730180] [2022-07-20 03:58:50,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279730180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:50,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:50,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:58:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061057515] [2022-07-20 03:58:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:50,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:58:50,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:50,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:58:50,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:58:50,117 INFO L87 Difference]: Start difference. First operand 2697 states and 3677 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 03:58:52,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:54,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:58:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:58:57,035 INFO L93 Difference]: Finished difference Result 2697 states and 3677 transitions. [2022-07-20 03:58:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:58:57,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-20 03:58:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:58:57,045 INFO L225 Difference]: With dead ends: 2697 [2022-07-20 03:58:57,045 INFO L226 Difference]: Without dead ends: 2695 [2022-07-20 03:58:57,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:58:57,047 INFO L413 NwaCegarLoop]: 1765 mSDtfsCounter, 2872 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-20 03:58:57,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3489 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1729 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-20 03:58:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-07-20 03:58:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2695. [2022-07-20 03:58:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 1916 states have (on average 1.2531315240083507) internal successors, (2401), 1960 states have internal predecessors, (2401), 638 states have call successors, (638), 129 states have call predecessors, (638), 128 states have return successors, (636), 630 states have call predecessors, (636), 636 states have call successors, (636) [2022-07-20 03:58:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3675 transitions. [2022-07-20 03:58:57,158 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3675 transitions. Word has length 126 [2022-07-20 03:58:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:58:57,158 INFO L495 AbstractCegarLoop]: Abstraction has 2695 states and 3675 transitions. [2022-07-20 03:58:57,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 03:58:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3675 transitions. [2022-07-20 03:58:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-20 03:58:57,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:58:57,160 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:58:57,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 03:58:57,161 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:58:57,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:58:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash 138561349, now seen corresponding path program 1 times [2022-07-20 03:58:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:58:57,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816393298] [2022-07-20 03:58:57,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:58:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:58:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:58:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:58:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:58:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:58:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:58:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:58:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:58:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:58:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:58:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:58:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:58:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:58:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:58:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:58:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 03:58:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 03:58:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 03:58:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:58:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 03:58:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:58:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-20 03:58:57,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:58:57,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816393298] [2022-07-20 03:58:57,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816393298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:58:57,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:58:57,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 03:58:57,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482803672] [2022-07-20 03:58:57,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:58:57,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 03:58:57,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:58:57,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 03:58:57,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 03:58:57,460 INFO L87 Difference]: Start difference. First operand 2695 states and 3675 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 03:58:59,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:01,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:03,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:08,182 INFO L93 Difference]: Finished difference Result 2851 states and 3873 transitions. [2022-07-20 03:59:08,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 03:59:08,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2022-07-20 03:59:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:08,205 INFO L225 Difference]: With dead ends: 2851 [2022-07-20 03:59:08,205 INFO L226 Difference]: Without dead ends: 2849 [2022-07-20 03:59:08,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-20 03:59:08,208 INFO L413 NwaCegarLoop]: 1759 mSDtfsCounter, 3149 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 1574 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3297 SdHoareTripleChecker+Valid, 4701 SdHoareTripleChecker+Invalid, 5662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1574 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:08,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3297 Valid, 4701 Invalid, 5662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1574 Valid, 4085 Invalid, 3 Unknown, 0 Unchecked, 10.4s Time] [2022-07-20 03:59:08,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2022-07-20 03:59:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2841. [2022-07-20 03:59:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2037 states have (on average 1.2547864506627393) internal successors, (2556), 2080 states have internal predecessors, (2556), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 03:59:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3854 transitions. [2022-07-20 03:59:08,330 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3854 transitions. Word has length 154 [2022-07-20 03:59:08,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:08,331 INFO L495 AbstractCegarLoop]: Abstraction has 2841 states and 3854 transitions. [2022-07-20 03:59:08,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 03:59:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3854 transitions. [2022-07-20 03:59:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-20 03:59:08,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:08,333 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:59:08,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 03:59:08,333 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:59:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2002495305, now seen corresponding path program 1 times [2022-07-20 03:59:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:08,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025014821] [2022-07-20 03:59:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:59:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:59:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:59:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:59:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:59:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:59:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:59:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:59:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:59:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:59:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:59:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:59:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:59:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:59:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:59:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:59:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:59:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:59:08,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:08,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025014821] [2022-07-20 03:59:08,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025014821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:08,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:08,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:08,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415550557] [2022-07-20 03:59:08,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:08,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:08,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:08,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:08,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:08,634 INFO L87 Difference]: Start difference. First operand 2841 states and 3854 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 03:59:10,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:12,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:15,408 INFO L93 Difference]: Finished difference Result 2841 states and 3854 transitions. [2022-07-20 03:59:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:59:15,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-20 03:59:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:15,450 INFO L225 Difference]: With dead ends: 2841 [2022-07-20 03:59:15,450 INFO L226 Difference]: Without dead ends: 2839 [2022-07-20 03:59:15,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:59:15,452 INFO L413 NwaCegarLoop]: 1761 mSDtfsCounter, 2860 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:15,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 3485 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1725 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-20 03:59:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2022-07-20 03:59:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2839. [2022-07-20 03:59:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2036 states have (on average 1.2544204322200392) internal successors, (2554), 2078 states have internal predecessors, (2554), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 03:59:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3852 transitions. [2022-07-20 03:59:15,586 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3852 transitions. Word has length 132 [2022-07-20 03:59:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:15,587 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 3852 transitions. [2022-07-20 03:59:15,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 03:59:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3852 transitions. [2022-07-20 03:59:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-20 03:59:15,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:15,589 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:59:15,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 03:59:15,590 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:59:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 269312601, now seen corresponding path program 1 times [2022-07-20 03:59:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:15,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640290311] [2022-07-20 03:59:15,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:15,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:59:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:59:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:59:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:59:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:59:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:59:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:59:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:59:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:59:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:59:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:59:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:59:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:59:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:59:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:59:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:59:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:59:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 03:59:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:59:15,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:15,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640290311] [2022-07-20 03:59:15,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640290311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:15,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:15,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424692147] [2022-07-20 03:59:15,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:15,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:15,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:15,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:15,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:15,872 INFO L87 Difference]: Start difference. First operand 2839 states and 3852 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 03:59:17,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:19,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:22,444 INFO L93 Difference]: Finished difference Result 2839 states and 3852 transitions. [2022-07-20 03:59:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:59:22,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-20 03:59:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:22,452 INFO L225 Difference]: With dead ends: 2839 [2022-07-20 03:59:22,452 INFO L226 Difference]: Without dead ends: 2837 [2022-07-20 03:59:22,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:59:22,455 INFO L413 NwaCegarLoop]: 1759 mSDtfsCounter, 2854 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3027 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:22,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3027 Valid, 3483 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1723 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-20 03:59:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2022-07-20 03:59:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2837. [2022-07-20 03:59:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2837 states, 2035 states have (on average 1.2540540540540541) internal successors, (2552), 2076 states have internal predecessors, (2552), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 03:59:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 3850 transitions. [2022-07-20 03:59:22,562 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 3850 transitions. Word has length 138 [2022-07-20 03:59:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:22,562 INFO L495 AbstractCegarLoop]: Abstraction has 2837 states and 3850 transitions. [2022-07-20 03:59:22,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 03:59:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 3850 transitions. [2022-07-20 03:59:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-20 03:59:22,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:22,565 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:59:22,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 03:59:22,566 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:59:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:22,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1054392417, now seen corresponding path program 1 times [2022-07-20 03:59:22,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:22,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900616886] [2022-07-20 03:59:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:22,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:59:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:59:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:59:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:59:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:59:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:59:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:59:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:59:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:59:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:59:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:59:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:59:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:59:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:59:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:59:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:59:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:59:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 03:59:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 03:59:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:59:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900616886] [2022-07-20 03:59:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900616886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:22,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:22,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689489863] [2022-07-20 03:59:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:22,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:22,932 INFO L87 Difference]: Start difference. First operand 2837 states and 3850 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 03:59:24,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:26,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:29,729 INFO L93 Difference]: Finished difference Result 2837 states and 3850 transitions. [2022-07-20 03:59:29,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:59:29,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-20 03:59:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:29,737 INFO L225 Difference]: With dead ends: 2837 [2022-07-20 03:59:29,738 INFO L226 Difference]: Without dead ends: 2835 [2022-07-20 03:59:29,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:59:29,740 INFO L413 NwaCegarLoop]: 1757 mSDtfsCounter, 2848 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3020 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:29,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3020 Valid, 3481 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1721 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-20 03:59:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-07-20 03:59:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2835. [2022-07-20 03:59:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2034 states have (on average 1.2536873156342183) internal successors, (2550), 2074 states have internal predecessors, (2550), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 03:59:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3848 transitions. [2022-07-20 03:59:29,855 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3848 transitions. Word has length 144 [2022-07-20 03:59:29,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:29,856 INFO L495 AbstractCegarLoop]: Abstraction has 2835 states and 3848 transitions. [2022-07-20 03:59:29,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 03:59:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3848 transitions. [2022-07-20 03:59:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-20 03:59:29,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:29,859 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:59:29,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 03:59:29,859 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:59:29,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -603031875, now seen corresponding path program 1 times [2022-07-20 03:59:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:29,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287149268] [2022-07-20 03:59:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:59:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:59:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:59:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:59:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:59:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:59:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:59:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:59:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:59:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:59:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:59:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:59:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:59:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:59:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 03:59:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 03:59:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 03:59:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 03:59:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 03:59:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 03:59:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-20 03:59:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:30,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287149268] [2022-07-20 03:59:30,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287149268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:30,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:30,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 03:59:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857051934] [2022-07-20 03:59:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:30,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 03:59:30,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:30,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 03:59:30,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:59:30,347 INFO L87 Difference]: Start difference. First operand 2835 states and 3848 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 03:59:32,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:34,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:36,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:38,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:40,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:46,562 INFO L93 Difference]: Finished difference Result 3823 states and 5454 transitions. [2022-07-20 03:59:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 03:59:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 176 [2022-07-20 03:59:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:46,606 INFO L225 Difference]: With dead ends: 3823 [2022-07-20 03:59:46,606 INFO L226 Difference]: Without dead ends: 3821 [2022-07-20 03:59:46,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2022-07-20 03:59:46,610 INFO L413 NwaCegarLoop]: 1879 mSDtfsCounter, 4831 mSDsluCounter, 4612 mSDsCounter, 0 mSdLazyCounter, 6759 mSolverCounterSat, 3322 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4838 SdHoareTripleChecker+Valid, 6491 SdHoareTripleChecker+Invalid, 10086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3322 IncrementalHoareTripleChecker+Valid, 6759 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:46,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4838 Valid, 6491 Invalid, 10086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3322 Valid, 6759 Invalid, 5 Unknown, 0 Unchecked, 15.6s Time] [2022-07-20 03:59:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2022-07-20 03:59:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 2833. [2022-07-20 03:59:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2833 states, 2033 states have (on average 1.2528283325135268) internal successors, (2547), 2072 states have internal predecessors, (2547), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 03:59:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 3845 transitions. [2022-07-20 03:59:46,761 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 3845 transitions. Word has length 176 [2022-07-20 03:59:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:46,761 INFO L495 AbstractCegarLoop]: Abstraction has 2833 states and 3845 transitions. [2022-07-20 03:59:46,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (29), 8 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 03:59:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3845 transitions. [2022-07-20 03:59:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-20 03:59:46,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:46,764 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:59:46,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 03:59:46,765 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:59:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1136288553, now seen corresponding path program 1 times [2022-07-20 03:59:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:46,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607452893] [2022-07-20 03:59:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:59:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:59:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:59:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:59:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:59:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:59:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:59:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:59:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:59:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:59:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:59:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:59:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:59:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:59:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:59:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:59:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:59:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 03:59:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 03:59:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 03:59:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:59:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607452893] [2022-07-20 03:59:47,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607452893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:47,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:47,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:47,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799682239] [2022-07-20 03:59:47,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:47,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:47,075 INFO L87 Difference]: Start difference. First operand 2833 states and 3845 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 03:59:49,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:51,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:59:53,539 INFO L93 Difference]: Finished difference Result 2833 states and 3845 transitions. [2022-07-20 03:59:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:59:53,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-20 03:59:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:59:53,564 INFO L225 Difference]: With dead ends: 2833 [2022-07-20 03:59:53,564 INFO L226 Difference]: Without dead ends: 2831 [2022-07-20 03:59:53,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:59:53,568 INFO L413 NwaCegarLoop]: 1753 mSDtfsCounter, 2836 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3007 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-20 03:59:53,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3007 Valid, 3477 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1717 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-20 03:59:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-07-20 03:59:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2831. [2022-07-20 03:59:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2032 states have (on average 1.25246062992126) internal successors, (2545), 2070 states have internal predecessors, (2545), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 03:59:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3843 transitions. [2022-07-20 03:59:53,750 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3843 transitions. Word has length 150 [2022-07-20 03:59:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:59:53,750 INFO L495 AbstractCegarLoop]: Abstraction has 2831 states and 3843 transitions. [2022-07-20 03:59:53,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 03:59:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3843 transitions. [2022-07-20 03:59:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-20 03:59:53,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:59:53,754 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:59:53,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 03:59:53,754 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 03:59:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:59:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1255467933, now seen corresponding path program 1 times [2022-07-20 03:59:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:59:53,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832829714] [2022-07-20 03:59:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:59:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:59:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:59:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:59:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:59:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:59:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:59:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:59:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:59:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:59:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:59:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:59:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:59:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:59:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:59:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:59:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:59:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:59:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:59:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:59:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:59:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:59:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 03:59:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 03:59:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 03:59:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 03:59:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:59:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:59:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:59:54,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832829714] [2022-07-20 03:59:54,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832829714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:59:54,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:59:54,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:59:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443604511] [2022-07-20 03:59:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:59:54,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:59:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:59:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:59:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:59:54,054 INFO L87 Difference]: Start difference. First operand 2831 states and 3843 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-20 03:59:56,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:59:58,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:00:00,316 INFO L93 Difference]: Finished difference Result 2831 states and 3843 transitions. [2022-07-20 04:00:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:00:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-07-20 04:00:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:00:00,323 INFO L225 Difference]: With dead ends: 2831 [2022-07-20 04:00:00,324 INFO L226 Difference]: Without dead ends: 2829 [2022-07-20 04:00:00,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:00:00,325 INFO L413 NwaCegarLoop]: 1751 mSDtfsCounter, 2830 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 3475 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:00:00,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3000 Valid, 3475 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1715 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-07-20 04:00:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2022-07-20 04:00:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2829. [2022-07-20 04:00:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2031 states have (on average 1.2520925652387986) internal successors, (2543), 2068 states have internal predecessors, (2543), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 04:00:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 3841 transitions. [2022-07-20 04:00:00,508 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 3841 transitions. Word has length 156 [2022-07-20 04:00:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:00:00,508 INFO L495 AbstractCegarLoop]: Abstraction has 2829 states and 3841 transitions. [2022-07-20 04:00:00,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-20 04:00:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 3841 transitions. [2022-07-20 04:00:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-20 04:00:00,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:00:00,511 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:00:00,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:00:00,512 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 04:00:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:00:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash 511816783, now seen corresponding path program 1 times [2022-07-20 04:00:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:00:00,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315047360] [2022-07-20 04:00:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:00:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:00:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:00:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:00:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:00:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:00:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:00:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:00:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:00:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:00:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:00:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:00:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:00:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:00:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:00:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:00:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:00:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:00:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:00:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:00:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:00:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:00:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:00:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:00:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:00:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:00:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:00:00,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:00:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315047360] [2022-07-20 04:00:00,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315047360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:00:00,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:00:00,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:00:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328755455] [2022-07-20 04:00:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:00:00,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:00:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:00:00,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:00:00,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:00:00,803 INFO L87 Difference]: Start difference. First operand 2829 states and 3841 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 04:00:02,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:04,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:00:06,949 INFO L93 Difference]: Finished difference Result 2829 states and 3841 transitions. [2022-07-20 04:00:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:00:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-07-20 04:00:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:00:06,981 INFO L225 Difference]: With dead ends: 2829 [2022-07-20 04:00:06,988 INFO L226 Difference]: Without dead ends: 2827 [2022-07-20 04:00:06,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:00:06,993 INFO L413 NwaCegarLoop]: 1749 mSDtfsCounter, 2824 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:00:06,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 3473 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1713 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2022-07-20 04:00:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-07-20 04:00:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2827. [2022-07-20 04:00:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2030 states have (on average 1.2517241379310344) internal successors, (2541), 2066 states have internal predecessors, (2541), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 04:00:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3839 transitions. [2022-07-20 04:00:07,299 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3839 transitions. Word has length 162 [2022-07-20 04:00:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:00:07,300 INFO L495 AbstractCegarLoop]: Abstraction has 2827 states and 3839 transitions. [2022-07-20 04:00:07,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 04:00:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3839 transitions. [2022-07-20 04:00:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 04:00:07,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:00:07,304 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:00:07,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 04:00:07,305 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 04:00:07,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:00:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash 391898802, now seen corresponding path program 1 times [2022-07-20 04:00:07,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:00:07,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535183279] [2022-07-20 04:00:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:00:07,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:00:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:00:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:00:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:00:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:00:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:00:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:00:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:00:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:00:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:00:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:00:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:00:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:00:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:00:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:00:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:00:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:00:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:00:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:00:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:00:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:00:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:00:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:00:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:00:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:00:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:00:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:00:07,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:00:07,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535183279] [2022-07-20 04:00:07,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535183279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:00:07,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:00:07,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:00:07,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056631082] [2022-07-20 04:00:07,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:00:07,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:00:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:00:07,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:00:07,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:00:07,595 INFO L87 Difference]: Start difference. First operand 2827 states and 3839 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:00:09,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:11,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:00:14,052 INFO L93 Difference]: Finished difference Result 2827 states and 3839 transitions. [2022-07-20 04:00:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:00:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-07-20 04:00:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:00:14,068 INFO L225 Difference]: With dead ends: 2827 [2022-07-20 04:00:14,068 INFO L226 Difference]: Without dead ends: 2825 [2022-07-20 04:00:14,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:00:14,069 INFO L413 NwaCegarLoop]: 1747 mSDtfsCounter, 2818 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2986 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:00:14,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2986 Valid, 3471 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1711 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-20 04:00:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2022-07-20 04:00:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2825. [2022-07-20 04:00:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2029 states have (on average 1.2513553474618038) internal successors, (2539), 2064 states have internal predecessors, (2539), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 04:00:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3837 transitions. [2022-07-20 04:00:14,210 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3837 transitions. Word has length 168 [2022-07-20 04:00:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:00:14,210 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3837 transitions. [2022-07-20 04:00:14,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:00:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3837 transitions. [2022-07-20 04:00:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-20 04:00:14,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:00:14,213 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:00:14,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:00:14,214 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 04:00:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:00:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1664617640, now seen corresponding path program 1 times [2022-07-20 04:00:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:00:14,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227198118] [2022-07-20 04:00:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:00:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:00:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:00:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:00:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:00:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:00:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:00:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:00:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:00:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:00:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:00:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:00:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:00:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:00:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:00:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:00:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:00:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:00:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:00:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:00:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:00:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:00:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:00:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:00:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:00:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:00:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:00:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:00:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:00:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:00:14,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227198118] [2022-07-20 04:00:14,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227198118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:00:14,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:00:14,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:00:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36367053] [2022-07-20 04:00:14,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:00:14,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:00:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:00:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:00:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:00:14,464 INFO L87 Difference]: Start difference. First operand 2825 states and 3837 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 04:00:16,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:18,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:00:21,368 INFO L93 Difference]: Finished difference Result 2825 states and 3837 transitions. [2022-07-20 04:00:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:00:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2022-07-20 04:00:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:00:21,376 INFO L225 Difference]: With dead ends: 2825 [2022-07-20 04:00:21,376 INFO L226 Difference]: Without dead ends: 2823 [2022-07-20 04:00:21,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:00:21,378 INFO L413 NwaCegarLoop]: 1745 mSDtfsCounter, 2812 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2979 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:00:21,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2979 Valid, 3469 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1709 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-20 04:00:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2022-07-20 04:00:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2022-07-20 04:00:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2028 states have (on average 1.2509861932938855) internal successors, (2537), 2062 states have internal predecessors, (2537), 650 states have call successors, (650), 143 states have call predecessors, (650), 142 states have return successors, (648), 642 states have call predecessors, (648), 648 states have call successors, (648) [2022-07-20 04:00:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 3835 transitions. [2022-07-20 04:00:21,522 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 3835 transitions. Word has length 174 [2022-07-20 04:00:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:00:21,522 INFO L495 AbstractCegarLoop]: Abstraction has 2823 states and 3835 transitions. [2022-07-20 04:00:21,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 04:00:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3835 transitions. [2022-07-20 04:00:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-20 04:00:21,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:00:21,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:00:21,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:00:21,526 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 04:00:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:00:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash 633874428, now seen corresponding path program 1 times [2022-07-20 04:00:21,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:00:21,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734371755] [2022-07-20 04:00:21,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:00:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:00:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:00:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:00:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:00:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:00:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:00:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:00:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:00:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:00:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:00:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:00:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:00:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:00:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:00:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:00:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:00:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:00:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:00:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:00:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:00:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:00:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:00:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:00:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:00:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:00:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:00:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:00:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:00:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:00:21,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:00:21,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734371755] [2022-07-20 04:00:21,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734371755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:00:21,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:00:21,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:00:21,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503847784] [2022-07-20 04:00:21,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:00:21,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:00:21,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:00:21,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:00:21,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:00:21,831 INFO L87 Difference]: Start difference. First operand 2823 states and 3835 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:00:23,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:25,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:00:28,283 INFO L93 Difference]: Finished difference Result 2823 states and 3835 transitions. [2022-07-20 04:00:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:00:28,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2022-07-20 04:00:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:00:28,316 INFO L225 Difference]: With dead ends: 2823 [2022-07-20 04:00:28,316 INFO L226 Difference]: Without dead ends: 2368 [2022-07-20 04:00:28,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:00:28,335 INFO L413 NwaCegarLoop]: 1744 mSDtfsCounter, 2803 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 1222 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2969 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1222 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:00:28,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2969 Valid, 3468 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1222 Valid, 1709 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-20 04:00:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-20 04:00:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2022-07-20 04:00:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1727 states have (on average 1.267515923566879) internal successors, (2189), 1754 states have internal predecessors, (2189), 525 states have call successors, (525), 115 states have call predecessors, (525), 114 states have return successors, (523), 519 states have call predecessors, (523), 523 states have call successors, (523) [2022-07-20 04:00:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3237 transitions. [2022-07-20 04:00:28,483 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3237 transitions. Word has length 180 [2022-07-20 04:00:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:00:28,483 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3237 transitions. [2022-07-20 04:00:28,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:00:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3237 transitions. [2022-07-20 04:00:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-07-20 04:00:28,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:00:28,491 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:00:28,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:00:28,492 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 04:00:28,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:00:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1967932840, now seen corresponding path program 1 times [2022-07-20 04:00:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:00:28,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041742342] [2022-07-20 04:00:28,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:00:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:00:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:00:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:00:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:00:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:00:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:00:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:00:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:00:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:00:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:00:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:00:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:00:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 04:00:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-20 04:00:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:00:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:00:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:28,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 04:00:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 04:00:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:00:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 04:00:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 04:00:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:00:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:00:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-20 04:00:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-20 04:00:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-20 04:00:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-20 04:00:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-20 04:00:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-20 04:00:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-20 04:00:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-07-20 04:00:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-20 04:00:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-20 04:00:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-07-20 04:00:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-07-20 04:00:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-07-20 04:00:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-20 04:00:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2022-07-20 04:00:29,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:00:29,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041742342] [2022-07-20 04:00:29,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041742342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:00:29,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:00:29,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:00:29,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460808705] [2022-07-20 04:00:29,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:00:29,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:00:29,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:00:29,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:00:29,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:00:29,183 INFO L87 Difference]: Start difference. First operand 2368 states and 3237 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-20 04:00:31,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:33,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:35,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:37,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:43,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:00:46,916 INFO L93 Difference]: Finished difference Result 6092 states and 8650 transitions. [2022-07-20 04:00:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 04:00:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 340 [2022-07-20 04:00:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:00:46,934 INFO L225 Difference]: With dead ends: 6092 [2022-07-20 04:00:46,935 INFO L226 Difference]: Without dead ends: 3743 [2022-07-20 04:00:46,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-07-20 04:00:46,945 INFO L413 NwaCegarLoop]: 2563 mSDtfsCounter, 2594 mSDsluCounter, 5630 mSDsCounter, 0 mSdLazyCounter, 6633 mSolverCounterSat, 1615 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2863 SdHoareTripleChecker+Valid, 8193 SdHoareTripleChecker+Invalid, 8253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1615 IncrementalHoareTripleChecker+Valid, 6633 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:00:46,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2863 Valid, 8193 Invalid, 8253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1615 Valid, 6633 Invalid, 5 Unknown, 0 Unchecked, 17.2s Time] [2022-07-20 04:00:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2022-07-20 04:00:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 2372. [2022-07-20 04:00:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1731 states have (on average 1.266897746967071) internal successors, (2193), 1758 states have internal predecessors, (2193), 525 states have call successors, (525), 115 states have call predecessors, (525), 114 states have return successors, (523), 519 states have call predecessors, (523), 523 states have call successors, (523) [2022-07-20 04:00:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3241 transitions. [2022-07-20 04:00:47,276 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3241 transitions. Word has length 340 [2022-07-20 04:00:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:00:47,276 INFO L495 AbstractCegarLoop]: Abstraction has 2372 states and 3241 transitions. [2022-07-20 04:00:47,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-20 04:00:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3241 transitions. [2022-07-20 04:00:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2022-07-20 04:00:47,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:00:47,287 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:00:47,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 04:00:47,287 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 04:00:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:00:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1339255463, now seen corresponding path program 1 times [2022-07-20 04:00:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:00:47,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383150014] [2022-07-20 04:00:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:00:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:00:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:00:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:00:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:00:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:00:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:00:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:00:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:00:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:00:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:00:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:00:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:00:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:00:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:00:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:00:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 04:00:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 04:00:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-20 04:00:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-20 04:00:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:00:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-20 04:00:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:00:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-20 04:00:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-20 04:00:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-20 04:00:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-20 04:00:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:47,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-20 04:00:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:00:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-20 04:00:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-20 04:00:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-20 04:00:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:00:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-07-20 04:00:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-20 04:00:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-20 04:00:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-07-20 04:00:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-20 04:00:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-07-20 04:00:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-20 04:00:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-20 04:00:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-20 04:00:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2022-07-20 04:00:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-20 04:00:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2022-07-20 04:00:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-07-20 04:00:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2022-07-20 04:00:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2022-07-20 04:00:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:00:48,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383150014] [2022-07-20 04:00:48,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383150014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:00:48,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541789426] [2022-07-20 04:00:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:00:48,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:00:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:00:48,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:00:48,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 04:00:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:49,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 4891 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 04:00:49,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:00:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-07-20 04:00:49,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:00:49,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541789426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:00:49,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:00:49,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 12 [2022-07-20 04:00:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68321741] [2022-07-20 04:00:49,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:00:49,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 04:00:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:00:49,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 04:00:49,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:00:49,958 INFO L87 Difference]: Start difference. First operand 2372 states and 3241 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 3 states have call predecessors, (58), 2 states have call successors, (58) [2022-07-20 04:00:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:00:50,459 INFO L93 Difference]: Finished difference Result 5070 states and 6981 transitions. [2022-07-20 04:00:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 04:00:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 3 states have call predecessors, (58), 2 states have call successors, (58) Word has length 420 [2022-07-20 04:00:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:00:50,470 INFO L225 Difference]: With dead ends: 5070 [2022-07-20 04:00:50,470 INFO L226 Difference]: Without dead ends: 2717 [2022-07-20 04:00:50,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 548 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:00:50,480 INFO L413 NwaCegarLoop]: 2203 mSDtfsCounter, 244 mSDsluCounter, 6228 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 8431 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:00:50,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 8431 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 04:00:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2022-07-20 04:00:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2380. [2022-07-20 04:00:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 1737 states have (on average 1.2659758203799654) internal successors, (2199), 1764 states have internal predecessors, (2199), 525 states have call successors, (525), 115 states have call predecessors, (525), 116 states have return successors, (531), 521 states have call predecessors, (531), 523 states have call successors, (531) [2022-07-20 04:00:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3255 transitions. [2022-07-20 04:00:50,754 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3255 transitions. Word has length 420 [2022-07-20 04:00:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:00:50,754 INFO L495 AbstractCegarLoop]: Abstraction has 2380 states and 3255 transitions. [2022-07-20 04:00:50,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 3 states have call predecessors, (58), 2 states have call successors, (58) [2022-07-20 04:00:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3255 transitions. [2022-07-20 04:00:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2022-07-20 04:00:50,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:00:50,766 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:00:50,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 04:00:50,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-20 04:00:50,978 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2022-07-20 04:00:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:00:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash 550620124, now seen corresponding path program 1 times [2022-07-20 04:00:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:00:50,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933294896] [2022-07-20 04:00:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:00:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:00:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:00:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:00:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:00:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:00:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:00:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:00:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:00:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:00:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:00:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:00:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:00:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:00:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:00:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:00:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:00:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:00:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 04:00:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:00:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:00:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-20 04:00:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-20 04:00:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-20 04:00:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-20 04:00:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-20 04:00:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-20 04:00:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-20 04:00:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-20 04:00:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:00:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-20 04:00:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-20 04:00:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-20 04:00:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 04:00:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-07-20 04:00:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-20 04:00:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-20 04:00:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:00:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:00:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-20 04:00:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-07-20 04:00:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-07-20 04:00:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2022-07-20 04:00:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-07-20 04:00:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2022-07-20 04:00:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:00:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-07-20 04:00:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-07-20 04:00:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-07-20 04:00:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-20 04:00:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-20 04:00:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:00:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2022-07-20 04:00:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:00:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933294896] [2022-07-20 04:00:51,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933294896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:00:51,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:00:51,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 04:00:51,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189937522] [2022-07-20 04:00:51,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:00:51,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 04:00:51,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:00:51,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 04:00:51,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:00:51,747 INFO L87 Difference]: Start difference. First operand 2380 states and 3255 transitions. Second operand has 12 states, 12 states have (on average 14.25) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (54), 8 states have call predecessors, (54), 2 states have return successors, (54), 3 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-20 04:00:53,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:55,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:57,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 04:00:59,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []