./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.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 70285c15c86f57662e9c7cfb124387828d40f8fb898978032ed6716b7a4d6009 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 23:36:04,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 23:36:04,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 23:36:04,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 23:36:04,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 23:36:04,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 23:36:04,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 23:36:04,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 23:36:04,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 23:36:04,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 23:36:04,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 23:36:04,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 23:36:04,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 23:36:04,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 23:36:04,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 23:36:04,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 23:36:04,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 23:36:04,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 23:36:04,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 23:36:04,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 23:36:04,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 23:36:04,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 23:36:04,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 23:36:04,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 23:36:04,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 23:36:04,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 23:36:04,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 23:36:04,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 23:36:04,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 23:36:04,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 23:36:04,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 23:36:04,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 23:36:04,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 23:36:04,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 23:36:04,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 23:36:04,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 23:36:04,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 23:36:04,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 23:36:04,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 23:36:04,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 23:36:04,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 23:36:04,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 23:36:04,323 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 23:36:04,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 23:36:04,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 23:36:04,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 23:36:04,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 23:36:04,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 23:36:04,326 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 23:36:04,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 23:36:04,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 23:36:04,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 23:36:04,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 23:36:04,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 23:36:04,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 23:36:04,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 23:36:04,328 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 23:36:04,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 23:36:04,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 23:36:04,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 23:36:04,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 23:36:04,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 23:36:04,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 23:36:04,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 23:36:04,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 23:36:04,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 23:36:04,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 23:36:04,329 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 23:36:04,330 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 23:36:04,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 23:36:04,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 23:36:04,330 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 -> 70285c15c86f57662e9c7cfb124387828d40f8fb898978032ed6716b7a4d6009 [2021-11-05 23:36:04,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 23:36:04,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 23:36:04,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 23:36:04,616 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 23:36:04,617 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 23:36:04,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2021-11-05 23:36:04,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c47dec1/16075316419940cbaef96d9b7a564f8d/FLAG114968bef [2021-11-05 23:36:05,307 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 23:36:05,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2021-11-05 23:36:05,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c47dec1/16075316419940cbaef96d9b7a564f8d/FLAG114968bef [2021-11-05 23:36:05,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c47dec1/16075316419940cbaef96d9b7a564f8d [2021-11-05 23:36:05,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 23:36:05,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 23:36:05,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 23:36:05,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 23:36:05,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 23:36:05,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:36:05" (1/1) ... [2021-11-05 23:36:05,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266d2f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:05, skipping insertion in model container [2021-11-05 23:36:05,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:36:05" (1/1) ... [2021-11-05 23:36:05,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 23:36:05,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 23:36:09,861 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562820,562833] [2021-11-05 23:36:09,867 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562965,562978] [2021-11-05 23:36:09,868 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563111,563124] [2021-11-05 23:36:09,868 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563276,563289] [2021-11-05 23:36:09,868 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563434,563447] [2021-11-05 23:36:09,869 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563592,563605] [2021-11-05 23:36:09,870 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563750,563763] [2021-11-05 23:36:09,870 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563910,563923] [2021-11-05 23:36:09,870 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564069,564082] [2021-11-05 23:36:09,871 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564208,564221] [2021-11-05 23:36:09,871 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564350,564363] [2021-11-05 23:36:09,872 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564499,564512] [2021-11-05 23:36:09,872 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564638,564651] [2021-11-05 23:36:09,872 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564793,564806] [2021-11-05 23:36:09,873 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564953,564966] [2021-11-05 23:36:09,875 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565104,565117] [2021-11-05 23:36:09,876 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565255,565268] [2021-11-05 23:36:09,877 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565407,565420] [2021-11-05 23:36:09,877 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565556,565569] [2021-11-05 23:36:09,878 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565704,565717] [2021-11-05 23:36:09,878 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565861,565874] [2021-11-05 23:36:09,878 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566010,566023] [2021-11-05 23:36:09,878 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566166,566179] [2021-11-05 23:36:09,879 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566319,566332] [2021-11-05 23:36:09,879 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566465,566478] [2021-11-05 23:36:09,880 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566608,566621] [2021-11-05 23:36:09,881 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566760,566773] [2021-11-05 23:36:09,881 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566906,566919] [2021-11-05 23:36:09,881 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567051,567064] [2021-11-05 23:36:09,882 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567205,567218] [2021-11-05 23:36:09,883 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567356,567369] [2021-11-05 23:36:09,883 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567511,567524] [2021-11-05 23:36:09,884 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567663,567676] [2021-11-05 23:36:09,884 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567818,567831] [2021-11-05 23:36:09,884 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567982,567995] [2021-11-05 23:36:09,885 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568138,568151] [2021-11-05 23:36:09,886 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568302,568315] [2021-11-05 23:36:09,886 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568444,568457] [2021-11-05 23:36:09,887 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568602,568615] [2021-11-05 23:36:09,887 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568769,568782] [2021-11-05 23:36:09,887 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568928,568941] [2021-11-05 23:36:09,888 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569087,569100] [2021-11-05 23:36:09,888 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569236,569249] [2021-11-05 23:36:09,888 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569383,569396] [2021-11-05 23:36:09,889 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569522,569535] [2021-11-05 23:36:09,889 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569685,569698] [2021-11-05 23:36:09,889 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569851,569864] [2021-11-05 23:36:09,890 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570015,570028] [2021-11-05 23:36:09,890 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570180,570193] [2021-11-05 23:36:09,891 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570345,570358] [2021-11-05 23:36:09,891 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570511,570524] [2021-11-05 23:36:09,891 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570676,570689] [2021-11-05 23:36:09,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570843,570856] [2021-11-05 23:36:09,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571003,571016] [2021-11-05 23:36:09,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571165,571178] [2021-11-05 23:36:09,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571324,571337] [2021-11-05 23:36:09,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571470,571483] [2021-11-05 23:36:09,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571613,571626] [2021-11-05 23:36:09,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571757,571770] [2021-11-05 23:36:09,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571900,571913] [2021-11-05 23:36:09,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572044,572057] [2021-11-05 23:36:09,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572185,572198] [2021-11-05 23:36:09,895 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572323,572336] [2021-11-05 23:36:09,895 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572481,572494] [2021-11-05 23:36:09,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572640,572653] [2021-11-05 23:36:09,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572796,572809] [2021-11-05 23:36:09,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572945,572958] [2021-11-05 23:36:09,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573097,573110] [2021-11-05 23:36:09,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573248,573261] [2021-11-05 23:36:09,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573397,573410] [2021-11-05 23:36:09,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573549,573562] [2021-11-05 23:36:09,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573697,573710] [2021-11-05 23:36:09,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573850,573863] [2021-11-05 23:36:09,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574001,574014] [2021-11-05 23:36:09,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574151,574164] [2021-11-05 23:36:09,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574298,574311] [2021-11-05 23:36:09,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574449,574462] [2021-11-05 23:36:09,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574600,574613] [2021-11-05 23:36:09,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574748,574761] [2021-11-05 23:36:09,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574914,574927] [2021-11-05 23:36:09,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575083,575096] [2021-11-05 23:36:09,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575250,575263] [2021-11-05 23:36:09,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575418,575431] [2021-11-05 23:36:09,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575568,575581] [2021-11-05 23:36:09,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575715,575728] [2021-11-05 23:36:09,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575876,575889] [2021-11-05 23:36:09,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576046,576059] [2021-11-05 23:36:09,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576208,576221] [2021-11-05 23:36:09,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 23:36:09,974 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 23:36:10,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562820,562833] [2021-11-05 23:36:10,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562965,562978] [2021-11-05 23:36:10,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563111,563124] [2021-11-05 23:36:10,291 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563276,563289] [2021-11-05 23:36:10,291 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563434,563447] [2021-11-05 23:36:10,291 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563592,563605] [2021-11-05 23:36:10,292 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563750,563763] [2021-11-05 23:36:10,292 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563910,563923] [2021-11-05 23:36:10,292 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564069,564082] [2021-11-05 23:36:10,293 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564208,564221] [2021-11-05 23:36:10,293 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564350,564363] [2021-11-05 23:36:10,294 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564499,564512] [2021-11-05 23:36:10,294 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564638,564651] [2021-11-05 23:36:10,320 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564793,564806] [2021-11-05 23:36:10,320 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564953,564966] [2021-11-05 23:36:10,320 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565104,565117] [2021-11-05 23:36:10,320 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565255,565268] [2021-11-05 23:36:10,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565407,565420] [2021-11-05 23:36:10,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565556,565569] [2021-11-05 23:36:10,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565704,565717] [2021-11-05 23:36:10,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565861,565874] [2021-11-05 23:36:10,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566010,566023] [2021-11-05 23:36:10,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566166,566179] [2021-11-05 23:36:10,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566319,566332] [2021-11-05 23:36:10,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566465,566478] [2021-11-05 23:36:10,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566608,566621] [2021-11-05 23:36:10,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566760,566773] [2021-11-05 23:36:10,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566906,566919] [2021-11-05 23:36:10,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567051,567064] [2021-11-05 23:36:10,323 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567205,567218] [2021-11-05 23:36:10,323 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567356,567369] [2021-11-05 23:36:10,323 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567511,567524] [2021-11-05 23:36:10,323 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567663,567676] [2021-11-05 23:36:10,323 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567818,567831] [2021-11-05 23:36:10,324 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567982,567995] [2021-11-05 23:36:10,324 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568138,568151] [2021-11-05 23:36:10,324 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568302,568315] [2021-11-05 23:36:10,324 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568444,568457] [2021-11-05 23:36:10,324 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568602,568615] [2021-11-05 23:36:10,324 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568769,568782] [2021-11-05 23:36:10,325 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568928,568941] [2021-11-05 23:36:10,325 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569087,569100] [2021-11-05 23:36:10,325 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569236,569249] [2021-11-05 23:36:10,325 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569383,569396] [2021-11-05 23:36:10,325 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569522,569535] [2021-11-05 23:36:10,326 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569685,569698] [2021-11-05 23:36:10,326 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569851,569864] [2021-11-05 23:36:10,326 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570015,570028] [2021-11-05 23:36:10,326 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570180,570193] [2021-11-05 23:36:10,326 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570345,570358] [2021-11-05 23:36:10,326 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570511,570524] [2021-11-05 23:36:10,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570676,570689] [2021-11-05 23:36:10,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570843,570856] [2021-11-05 23:36:10,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571003,571016] [2021-11-05 23:36:10,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571165,571178] [2021-11-05 23:36:10,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571324,571337] [2021-11-05 23:36:10,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571470,571483] [2021-11-05 23:36:10,328 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571613,571626] [2021-11-05 23:36:10,328 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571757,571770] [2021-11-05 23:36:10,328 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571900,571913] [2021-11-05 23:36:10,328 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572044,572057] [2021-11-05 23:36:10,328 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572185,572198] [2021-11-05 23:36:10,329 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572323,572336] [2021-11-05 23:36:10,329 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572481,572494] [2021-11-05 23:36:10,329 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572640,572653] [2021-11-05 23:36:10,329 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572796,572809] [2021-11-05 23:36:10,329 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572945,572958] [2021-11-05 23:36:10,329 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573097,573110] [2021-11-05 23:36:10,330 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573248,573261] [2021-11-05 23:36:10,330 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573397,573410] [2021-11-05 23:36:10,330 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573549,573562] [2021-11-05 23:36:10,330 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573697,573710] [2021-11-05 23:36:10,330 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573850,573863] [2021-11-05 23:36:10,330 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574001,574014] [2021-11-05 23:36:10,331 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574151,574164] [2021-11-05 23:36:10,331 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574298,574311] [2021-11-05 23:36:10,331 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574449,574462] [2021-11-05 23:36:10,331 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574600,574613] [2021-11-05 23:36:10,331 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574748,574761] [2021-11-05 23:36:10,332 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574914,574927] [2021-11-05 23:36:10,332 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575083,575096] [2021-11-05 23:36:10,332 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575250,575263] [2021-11-05 23:36:10,332 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575418,575431] [2021-11-05 23:36:10,332 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575568,575581] [2021-11-05 23:36:10,332 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575715,575728] [2021-11-05 23:36:10,333 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575876,575889] [2021-11-05 23:36:10,333 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576046,576059] [2021-11-05 23:36:10,333 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576208,576221] [2021-11-05 23:36:10,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 23:36:10,603 INFO L208 MainTranslator]: Completed translation [2021-11-05 23:36:10,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10 WrapperNode [2021-11-05 23:36:10,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 23:36:10,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 23:36:10,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 23:36:10,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 23:36:10,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:10,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:11,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 23:36:11,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 23:36:11,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 23:36:11,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 23:36:11,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:11,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:12,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:12,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:13,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:13,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:13,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:14,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 23:36:14,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 23:36:14,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 23:36:14,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 23:36:14,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (1/1) ... [2021-11-05 23:36:14,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 23:36:14,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 23:36:14,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-05 23:36:14,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-05 23:36:14,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 23:36:14,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 23:36:14,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 23:36:14,048 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_write_posted_mbx [2021-11-05 23:36:14,048 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_write_posted_mbx [2021-11-05 23:36:14,048 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_init_hw_vf [2021-11-05 23:36:14,048 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_init_hw_vf [2021-11-05 23:36:14,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 23:36:14,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 23:36:14,048 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_ack [2021-11-05 23:36:14,049 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_ack [2021-11-05 23:36:14,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 23:36:14,049 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_rar_set_vf [2021-11-05 23:36:14,049 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_rar_set_vf [2021-11-05 23:36:14,049 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_link_vf [2021-11-05 23:36:14,049 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_link_vf [2021-11-05 23:36:14,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 23:36:14,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 23:36:14,049 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_msg [2021-11-05 23:36:14,049 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_msg [2021-11-05 23:36:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 23:36:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_reset_hw_vf [2021-11-05 23:36:14,050 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_reset_hw_vf [2021-11-05 23:36:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 23:36:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-05 23:36:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-05 23:36:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 23:36:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~s32~0 [2021-11-05 23:36:14,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~s32~0 [2021-11-05 23:36:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 23:36:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2021-11-05 23:36:14,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2021-11-05 23:36:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_posted_mbx [2021-11-05 23:36:14,051 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_posted_mbx [2021-11-05 23:36:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 23:36:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-05 23:36:35,650 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_19_returnLabel: main_#res := 0; [2021-11-05 23:36:35,651 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-05 23:36:35,652 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_pci_pci_instance_4_switch_break: call ULTIMATE.dealloc(ldv_pci_pci_instance_4_~#ldv_4_resource_pm_message~0.base, ldv_pci_pci_instance_4_~#ldv_4_resource_pm_message~0.offset);havoc ldv_pci_pci_instance_4_~#ldv_4_resource_pm_message~0.base, ldv_pci_pci_instance_4_~#ldv_4_resource_pm_message~0.offset; [2021-11-05 23:36:35,652 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L14701: #t~ret1998 := main_#res; [2021-11-05 23:36:35,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 23:36:35,711 INFO L299 CfgBuilder]: Removed 12009 assume(true) statements. [2021-11-05 23:36:35,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:36:35 BoogieIcfgContainer [2021-11-05 23:36:35,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 23:36:35,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 23:36:35,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 23:36:35,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 23:36:35,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:36:05" (1/3) ... [2021-11-05 23:36:35,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1280cff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:36:35, skipping insertion in model container [2021-11-05 23:36:35,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:36:10" (2/3) ... [2021-11-05 23:36:35,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1280cff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:36:35, skipping insertion in model container [2021-11-05 23:36:35,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:36:35" (3/3) ... [2021-11-05 23:36:35,729 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2021-11-05 23:36:35,733 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 23:36:35,733 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2021-11-05 23:36:35,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 23:36:35,807 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-05 23:36:35,808 INFO L340 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2021-11-05 23:36:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 11136 states, 10859 states have (on average 1.3357583571231237) internal successors, (14505), 11010 states have internal predecessors, (14505), 115 states have call successors, (115), 10 states have call predecessors, (115), 10 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2021-11-05 23:36:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-05 23:36:35,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:35,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:35,947 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 470222469, now seen corresponding path program 1 times [2021-11-05 23:36:35,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:35,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927359099] [2021-11-05 23:36:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:35,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:36,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:36,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927359099] [2021-11-05 23:36:36,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927359099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:36,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:36,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:36,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455599933] [2021-11-05 23:36:36,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:36,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:36,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:36,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:36,517 INFO L87 Difference]: Start difference. First operand has 11136 states, 10859 states have (on average 1.3357583571231237) internal successors, (14505), 11010 states have internal predecessors, (14505), 115 states have call successors, (115), 10 states have call predecessors, (115), 10 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:37,576 INFO L93 Difference]: Finished difference Result 33300 states and 44071 transitions. [2021-11-05 23:36:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:36:37,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-05 23:36:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:37,665 INFO L225 Difference]: With dead ends: 33300 [2021-11-05 23:36:37,665 INFO L226 Difference]: Without dead ends: 21479 [2021-11-05 23:36:37,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.20ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:37,699 INFO L933 BasicCegarLoop]: 15187 mSDtfsCounter, 14682 mSDsluCounter, 29372 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14682 SdHoareTripleChecker+Valid, 44559 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 102.57ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.89ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:37,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14682 Valid, 44559 Invalid, 40 Unknown, 0 Unchecked, 102.57ms Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 46.89ms Time] [2021-11-05 23:36:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21479 states. [2021-11-05 23:36:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21479 to 20527. [2021-11-05 23:36:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20527 states, 20125 states have (on average 1.283031055900621) internal successors, (25821), 20278 states have internal predecessors, (25821), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-05 23:36:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20527 states to 20527 states and 26281 transitions. [2021-11-05 23:36:38,212 INFO L78 Accepts]: Start accepts. Automaton has 20527 states and 26281 transitions. Word has length 26 [2021-11-05 23:36:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:38,213 INFO L470 AbstractCegarLoop]: Abstraction has 20527 states and 26281 transitions. [2021-11-05 23:36:38,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 20527 states and 26281 transitions. [2021-11-05 23:36:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-05 23:36:38,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:38,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:38,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 23:36:38,218 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash 913418217, now seen corresponding path program 1 times [2021-11-05 23:36:38,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:38,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209863339] [2021-11-05 23:36:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:38,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:38,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:38,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209863339] [2021-11-05 23:36:38,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209863339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:38,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:38,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:38,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822042480] [2021-11-05 23:36:38,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:38,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:38,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:38,601 INFO L87 Difference]: Start difference. First operand 20527 states and 26281 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:38,877 INFO L93 Difference]: Finished difference Result 20527 states and 26281 transitions. [2021-11-05 23:36:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:38,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-05 23:36:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:38,941 INFO L225 Difference]: With dead ends: 20527 [2021-11-05 23:36:38,941 INFO L226 Difference]: Without dead ends: 20523 [2021-11-05 23:36:38,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:38,957 INFO L933 BasicCegarLoop]: 13671 mSDtfsCounter, 13802 mSDsluCounter, 13521 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13802 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.87ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.14ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:38,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13802 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 30.87ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.14ms Time] [2021-11-05 23:36:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20523 states. [2021-11-05 23:36:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20523 to 20523. [2021-11-05 23:36:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20523 states, 20123 states have (on average 1.2829597972469313) internal successors, (25817), 20274 states have internal predecessors, (25817), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-05 23:36:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20523 states to 20523 states and 26277 transitions. [2021-11-05 23:36:39,406 INFO L78 Accepts]: Start accepts. Automaton has 20523 states and 26277 transitions. Word has length 28 [2021-11-05 23:36:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:39,406 INFO L470 AbstractCegarLoop]: Abstraction has 20523 states and 26277 transitions. [2021-11-05 23:36:39,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 20523 states and 26277 transitions. [2021-11-05 23:36:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-05 23:36:39,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:39,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:39,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 23:36:39,408 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr112ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1622770093, now seen corresponding path program 1 times [2021-11-05 23:36:39,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:39,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734448500] [2021-11-05 23:36:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:39,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:39,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:39,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734448500] [2021-11-05 23:36:39,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734448500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:39,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:39,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:39,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242283971] [2021-11-05 23:36:39,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:39,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:39,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:39,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:39,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:39,571 INFO L87 Difference]: Start difference. First operand 20523 states and 26277 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:40,013 INFO L93 Difference]: Finished difference Result 20523 states and 26277 transitions. [2021-11-05 23:36:40,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:40,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-05 23:36:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:40,058 INFO L225 Difference]: With dead ends: 20523 [2021-11-05 23:36:40,058 INFO L226 Difference]: Without dead ends: 20519 [2021-11-05 23:36:40,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.89ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:40,071 INFO L933 BasicCegarLoop]: 13667 mSDtfsCounter, 13788 mSDsluCounter, 13525 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13788 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 126.51ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.79ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:40,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13788 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 126.51ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.79ms Time] [2021-11-05 23:36:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20519 states. [2021-11-05 23:36:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20519 to 20519. [2021-11-05 23:36:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20519 states, 20121 states have (on average 1.2828885244272152) internal successors, (25813), 20270 states have internal predecessors, (25813), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-05 23:36:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20519 states to 20519 states and 26273 transitions. [2021-11-05 23:36:40,563 INFO L78 Accepts]: Start accepts. Automaton has 20519 states and 26273 transitions. Word has length 30 [2021-11-05 23:36:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:40,563 INFO L470 AbstractCegarLoop]: Abstraction has 20519 states and 26273 transitions. [2021-11-05 23:36:40,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20519 states and 26273 transitions. [2021-11-05 23:36:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-05 23:36:40,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:40,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:40,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 23:36:40,568 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr113ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 410123217, now seen corresponding path program 1 times [2021-11-05 23:36:40,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:40,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545062102] [2021-11-05 23:36:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:40,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:40,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:40,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545062102] [2021-11-05 23:36:40,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545062102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:40,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:40,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:40,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603255620] [2021-11-05 23:36:40,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:40,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:40,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:40,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:40,735 INFO L87 Difference]: Start difference. First operand 20519 states and 26273 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:41,163 INFO L93 Difference]: Finished difference Result 20519 states and 26273 transitions. [2021-11-05 23:36:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:41,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-05 23:36:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:41,199 INFO L225 Difference]: With dead ends: 20519 [2021-11-05 23:36:41,199 INFO L226 Difference]: Without dead ends: 20515 [2021-11-05 23:36:41,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:41,208 INFO L933 BasicCegarLoop]: 13663 mSDtfsCounter, 13774 mSDsluCounter, 13529 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13774 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 29.55ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.89ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:41,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13774 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 29.55ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.89ms Time] [2021-11-05 23:36:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20515 states. [2021-11-05 23:36:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20515 to 20515. [2021-11-05 23:36:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20515 states, 20119 states have (on average 1.2828172374372484) internal successors, (25809), 20266 states have internal predecessors, (25809), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-05 23:36:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20515 states to 20515 states and 26269 transitions. [2021-11-05 23:36:41,651 INFO L78 Accepts]: Start accepts. Automaton has 20515 states and 26269 transitions. Word has length 32 [2021-11-05 23:36:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:41,651 INFO L470 AbstractCegarLoop]: Abstraction has 20515 states and 26269 transitions. [2021-11-05 23:36:41,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 20515 states and 26269 transitions. [2021-11-05 23:36:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-05 23:36:41,654 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:41,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:41,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 23:36:41,654 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1007387051, now seen corresponding path program 1 times [2021-11-05 23:36:41,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:41,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423541051] [2021-11-05 23:36:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:41,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:41,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:41,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423541051] [2021-11-05 23:36:41,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423541051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:41,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:41,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:41,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274392605] [2021-11-05 23:36:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:41,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:41,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:41,845 INFO L87 Difference]: Start difference. First operand 20515 states and 26269 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:42,278 INFO L93 Difference]: Finished difference Result 20515 states and 26269 transitions. [2021-11-05 23:36:42,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-05 23:36:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:42,323 INFO L225 Difference]: With dead ends: 20515 [2021-11-05 23:36:42,324 INFO L226 Difference]: Without dead ends: 20511 [2021-11-05 23:36:42,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.68ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:42,334 INFO L933 BasicCegarLoop]: 13659 mSDtfsCounter, 13760 mSDsluCounter, 13533 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13760 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.98ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.09ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:42,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13760 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 25.98ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.09ms Time] [2021-11-05 23:36:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20511 states. [2021-11-05 23:36:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20511 to 20511. [2021-11-05 23:36:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20511 states, 20117 states have (on average 1.2827459362728042) internal successors, (25805), 20262 states have internal predecessors, (25805), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-05 23:36:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20511 states to 20511 states and 26265 transitions. [2021-11-05 23:36:43,051 INFO L78 Accepts]: Start accepts. Automaton has 20511 states and 26265 transitions. Word has length 34 [2021-11-05 23:36:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:43,052 INFO L470 AbstractCegarLoop]: Abstraction has 20511 states and 26265 transitions. [2021-11-05 23:36:43,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20511 states and 26265 transitions. [2021-11-05 23:36:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 23:36:43,054 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:43,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:43,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 23:36:43,055 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1730121415, now seen corresponding path program 1 times [2021-11-05 23:36:43,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:43,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060342434] [2021-11-05 23:36:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:43,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:43,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:43,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060342434] [2021-11-05 23:36:43,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060342434] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:43,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:43,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:43,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8318457] [2021-11-05 23:36:43,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:43,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:43,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:43,235 INFO L87 Difference]: Start difference. First operand 20511 states and 26265 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:43,620 INFO L93 Difference]: Finished difference Result 20511 states and 26265 transitions. [2021-11-05 23:36:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-05 23:36:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:43,656 INFO L225 Difference]: With dead ends: 20511 [2021-11-05 23:36:43,657 INFO L226 Difference]: Without dead ends: 20507 [2021-11-05 23:36:43,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.12ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:43,665 INFO L933 BasicCegarLoop]: 13655 mSDtfsCounter, 13746 mSDsluCounter, 13537 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13746 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.70ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.39ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:43,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13746 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 24.70ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.39ms Time] [2021-11-05 23:36:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20507 states. [2021-11-05 23:36:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20507 to 20507. [2021-11-05 23:36:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20507 states, 20115 states have (on average 1.2826746209296545) internal successors, (25801), 20258 states have internal predecessors, (25801), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-05 23:36:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20507 states to 20507 states and 26261 transitions. [2021-11-05 23:36:44,132 INFO L78 Accepts]: Start accepts. Automaton has 20507 states and 26261 transitions. Word has length 36 [2021-11-05 23:36:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:44,132 INFO L470 AbstractCegarLoop]: Abstraction has 20507 states and 26261 transitions. [2021-11-05 23:36:44,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 20507 states and 26261 transitions. [2021-11-05 23:36:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-05 23:36:44,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:44,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:44,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 23:36:44,134 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:44,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash -493142915, now seen corresponding path program 1 times [2021-11-05 23:36:44,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:44,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27682579] [2021-11-05 23:36:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:44,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:44,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:44,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27682579] [2021-11-05 23:36:44,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27682579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:44,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:44,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:44,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013890805] [2021-11-05 23:36:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:44,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:44,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:44,267 INFO L87 Difference]: Start difference. First operand 20507 states and 26261 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:44,597 INFO L93 Difference]: Finished difference Result 20507 states and 26261 transitions. [2021-11-05 23:36:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:44,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-05 23:36:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:44,644 INFO L225 Difference]: With dead ends: 20507 [2021-11-05 23:36:44,645 INFO L226 Difference]: Without dead ends: 20503 [2021-11-05 23:36:44,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.92ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:44,661 INFO L933 BasicCegarLoop]: 13651 mSDtfsCounter, 13732 mSDsluCounter, 13541 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13732 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.00ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.83ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:44,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13732 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 25.00ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.83ms Time] [2021-11-05 23:36:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20503 states. [2021-11-05 23:36:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20503 to 20503. [2021-11-05 23:36:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20503 states, 20113 states have (on average 1.2826032914035699) internal successors, (25797), 20254 states have internal predecessors, (25797), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-05 23:36:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20503 states to 20503 states and 26257 transitions. [2021-11-05 23:36:45,175 INFO L78 Accepts]: Start accepts. Automaton has 20503 states and 26257 transitions. Word has length 38 [2021-11-05 23:36:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:45,175 INFO L470 AbstractCegarLoop]: Abstraction has 20503 states and 26257 transitions. [2021-11-05 23:36:45,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 20503 states and 26257 transitions. [2021-11-05 23:36:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-05 23:36:45,177 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:45,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:45,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 23:36:45,177 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1462745055, now seen corresponding path program 1 times [2021-11-05 23:36:45,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:45,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761656232] [2021-11-05 23:36:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:45,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:45,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:45,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761656232] [2021-11-05 23:36:45,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761656232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:45,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:45,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:45,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349384275] [2021-11-05 23:36:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:45,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:45,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:45,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:45,360 INFO L87 Difference]: Start difference. First operand 20503 states and 26257 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:45,786 INFO L93 Difference]: Finished difference Result 20503 states and 26257 transitions. [2021-11-05 23:36:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:45,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-05 23:36:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:45,830 INFO L225 Difference]: With dead ends: 20503 [2021-11-05 23:36:45,830 INFO L226 Difference]: Without dead ends: 20499 [2021-11-05 23:36:45,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.10ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:45,842 INFO L933 BasicCegarLoop]: 13647 mSDtfsCounter, 13718 mSDsluCounter, 13545 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13718 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.42ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.73ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:45,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13718 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 27.42ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.73ms Time] [2021-11-05 23:36:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20499 states. [2021-11-05 23:36:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20499 to 20499. [2021-11-05 23:36:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20499 states, 20111 states have (on average 1.2825319476903188) internal successors, (25793), 20250 states have internal predecessors, (25793), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-05 23:36:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20499 states to 20499 states and 26253 transitions. [2021-11-05 23:36:46,329 INFO L78 Accepts]: Start accepts. Automaton has 20499 states and 26253 transitions. Word has length 40 [2021-11-05 23:36:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:46,330 INFO L470 AbstractCegarLoop]: Abstraction has 20499 states and 26253 transitions. [2021-11-05 23:36:46,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 20499 states and 26253 transitions. [2021-11-05 23:36:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-05 23:36:46,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:46,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:46,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 23:36:46,332 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash -871289391, now seen corresponding path program 1 times [2021-11-05 23:36:46,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:46,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471847621] [2021-11-05 23:36:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:46,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:46,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:46,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471847621] [2021-11-05 23:36:46,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471847621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:46,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:46,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:46,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221437315] [2021-11-05 23:36:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:46,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 23:36:46,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 23:36:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:36:46,461 INFO L87 Difference]: Start difference. First operand 20499 states and 26253 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:47,248 INFO L93 Difference]: Finished difference Result 48423 states and 62092 transitions. [2021-11-05 23:36:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 23:36:47,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-05 23:36:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:47,315 INFO L225 Difference]: With dead ends: 48423 [2021-11-05 23:36:47,315 INFO L226 Difference]: Without dead ends: 27955 [2021-11-05 23:36:47,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.44ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 23:36:47,358 INFO L933 BasicCegarLoop]: 15410 mSDtfsCounter, 13636 mSDsluCounter, 4840 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13636 SdHoareTripleChecker+Valid, 20250 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.46ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.72ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:47,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13636 Valid, 20250 Invalid, 8 Unknown, 0 Unchecked, 19.46ms Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 41.72ms Time] [2021-11-05 23:36:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27955 states. [2021-11-05 23:36:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27955 to 27867. [2021-11-05 23:36:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27867 states, 27355 states have (on average 1.285212940961433) internal successors, (35157), 27494 states have internal predecessors, (35157), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:36:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27867 states to 27867 states and 35825 transitions. [2021-11-05 23:36:48,074 INFO L78 Accepts]: Start accepts. Automaton has 27867 states and 35825 transitions. Word has length 41 [2021-11-05 23:36:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:48,074 INFO L470 AbstractCegarLoop]: Abstraction has 27867 states and 35825 transitions. [2021-11-05 23:36:48,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 27867 states and 35825 transitions. [2021-11-05 23:36:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-05 23:36:48,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:48,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:48,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 23:36:48,075 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1242499004, now seen corresponding path program 1 times [2021-11-05 23:36:48,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:48,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779464485] [2021-11-05 23:36:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:48,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:48,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:48,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779464485] [2021-11-05 23:36:48,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779464485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:48,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:48,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:48,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342626287] [2021-11-05 23:36:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:48,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:48,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:48,222 INFO L87 Difference]: Start difference. First operand 27867 states and 35825 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:48,741 INFO L93 Difference]: Finished difference Result 27867 states and 35825 transitions. [2021-11-05 23:36:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-05 23:36:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:48,809 INFO L225 Difference]: With dead ends: 27867 [2021-11-05 23:36:48,810 INFO L226 Difference]: Without dead ends: 27863 [2021-11-05 23:36:48,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.43ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:48,827 INFO L933 BasicCegarLoop]: 13643 mSDtfsCounter, 13704 mSDsluCounter, 13549 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13704 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.52ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.99ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:48,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13704 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 25.52ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 7.99ms Time] [2021-11-05 23:36:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27863 states. [2021-11-05 23:36:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27863 to 27863. [2021-11-05 23:36:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27863 states, 27353 states have (on average 1.2851606770738127) internal successors, (35153), 27490 states have internal predecessors, (35153), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:36:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27863 states to 27863 states and 35821 transitions. [2021-11-05 23:36:49,591 INFO L78 Accepts]: Start accepts. Automaton has 27863 states and 35821 transitions. Word has length 42 [2021-11-05 23:36:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:49,592 INFO L470 AbstractCegarLoop]: Abstraction has 27863 states and 35821 transitions. [2021-11-05 23:36:49,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 27863 states and 35821 transitions. [2021-11-05 23:36:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-05 23:36:49,592 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:49,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:49,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 23:36:49,593 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -39440184, now seen corresponding path program 1 times [2021-11-05 23:36:49,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:49,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678734299] [2021-11-05 23:36:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:49,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:49,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:49,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678734299] [2021-11-05 23:36:49,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678734299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:49,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:49,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:49,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878771928] [2021-11-05 23:36:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:49,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:49,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:49,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:49,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:49,738 INFO L87 Difference]: Start difference. First operand 27863 states and 35821 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:50,383 INFO L93 Difference]: Finished difference Result 27863 states and 35821 transitions. [2021-11-05 23:36:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:50,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-05 23:36:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:50,443 INFO L225 Difference]: With dead ends: 27863 [2021-11-05 23:36:50,443 INFO L226 Difference]: Without dead ends: 27859 [2021-11-05 23:36:50,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.81ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:50,459 INFO L933 BasicCegarLoop]: 13639 mSDtfsCounter, 13690 mSDsluCounter, 13553 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13690 SdHoareTripleChecker+Valid, 27192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.79ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.18ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:50,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13690 Valid, 27192 Invalid, 6 Unknown, 0 Unchecked, 23.79ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.18ms Time] [2021-11-05 23:36:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27859 states. [2021-11-05 23:36:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27859 to 27859. [2021-11-05 23:36:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27859 states, 27351 states have (on average 1.2851084055427588) internal successors, (35149), 27486 states have internal predecessors, (35149), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:36:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27859 states to 27859 states and 35817 transitions. [2021-11-05 23:36:51,205 INFO L78 Accepts]: Start accepts. Automaton has 27859 states and 35817 transitions. Word has length 44 [2021-11-05 23:36:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:51,205 INFO L470 AbstractCegarLoop]: Abstraction has 27859 states and 35817 transitions. [2021-11-05 23:36:51,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27859 states and 35817 transitions. [2021-11-05 23:36:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-05 23:36:51,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:51,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:51,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 23:36:51,206 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1753042201, now seen corresponding path program 1 times [2021-11-05 23:36:51,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:51,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482550140] [2021-11-05 23:36:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:51,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:51,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:51,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482550140] [2021-11-05 23:36:51,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482550140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:51,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:51,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 23:36:51,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110186836] [2021-11-05 23:36:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:51,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:36:51,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:36:51,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:51,330 INFO L87 Difference]: Start difference. First operand 27859 states and 35817 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:52,728 INFO L93 Difference]: Finished difference Result 55777 states and 71649 transitions. [2021-11-05 23:36:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 23:36:52,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-05 23:36:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:52,789 INFO L225 Difference]: With dead ends: 55777 [2021-11-05 23:36:52,790 INFO L226 Difference]: Without dead ends: 27949 [2021-11-05 23:36:52,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.21ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 23:36:52,845 INFO L933 BasicCegarLoop]: 15397 mSDtfsCounter, 43346 mSDsluCounter, 9577 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 486.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 43346 SdHoareTripleChecker+Valid, 24974 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.04ms SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 577.25ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:52,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43346 Valid, 24974 Invalid, 802 Unknown, 0 Unchecked, 39.04ms Time], IncrementalHoareTripleChecker [688 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 577.25ms Time] [2021-11-05 23:36:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27949 states. [2021-11-05 23:36:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27949 to 27855. [2021-11-05 23:36:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27855 states, 27348 states have (on average 1.2849934181658622) internal successors, (35142), 27482 states have internal predecessors, (35142), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:36:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27855 states to 27855 states and 35810 transitions. [2021-11-05 23:36:53,762 INFO L78 Accepts]: Start accepts. Automaton has 27855 states and 35810 transitions. Word has length 44 [2021-11-05 23:36:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:53,762 INFO L470 AbstractCegarLoop]: Abstraction has 27855 states and 35810 transitions. [2021-11-05 23:36:53,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states and 35810 transitions. [2021-11-05 23:36:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-05 23:36:53,763 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:53,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:53,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 23:36:53,763 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr120ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 753883564, now seen corresponding path program 1 times [2021-11-05 23:36:53,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:53,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054356147] [2021-11-05 23:36:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:53,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:53,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:53,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054356147] [2021-11-05 23:36:53,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054356147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:53,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:53,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:53,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431611412] [2021-11-05 23:36:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:53,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:53,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:53,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:53,894 INFO L87 Difference]: Start difference. First operand 27855 states and 35810 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:54,579 INFO L93 Difference]: Finished difference Result 27855 states and 35810 transitions. [2021-11-05 23:36:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:54,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-05 23:36:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:54,642 INFO L225 Difference]: With dead ends: 27855 [2021-11-05 23:36:54,642 INFO L226 Difference]: Without dead ends: 27851 [2021-11-05 23:36:54,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.58ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:54,659 INFO L933 BasicCegarLoop]: 13631 mSDtfsCounter, 13672 mSDsluCounter, 13553 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13672 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.10ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.34ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:54,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13672 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 21.10ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.34ms Time] [2021-11-05 23:36:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27851 states. [2021-11-05 23:36:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27851 to 27851. [2021-11-05 23:36:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27851 states, 27346 states have (on average 1.2849411248445841) internal successors, (35138), 27478 states have internal predecessors, (35138), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:36:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27851 states to 27851 states and 35806 transitions. [2021-11-05 23:36:55,522 INFO L78 Accepts]: Start accepts. Automaton has 27851 states and 35806 transitions. Word has length 46 [2021-11-05 23:36:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:55,522 INFO L470 AbstractCegarLoop]: Abstraction has 27851 states and 35806 transitions. [2021-11-05 23:36:55,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 27851 states and 35806 transitions. [2021-11-05 23:36:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-05 23:36:55,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:55,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:55,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 23:36:55,523 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr121ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1366172944, now seen corresponding path program 1 times [2021-11-05 23:36:55,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:55,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428891663] [2021-11-05 23:36:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:55,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:55,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:55,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428891663] [2021-11-05 23:36:55,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428891663] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:55,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:55,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:55,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720766294] [2021-11-05 23:36:55,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:55,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:55,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:55,753 INFO L87 Difference]: Start difference. First operand 27851 states and 35806 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:56,403 INFO L93 Difference]: Finished difference Result 27851 states and 35806 transitions. [2021-11-05 23:36:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-05 23:36:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:56,464 INFO L225 Difference]: With dead ends: 27851 [2021-11-05 23:36:56,464 INFO L226 Difference]: Without dead ends: 27847 [2021-11-05 23:36:56,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.98ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:56,481 INFO L933 BasicCegarLoop]: 13627 mSDtfsCounter, 13658 mSDsluCounter, 13557 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13658 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.28ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.31ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:56,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13658 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 23.28ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.31ms Time] [2021-11-05 23:36:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27847 states. [2021-11-05 23:36:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27847 to 27847. [2021-11-05 23:36:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27847 states, 27344 states have (on average 1.2848888238736103) internal successors, (35134), 27474 states have internal predecessors, (35134), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:36:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27847 states to 27847 states and 35802 transitions. [2021-11-05 23:36:57,452 INFO L78 Accepts]: Start accepts. Automaton has 27847 states and 35802 transitions. Word has length 48 [2021-11-05 23:36:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:57,453 INFO L470 AbstractCegarLoop]: Abstraction has 27847 states and 35802 transitions. [2021-11-05 23:36:57,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27847 states and 35802 transitions. [2021-11-05 23:36:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-05 23:36:57,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:57,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:57,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 23:36:57,454 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr122ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:57,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1368988820, now seen corresponding path program 1 times [2021-11-05 23:36:57,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:57,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298552436] [2021-11-05 23:36:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:57,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:57,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:57,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298552436] [2021-11-05 23:36:57,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298552436] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:57,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:57,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:57,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127162210] [2021-11-05 23:36:57,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:57,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:57,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:57,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:57,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:57,585 INFO L87 Difference]: Start difference. First operand 27847 states and 35802 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:36:58,532 INFO L93 Difference]: Finished difference Result 27847 states and 35802 transitions. [2021-11-05 23:36:58,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:36:58,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-05 23:36:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:36:58,588 INFO L225 Difference]: With dead ends: 27847 [2021-11-05 23:36:58,588 INFO L226 Difference]: Without dead ends: 27843 [2021-11-05 23:36:58,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.94ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:36:58,603 INFO L933 BasicCegarLoop]: 13623 mSDtfsCounter, 13644 mSDsluCounter, 13561 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13644 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.17ms IncrementalHoareTripleChecker+Time [2021-11-05 23:36:58,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13644 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 25.60ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.17ms Time] [2021-11-05 23:36:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27843 states. [2021-11-05 23:36:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27843 to 27843. [2021-11-05 23:36:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27843 states, 27342 states have (on average 1.2848365152512617) internal successors, (35130), 27470 states have internal predecessors, (35130), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:36:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27843 states to 27843 states and 35798 transitions. [2021-11-05 23:36:59,536 INFO L78 Accepts]: Start accepts. Automaton has 27843 states and 35798 transitions. Word has length 50 [2021-11-05 23:36:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:36:59,536 INFO L470 AbstractCegarLoop]: Abstraction has 27843 states and 35798 transitions. [2021-11-05 23:36:59,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:36:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27843 states and 35798 transitions. [2021-11-05 23:36:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-05 23:36:59,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:36:59,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:36:59,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 23:36:59,537 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr123ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:36:59,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:36:59,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1339459224, now seen corresponding path program 1 times [2021-11-05 23:36:59,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:36:59,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587526048] [2021-11-05 23:36:59,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:36:59,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:36:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:36:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:36:59,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:36:59,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587526048] [2021-11-05 23:36:59,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587526048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:36:59,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:36:59,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:36:59,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493358649] [2021-11-05 23:36:59,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:36:59,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:36:59,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:36:59,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:36:59,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:36:59,658 INFO L87 Difference]: Start difference. First operand 27843 states and 35798 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:00,363 INFO L93 Difference]: Finished difference Result 27843 states and 35798 transitions. [2021-11-05 23:37:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-05 23:37:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:00,413 INFO L225 Difference]: With dead ends: 27843 [2021-11-05 23:37:00,413 INFO L226 Difference]: Without dead ends: 27839 [2021-11-05 23:37:00,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.43ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:00,427 INFO L933 BasicCegarLoop]: 13619 mSDtfsCounter, 13630 mSDsluCounter, 13565 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13630 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.65ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.18ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:00,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13630 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 21.65ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.18ms Time] [2021-11-05 23:37:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27839 states. [2021-11-05 23:37:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27839 to 27839. [2021-11-05 23:37:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27839 states, 27340 states have (on average 1.2847841989758595) internal successors, (35126), 27466 states have internal predecessors, (35126), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27839 states to 27839 states and 35794 transitions. [2021-11-05 23:37:01,423 INFO L78 Accepts]: Start accepts. Automaton has 27839 states and 35794 transitions. Word has length 52 [2021-11-05 23:37:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:01,423 INFO L470 AbstractCegarLoop]: Abstraction has 27839 states and 35794 transitions. [2021-11-05 23:37:01,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27839 states and 35794 transitions. [2021-11-05 23:37:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-05 23:37:01,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:01,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:01,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 23:37:01,424 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr124ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:01,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1268678404, now seen corresponding path program 1 times [2021-11-05 23:37:01,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:01,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284371949] [2021-11-05 23:37:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:01,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:01,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:01,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284371949] [2021-11-05 23:37:01,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284371949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:01,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:01,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:37:01,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160877521] [2021-11-05 23:37:01,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:01,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:37:01,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:01,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:37:01,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:37:01,574 INFO L87 Difference]: Start difference. First operand 27839 states and 35794 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:02,473 INFO L93 Difference]: Finished difference Result 27839 states and 35794 transitions. [2021-11-05 23:37:02,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:02,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-05 23:37:02,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:02,522 INFO L225 Difference]: With dead ends: 27839 [2021-11-05 23:37:02,522 INFO L226 Difference]: Without dead ends: 27835 [2021-11-05 23:37:02,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:02,534 INFO L933 BasicCegarLoop]: 13615 mSDtfsCounter, 13616 mSDsluCounter, 13569 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13616 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.56ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.60ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:02,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13616 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 22.56ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.60ms Time] [2021-11-05 23:37:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27835 states. [2021-11-05 23:37:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27835 to 27835. [2021-11-05 23:37:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27835 states, 27338 states have (on average 1.284731875045724) internal successors, (35122), 27462 states have internal predecessors, (35122), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27835 states to 27835 states and 35790 transitions. [2021-11-05 23:37:03,637 INFO L78 Accepts]: Start accepts. Automaton has 27835 states and 35790 transitions. Word has length 54 [2021-11-05 23:37:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:03,638 INFO L470 AbstractCegarLoop]: Abstraction has 27835 states and 35790 transitions. [2021-11-05 23:37:03,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 27835 states and 35790 transitions. [2021-11-05 23:37:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-05 23:37:03,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:03,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:03,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 23:37:03,639 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr125ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:03,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 571962304, now seen corresponding path program 1 times [2021-11-05 23:37:03,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:03,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389944090] [2021-11-05 23:37:03,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:03,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:03,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:03,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389944090] [2021-11-05 23:37:03,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389944090] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:03,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:03,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:37:03,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493523217] [2021-11-05 23:37:03,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:03,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:37:03,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:37:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:37:03,814 INFO L87 Difference]: Start difference. First operand 27835 states and 35790 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:04,662 INFO L93 Difference]: Finished difference Result 27835 states and 35790 transitions. [2021-11-05 23:37:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-05 23:37:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:04,715 INFO L225 Difference]: With dead ends: 27835 [2021-11-05 23:37:04,715 INFO L226 Difference]: Without dead ends: 27831 [2021-11-05 23:37:04,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.26ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:04,731 INFO L933 BasicCegarLoop]: 13611 mSDtfsCounter, 13602 mSDsluCounter, 13573 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13602 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.71ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.55ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:04,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13602 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 23.71ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.55ms Time] [2021-11-05 23:37:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27831 states. [2021-11-05 23:37:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27831 to 27831. [2021-11-05 23:37:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27831 states, 27336 states have (on average 1.2846795434591747) internal successors, (35118), 27458 states have internal predecessors, (35118), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27831 states to 27831 states and 35786 transitions. [2021-11-05 23:37:05,763 INFO L78 Accepts]: Start accepts. Automaton has 27831 states and 35786 transitions. Word has length 56 [2021-11-05 23:37:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:05,764 INFO L470 AbstractCegarLoop]: Abstraction has 27831 states and 35786 transitions. [2021-11-05 23:37:05,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27831 states and 35786 transitions. [2021-11-05 23:37:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-05 23:37:05,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:05,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:05,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-05 23:37:05,765 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr126ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash -98842908, now seen corresponding path program 1 times [2021-11-05 23:37:05,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:05,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625417434] [2021-11-05 23:37:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:05,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:05,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:05,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625417434] [2021-11-05 23:37:05,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625417434] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:05,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:05,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:37:05,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795991134] [2021-11-05 23:37:05,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:05,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:37:05,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:05,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:37:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:37:05,902 INFO L87 Difference]: Start difference. First operand 27831 states and 35786 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:06,819 INFO L93 Difference]: Finished difference Result 27831 states and 35786 transitions. [2021-11-05 23:37:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-05 23:37:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:06,870 INFO L225 Difference]: With dead ends: 27831 [2021-11-05 23:37:06,870 INFO L226 Difference]: Without dead ends: 27827 [2021-11-05 23:37:06,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.78ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:06,886 INFO L933 BasicCegarLoop]: 13607 mSDtfsCounter, 13588 mSDsluCounter, 13577 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13588 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.46ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:06,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13588 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 22.48ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.46ms Time] [2021-11-05 23:37:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27827 states. [2021-11-05 23:37:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27827 to 27827. [2021-11-05 23:37:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27827 states, 27334 states have (on average 1.2846272042145312) internal successors, (35114), 27454 states have internal predecessors, (35114), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27827 states to 27827 states and 35782 transitions. [2021-11-05 23:37:07,994 INFO L78 Accepts]: Start accepts. Automaton has 27827 states and 35782 transitions. Word has length 58 [2021-11-05 23:37:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:07,994 INFO L470 AbstractCegarLoop]: Abstraction has 27827 states and 35782 transitions. [2021-11-05 23:37:07,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27827 states and 35782 transitions. [2021-11-05 23:37:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-05 23:37:07,995 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:07,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:07,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-05 23:37:07,995 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr127ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash -497556888, now seen corresponding path program 1 times [2021-11-05 23:37:07,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:07,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850450727] [2021-11-05 23:37:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:07,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:08,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:08,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850450727] [2021-11-05 23:37:08,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850450727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:08,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:08,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:37:08,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382142009] [2021-11-05 23:37:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:08,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:37:08,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:08,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:37:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:37:08,122 INFO L87 Difference]: Start difference. First operand 27827 states and 35782 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:09,146 INFO L93 Difference]: Finished difference Result 27827 states and 35782 transitions. [2021-11-05 23:37:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:09,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-05 23:37:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:09,196 INFO L225 Difference]: With dead ends: 27827 [2021-11-05 23:37:09,196 INFO L226 Difference]: Without dead ends: 27823 [2021-11-05 23:37:09,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:09,208 INFO L933 BasicCegarLoop]: 13603 mSDtfsCounter, 13574 mSDsluCounter, 13581 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13574 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.45ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.06ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:09,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13574 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 23.45ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.06ms Time] [2021-11-05 23:37:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27823 states. [2021-11-05 23:37:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27823 to 27823. [2021-11-05 23:37:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27823 states, 27332 states have (on average 1.2845748573101128) internal successors, (35110), 27450 states have internal predecessors, (35110), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27823 states to 27823 states and 35778 transitions. [2021-11-05 23:37:10,356 INFO L78 Accepts]: Start accepts. Automaton has 27823 states and 35778 transitions. Word has length 60 [2021-11-05 23:37:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:10,357 INFO L470 AbstractCegarLoop]: Abstraction has 27823 states and 35778 transitions. [2021-11-05 23:37:10,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27823 states and 35778 transitions. [2021-11-05 23:37:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-05 23:37:10,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:10,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:10,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-05 23:37:10,358 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr128ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1409601972, now seen corresponding path program 1 times [2021-11-05 23:37:10,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:10,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742253878] [2021-11-05 23:37:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:10,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:10,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:10,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742253878] [2021-11-05 23:37:10,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742253878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:10,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:10,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:37:10,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351657631] [2021-11-05 23:37:10,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:10,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:37:10,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:10,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:37:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:37:10,557 INFO L87 Difference]: Start difference. First operand 27823 states and 35778 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:11,456 INFO L93 Difference]: Finished difference Result 27823 states and 35778 transitions. [2021-11-05 23:37:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-05 23:37:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:11,508 INFO L225 Difference]: With dead ends: 27823 [2021-11-05 23:37:11,508 INFO L226 Difference]: Without dead ends: 27819 [2021-11-05 23:37:11,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:11,523 INFO L933 BasicCegarLoop]: 13599 mSDtfsCounter, 13560 mSDsluCounter, 13585 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13560 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.94ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.68ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:11,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13560 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 22.94ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.68ms Time] [2021-11-05 23:37:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27819 states. [2021-11-05 23:37:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27819 to 27819. [2021-11-05 23:37:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27819 states, 27330 states have (on average 1.284522502744237) internal successors, (35106), 27446 states have internal predecessors, (35106), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27819 states to 27819 states and 35774 transitions. [2021-11-05 23:37:12,643 INFO L78 Accepts]: Start accepts. Automaton has 27819 states and 35774 transitions. Word has length 62 [2021-11-05 23:37:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:12,643 INFO L470 AbstractCegarLoop]: Abstraction has 27819 states and 35774 transitions. [2021-11-05 23:37:12,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 27819 states and 35774 transitions. [2021-11-05 23:37:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-05 23:37:12,644 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:12,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:12,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-05 23:37:12,644 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr129ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1711598960, now seen corresponding path program 1 times [2021-11-05 23:37:12,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:12,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711398674] [2021-11-05 23:37:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:12,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:12,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:12,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711398674] [2021-11-05 23:37:12,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711398674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:12,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:12,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:37:12,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218609212] [2021-11-05 23:37:12,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:12,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:37:12,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:12,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:37:12,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:37:12,759 INFO L87 Difference]: Start difference. First operand 27819 states and 35774 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:13,774 INFO L93 Difference]: Finished difference Result 27819 states and 35774 transitions. [2021-11-05 23:37:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-05 23:37:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:13,823 INFO L225 Difference]: With dead ends: 27819 [2021-11-05 23:37:13,823 INFO L226 Difference]: Without dead ends: 27815 [2021-11-05 23:37:13,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:13,834 INFO L933 BasicCegarLoop]: 13595 mSDtfsCounter, 13546 mSDsluCounter, 13589 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13546 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.05ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.82ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:13,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13546 Valid, 27184 Invalid, 6 Unknown, 0 Unchecked, 22.05ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.82ms Time] [2021-11-05 23:37:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27815 states. [2021-11-05 23:37:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27815 to 27815. [2021-11-05 23:37:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27815 states, 27328 states have (on average 1.2844701405152226) internal successors, (35102), 27442 states have internal predecessors, (35102), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27815 states to 27815 states and 35770 transitions. [2021-11-05 23:37:15,000 INFO L78 Accepts]: Start accepts. Automaton has 27815 states and 35770 transitions. Word has length 64 [2021-11-05 23:37:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:15,000 INFO L470 AbstractCegarLoop]: Abstraction has 27815 states and 35770 transitions. [2021-11-05 23:37:15,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 27815 states and 35770 transitions. [2021-11-05 23:37:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-05 23:37:15,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:15,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:15,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-05 23:37:15,002 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash 127072052, now seen corresponding path program 1 times [2021-11-05 23:37:15,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:15,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721021233] [2021-11-05 23:37:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:15,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:15,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:15,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721021233] [2021-11-05 23:37:15,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721021233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:15,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:15,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 23:37:15,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865275921] [2021-11-05 23:37:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:15,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 23:37:15,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 23:37:15,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 23:37:15,120 INFO L87 Difference]: Start difference. First operand 27815 states and 35770 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:16,058 INFO L93 Difference]: Finished difference Result 27815 states and 35770 transitions. [2021-11-05 23:37:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:16,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-05 23:37:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:16,112 INFO L225 Difference]: With dead ends: 27815 [2021-11-05 23:37:16,112 INFO L226 Difference]: Without dead ends: 27693 [2021-11-05 23:37:16,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:16,127 INFO L933 BasicCegarLoop]: 13593 mSDtfsCounter, 13532 mSDsluCounter, 13593 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13532 SdHoareTripleChecker+Valid, 27186 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.87ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.48ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:16,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13532 Valid, 27186 Invalid, 4 Unknown, 0 Unchecked, 21.87ms Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 2.48ms Time] [2021-11-05 23:37:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27693 states. [2021-11-05 23:37:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27693 to 27693. [2021-11-05 23:37:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27693 states, 27208 states have (on average 1.2854675095560129) internal successors, (34975), 27320 states have internal predecessors, (34975), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27693 states to 27693 states and 35643 transitions. [2021-11-05 23:37:17,430 INFO L78 Accepts]: Start accepts. Automaton has 27693 states and 35643 transitions. Word has length 66 [2021-11-05 23:37:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:17,431 INFO L470 AbstractCegarLoop]: Abstraction has 27693 states and 35643 transitions. [2021-11-05 23:37:17,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 27693 states and 35643 transitions. [2021-11-05 23:37:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-05 23:37:17,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:17,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:17,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-05 23:37:17,432 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1379271116, now seen corresponding path program 1 times [2021-11-05 23:37:17,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:17,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117997201] [2021-11-05 23:37:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:17,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:17,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:17,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117997201] [2021-11-05 23:37:17,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117997201] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:17,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:17,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:37:17,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474238274] [2021-11-05 23:37:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:17,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:37:17,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:17,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:37:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:17,641 INFO L87 Difference]: Start difference. First operand 27693 states and 35643 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:21,443 INFO L93 Difference]: Finished difference Result 94761 states and 122109 transitions. [2021-11-05 23:37:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 23:37:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-05 23:37:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:21,566 INFO L225 Difference]: With dead ends: 94761 [2021-11-05 23:37:21,566 INFO L226 Difference]: Without dead ends: 67097 [2021-11-05 23:37:21,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 19.73ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 23:37:21,621 INFO L933 BasicCegarLoop]: 20528 mSDtfsCounter, 52114 mSDsluCounter, 31456 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 659.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 52114 SdHoareTripleChecker+Valid, 51984 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 64.58ms SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 798.06ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:21,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52114 Valid, 51984 Invalid, 1171 Unknown, 0 Unchecked, 64.58ms Time], IncrementalHoareTripleChecker [606 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 798.06ms Time] [2021-11-05 23:37:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67097 states. [2021-11-05 23:37:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67097 to 27693. [2021-11-05 23:37:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27693 states, 27208 states have (on average 1.2815715965892385) internal successors, (34869), 27320 states have internal predecessors, (34869), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27693 states to 27693 states and 35537 transitions. [2021-11-05 23:37:23,426 INFO L78 Accepts]: Start accepts. Automaton has 27693 states and 35537 transitions. Word has length 70 [2021-11-05 23:37:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:23,426 INFO L470 AbstractCegarLoop]: Abstraction has 27693 states and 35537 transitions. [2021-11-05 23:37:23,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 27693 states and 35537 transitions. [2021-11-05 23:37:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-05 23:37:23,427 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:23,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:23,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-05 23:37:23,427 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1379211534, now seen corresponding path program 1 times [2021-11-05 23:37:23,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:23,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033770759] [2021-11-05 23:37:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:23,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:23,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:23,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033770759] [2021-11-05 23:37:23,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033770759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:23,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:23,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 23:37:23,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303457141] [2021-11-05 23:37:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:23,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:37:23,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:37:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:23,582 INFO L87 Difference]: Start difference. First operand 27693 states and 35537 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:27,688 INFO L93 Difference]: Finished difference Result 51957 states and 66666 transitions. [2021-11-05 23:37:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 23:37:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-05 23:37:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:27,786 INFO L225 Difference]: With dead ends: 51957 [2021-11-05 23:37:27,786 INFO L226 Difference]: Without dead ends: 51879 [2021-11-05 23:37:27,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 41.76ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 23:37:27,812 INFO L933 BasicCegarLoop]: 24055 mSDtfsCounter, 48897 mSDsluCounter, 34607 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 653.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48897 SdHoareTripleChecker+Valid, 58662 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 66.69ms SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 809.38ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:27,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48897 Valid, 58662 Invalid, 892 Unknown, 0 Unchecked, 66.69ms Time], IncrementalHoareTripleChecker [646 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 809.38ms Time] [2021-11-05 23:37:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51879 states. [2021-11-05 23:37:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51879 to 27615. [2021-11-05 23:37:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27615 states, 27169 states have (on average 1.27807427582907) internal successors, (34724), 27242 states have internal predecessors, (34724), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27615 states to 27615 states and 35392 transitions. [2021-11-05 23:37:29,880 INFO L78 Accepts]: Start accepts. Automaton has 27615 states and 35392 transitions. Word has length 70 [2021-11-05 23:37:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:29,881 INFO L470 AbstractCegarLoop]: Abstraction has 27615 states and 35392 transitions. [2021-11-05 23:37:29,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 27615 states and 35392 transitions. [2021-11-05 23:37:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-05 23:37:29,882 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:29,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:29,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-05 23:37:29,882 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:29,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1882762452, now seen corresponding path program 1 times [2021-11-05 23:37:29,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:29,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248094878] [2021-11-05 23:37:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:29,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:30,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:30,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248094878] [2021-11-05 23:37:30,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248094878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:30,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:30,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 23:37:30,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97751460] [2021-11-05 23:37:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:30,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 23:37:30,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 23:37:30,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 23:37:30,022 INFO L87 Difference]: Start difference. First operand 27615 states and 35392 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:33,756 INFO L93 Difference]: Finished difference Result 63768 states and 81705 transitions. [2021-11-05 23:37:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 23:37:33,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-05 23:37:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:33,817 INFO L225 Difference]: With dead ends: 63768 [2021-11-05 23:37:33,817 INFO L226 Difference]: Without dead ends: 36182 [2021-11-05 23:37:33,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.26ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-05 23:37:33,862 INFO L933 BasicCegarLoop]: 19789 mSDtfsCounter, 25941 mSDsluCounter, 6903 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1112.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25941 SdHoareTripleChecker+Valid, 26692 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 34.28ms SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1256.01ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:33,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25941 Valid, 26692 Invalid, 629 Unknown, 0 Unchecked, 34.28ms Time], IncrementalHoareTripleChecker [171 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1256.01ms Time] [2021-11-05 23:37:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36182 states. [2021-11-05 23:37:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36182 to 27431. [2021-11-05 23:37:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27431 states, 27024 states have (on average 1.2717214328004736) internal successors, (34367), 27058 states have internal predecessors, (34367), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:37:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27431 states to 27431 states and 35035 transitions. [2021-11-05 23:37:36,012 INFO L78 Accepts]: Start accepts. Automaton has 27431 states and 35035 transitions. Word has length 73 [2021-11-05 23:37:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:37:36,012 INFO L470 AbstractCegarLoop]: Abstraction has 27431 states and 35035 transitions. [2021-11-05 23:37:36,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 23:37:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 27431 states and 35035 transitions. [2021-11-05 23:37:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-05 23:37:36,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:37:36,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:37:36,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-05 23:37:36,015 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:37:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:37:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1473472436, now seen corresponding path program 1 times [2021-11-05 23:37:36,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:37:36,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89353642] [2021-11-05 23:37:36,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:37:36,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:37:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-05 23:37:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:37:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:37:36,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:37:36,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89353642] [2021-11-05 23:37:36,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89353642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:37:36,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:37:36,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 23:37:36,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878238828] [2021-11-05 23:37:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:37:36,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 23:37:36,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:37:36,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 23:37:36,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 23:37:36,147 INFO L87 Difference]: Start difference. First operand 27431 states and 35035 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-05 23:37:39,831 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 23:37:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 23:37:59,737 INFO L93 Difference]: Finished difference Result 90795 states and 116484 transitions. [2021-11-05 23:37:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 23:37:59,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2021-11-05 23:37:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 23:37:59,880 INFO L225 Difference]: With dead ends: 90795 [2021-11-05 23:37:59,880 INFO L226 Difference]: Without dead ends: 63393 [2021-11-05 23:37:59,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.54ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-05 23:37:59,930 INFO L933 BasicCegarLoop]: 17461 mSDtfsCounter, 27349 mSDsluCounter, 51139 mSDsCounter, 0 mSdLazyCounter, 6493 mSolverCounterSat, 428 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16930.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 27484 SdHoareTripleChecker+Valid, 68600 SdHoareTripleChecker+Invalid, 6922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 109.78ms SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 6493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18904.95ms IncrementalHoareTripleChecker+Time [2021-11-05 23:37:59,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27484 Valid, 68600 Invalid, 6922 Unknown, 0 Unchecked, 109.78ms Time], IncrementalHoareTripleChecker [428 Valid, 6493 Invalid, 1 Unknown, 0 Unchecked, 18904.95ms Time] [2021-11-05 23:37:59,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63393 states. [2021-11-05 23:38:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63393 to 27443. [2021-11-05 23:38:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27443 states, 27036 states have (on average 1.2716008285249296) internal successors, (34379), 27070 states have internal predecessors, (34379), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-05 23:38:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27443 states to 27443 states and 35047 transitions. [2021-11-05 23:38:02,234 INFO L78 Accepts]: Start accepts. Automaton has 27443 states and 35047 transitions. Word has length 84 [2021-11-05 23:38:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 23:38:02,234 INFO L470 AbstractCegarLoop]: Abstraction has 27443 states and 35047 transitions. [2021-11-05 23:38:02,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-05 23:38:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27443 states and 35047 transitions. [2021-11-05 23:38:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 23:38:02,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 23:38:02,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 23:38:02,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-05 23:38:02,239 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-05 23:38:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 23:38:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1229041709, now seen corresponding path program 1 times [2021-11-05 23:38:02,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 23:38:02,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987267906] [2021-11-05 23:38:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 23:38:02,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 23:38:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:38:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-05 23:38:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 23:38:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 23:38:02,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 23:38:02,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987267906] [2021-11-05 23:38:02,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987267906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 23:38:02,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 23:38:02,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 23:38:02,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100149521] [2021-11-05 23:38:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 23:38:02,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 23:38:02,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 23:38:02,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 23:38:02,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-05 23:38:02,401 INFO L87 Difference]: Start difference. First operand 27443 states and 35047 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-05 23:38:05,523 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []