./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--icplus--ipg.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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--icplus--ipg.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 53e062e1035ae1f01c2e809595599fa2661e1ae14b245da0f28d018a9f398780 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 13:49:06,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 13:49:06,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 13:49:06,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 13:49:06,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 13:49:06,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 13:49:06,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 13:49:06,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 13:49:06,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 13:49:06,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 13:49:06,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 13:49:06,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 13:49:06,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 13:49:06,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 13:49:06,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 13:49:06,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 13:49:06,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 13:49:06,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 13:49:06,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 13:49:06,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 13:49:06,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 13:49:06,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 13:49:06,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 13:49:06,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 13:49:06,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 13:49:06,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 13:49:06,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 13:49:06,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 13:49:06,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 13:49:06,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 13:49:06,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 13:49:06,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 13:49:06,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 13:49:06,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 13:49:06,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 13:49:06,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 13:49:06,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 13:49:06,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 13:49:06,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 13:49:06,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 13:49:06,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 13:49:06,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 13:49:06,782 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 13:49:06,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 13:49:06,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 13:49:06,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 13:49:06,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 13:49:06,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 13:49:06,786 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 13:49:06,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 13:49:06,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 13:49:06,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 13:49:06,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 13:49:06,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 13:49:06,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 13:49:06,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 13:49:06,788 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 13:49:06,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 13:49:06,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 13:49:06,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 13:49:06,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 13:49:06,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 13:49:06,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 13:49:06,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 13:49:06,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 13:49:06,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 13:49:06,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 13:49:06,790 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 13:49:06,790 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 13:49:06,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 13:49:06,791 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 13:49:06,791 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 -> 53e062e1035ae1f01c2e809595599fa2661e1ae14b245da0f28d018a9f398780 [2021-11-04 13:49:07,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 13:49:07,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 13:49:07,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 13:49:07,048 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 13:49:07,049 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 13:49:07,050 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--icplus--ipg.ko.cil.i [2021-11-04 13:49:07,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588d33116/c9cb50a871a948cb981d8168c5b46019/FLAG0c7c22d25 [2021-11-04 13:49:07,890 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 13:49:07,891 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--icplus--ipg.ko.cil.i [2021-11-04 13:49:07,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588d33116/c9cb50a871a948cb981d8168c5b46019/FLAG0c7c22d25 [2021-11-04 13:49:08,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588d33116/c9cb50a871a948cb981d8168c5b46019 [2021-11-04 13:49:08,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 13:49:08,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 13:49:08,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 13:49:08,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 13:49:08,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 13:49:08,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:49:08" (1/1) ... [2021-11-04 13:49:08,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c05f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:08, skipping insertion in model container [2021-11-04 13:49:08,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:49:08" (1/1) ... [2021-11-04 13:49:08,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 13:49:08,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 13:49:11,345 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--icplus--ipg.ko.cil.i[393566,393579] [2021-11-04 13:49:11,347 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--icplus--ipg.ko.cil.i[393711,393724] [2021-11-04 13:49:11,347 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--icplus--ipg.ko.cil.i[393857,393870] [2021-11-04 13:49:11,348 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--icplus--ipg.ko.cil.i[394022,394035] [2021-11-04 13:49:11,348 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--icplus--ipg.ko.cil.i[394180,394193] [2021-11-04 13:49:11,348 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--icplus--ipg.ko.cil.i[394338,394351] [2021-11-04 13:49:11,349 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--icplus--ipg.ko.cil.i[394496,394509] [2021-11-04 13:49:11,349 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--icplus--ipg.ko.cil.i[394656,394669] [2021-11-04 13:49:11,350 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--icplus--ipg.ko.cil.i[394815,394828] [2021-11-04 13:49:11,350 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--icplus--ipg.ko.cil.i[394954,394967] [2021-11-04 13:49:11,350 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--icplus--ipg.ko.cil.i[395096,395109] [2021-11-04 13:49:11,351 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--icplus--ipg.ko.cil.i[395245,395258] [2021-11-04 13:49:11,351 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--icplus--ipg.ko.cil.i[395384,395397] [2021-11-04 13:49:11,352 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--icplus--ipg.ko.cil.i[395539,395552] [2021-11-04 13:49:11,352 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--icplus--ipg.ko.cil.i[395699,395712] [2021-11-04 13:49:11,352 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--icplus--ipg.ko.cil.i[395850,395863] [2021-11-04 13:49:11,353 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--icplus--ipg.ko.cil.i[396001,396014] [2021-11-04 13:49:11,353 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--icplus--ipg.ko.cil.i[396153,396166] [2021-11-04 13:49:11,353 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--icplus--ipg.ko.cil.i[396302,396315] [2021-11-04 13:49:11,354 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--icplus--ipg.ko.cil.i[396450,396463] [2021-11-04 13:49:11,354 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--icplus--ipg.ko.cil.i[396607,396620] [2021-11-04 13:49:11,355 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--icplus--ipg.ko.cil.i[396756,396769] [2021-11-04 13:49:11,355 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--icplus--ipg.ko.cil.i[396912,396925] [2021-11-04 13:49:11,355 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--icplus--ipg.ko.cil.i[397065,397078] [2021-11-04 13:49:11,356 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--icplus--ipg.ko.cil.i[397211,397224] [2021-11-04 13:49:11,358 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--icplus--ipg.ko.cil.i[397354,397367] [2021-11-04 13:49:11,359 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--icplus--ipg.ko.cil.i[397506,397519] [2021-11-04 13:49:11,359 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--icplus--ipg.ko.cil.i[397652,397665] [2021-11-04 13:49:11,359 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--icplus--ipg.ko.cil.i[397797,397810] [2021-11-04 13:49:11,360 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--icplus--ipg.ko.cil.i[397951,397964] [2021-11-04 13:49:11,360 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--icplus--ipg.ko.cil.i[398102,398115] [2021-11-04 13:49:11,360 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--icplus--ipg.ko.cil.i[398257,398270] [2021-11-04 13:49:11,361 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--icplus--ipg.ko.cil.i[398409,398422] [2021-11-04 13:49:11,361 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--icplus--ipg.ko.cil.i[398564,398577] [2021-11-04 13:49:11,362 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--icplus--ipg.ko.cil.i[398728,398741] [2021-11-04 13:49:11,362 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--icplus--ipg.ko.cil.i[398884,398897] [2021-11-04 13:49:11,362 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--icplus--ipg.ko.cil.i[399048,399061] [2021-11-04 13:49:11,363 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--icplus--ipg.ko.cil.i[399190,399203] [2021-11-04 13:49:11,363 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--icplus--ipg.ko.cil.i[399348,399361] [2021-11-04 13:49:11,363 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--icplus--ipg.ko.cil.i[399515,399528] [2021-11-04 13:49:11,364 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--icplus--ipg.ko.cil.i[399674,399687] [2021-11-04 13:49:11,364 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--icplus--ipg.ko.cil.i[399833,399846] [2021-11-04 13:49:11,365 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--icplus--ipg.ko.cil.i[399982,399995] [2021-11-04 13:49:11,365 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--icplus--ipg.ko.cil.i[400129,400142] [2021-11-04 13:49:11,365 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--icplus--ipg.ko.cil.i[400268,400281] [2021-11-04 13:49:11,366 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--icplus--ipg.ko.cil.i[400431,400444] [2021-11-04 13:49:11,366 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--icplus--ipg.ko.cil.i[400597,400610] [2021-11-04 13:49:11,366 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--icplus--ipg.ko.cil.i[400761,400774] [2021-11-04 13:49:11,367 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--icplus--ipg.ko.cil.i[400926,400939] [2021-11-04 13:49:11,367 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--icplus--ipg.ko.cil.i[401091,401104] [2021-11-04 13:49:11,367 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--icplus--ipg.ko.cil.i[401257,401270] [2021-11-04 13:49:11,368 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--icplus--ipg.ko.cil.i[401422,401435] [2021-11-04 13:49:11,368 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--icplus--ipg.ko.cil.i[401589,401602] [2021-11-04 13:49:11,369 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--icplus--ipg.ko.cil.i[401749,401762] [2021-11-04 13:49:11,369 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--icplus--ipg.ko.cil.i[401911,401924] [2021-11-04 13:49:11,369 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--icplus--ipg.ko.cil.i[402070,402083] [2021-11-04 13:49:11,370 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--icplus--ipg.ko.cil.i[402216,402229] [2021-11-04 13:49:11,370 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--icplus--ipg.ko.cil.i[402359,402372] [2021-11-04 13:49:11,370 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--icplus--ipg.ko.cil.i[402503,402516] [2021-11-04 13:49:11,371 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--icplus--ipg.ko.cil.i[402646,402659] [2021-11-04 13:49:11,371 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--icplus--ipg.ko.cil.i[402790,402803] [2021-11-04 13:49:11,372 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--icplus--ipg.ko.cil.i[402931,402944] [2021-11-04 13:49:11,372 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--icplus--ipg.ko.cil.i[403069,403082] [2021-11-04 13:49:11,372 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--icplus--ipg.ko.cil.i[403227,403240] [2021-11-04 13:49:11,373 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--icplus--ipg.ko.cil.i[403386,403399] [2021-11-04 13:49:11,373 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--icplus--ipg.ko.cil.i[403542,403555] [2021-11-04 13:49:11,373 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--icplus--ipg.ko.cil.i[403691,403704] [2021-11-04 13:49:11,374 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--icplus--ipg.ko.cil.i[403843,403856] [2021-11-04 13:49:11,374 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--icplus--ipg.ko.cil.i[403994,404007] [2021-11-04 13:49:11,374 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--icplus--ipg.ko.cil.i[404143,404156] [2021-11-04 13:49:11,375 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--icplus--ipg.ko.cil.i[404295,404308] [2021-11-04 13:49:11,375 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--icplus--ipg.ko.cil.i[404443,404456] [2021-11-04 13:49:11,375 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--icplus--ipg.ko.cil.i[404596,404609] [2021-11-04 13:49:11,375 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--icplus--ipg.ko.cil.i[404747,404760] [2021-11-04 13:49:11,376 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--icplus--ipg.ko.cil.i[404897,404910] [2021-11-04 13:49:11,376 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--icplus--ipg.ko.cil.i[405044,405057] [2021-11-04 13:49:11,376 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--icplus--ipg.ko.cil.i[405195,405208] [2021-11-04 13:49:11,377 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--icplus--ipg.ko.cil.i[405346,405359] [2021-11-04 13:49:11,377 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--icplus--ipg.ko.cil.i[405494,405507] [2021-11-04 13:49:11,377 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--icplus--ipg.ko.cil.i[405660,405673] [2021-11-04 13:49:11,377 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--icplus--ipg.ko.cil.i[405829,405842] [2021-11-04 13:49:11,378 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--icplus--ipg.ko.cil.i[405996,406009] [2021-11-04 13:49:11,378 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--icplus--ipg.ko.cil.i[406164,406177] [2021-11-04 13:49:11,378 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--icplus--ipg.ko.cil.i[406314,406327] [2021-11-04 13:49:11,378 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--icplus--ipg.ko.cil.i[406461,406474] [2021-11-04 13:49:11,379 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--icplus--ipg.ko.cil.i[406622,406635] [2021-11-04 13:49:11,379 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--icplus--ipg.ko.cil.i[406792,406805] [2021-11-04 13:49:11,379 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--icplus--ipg.ko.cil.i[406954,406967] [2021-11-04 13:49:11,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 13:49:11,443 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 13:49:11,779 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--icplus--ipg.ko.cil.i[393566,393579] [2021-11-04 13:49:11,779 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--icplus--ipg.ko.cil.i[393711,393724] [2021-11-04 13:49:11,780 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--icplus--ipg.ko.cil.i[393857,393870] [2021-11-04 13:49:11,781 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--icplus--ipg.ko.cil.i[394022,394035] [2021-11-04 13:49:11,781 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--icplus--ipg.ko.cil.i[394180,394193] [2021-11-04 13:49:11,781 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--icplus--ipg.ko.cil.i[394338,394351] [2021-11-04 13:49:11,782 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--icplus--ipg.ko.cil.i[394496,394509] [2021-11-04 13:49:11,783 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--icplus--ipg.ko.cil.i[394656,394669] [2021-11-04 13:49:11,783 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--icplus--ipg.ko.cil.i[394815,394828] [2021-11-04 13:49:11,784 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--icplus--ipg.ko.cil.i[394954,394967] [2021-11-04 13:49:11,785 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--icplus--ipg.ko.cil.i[395096,395109] [2021-11-04 13:49:11,785 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--icplus--ipg.ko.cil.i[395245,395258] [2021-11-04 13:49:11,786 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--icplus--ipg.ko.cil.i[395384,395397] [2021-11-04 13:49:11,786 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--icplus--ipg.ko.cil.i[395539,395552] [2021-11-04 13:49:11,786 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--icplus--ipg.ko.cil.i[395699,395712] [2021-11-04 13:49:11,787 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--icplus--ipg.ko.cil.i[395850,395863] [2021-11-04 13:49:11,787 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--icplus--ipg.ko.cil.i[396001,396014] [2021-11-04 13:49:11,787 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--icplus--ipg.ko.cil.i[396153,396166] [2021-11-04 13:49:11,788 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--icplus--ipg.ko.cil.i[396302,396315] [2021-11-04 13:49:11,788 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--icplus--ipg.ko.cil.i[396450,396463] [2021-11-04 13:49:11,788 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--icplus--ipg.ko.cil.i[396607,396620] [2021-11-04 13:49:11,789 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--icplus--ipg.ko.cil.i[396756,396769] [2021-11-04 13:49:11,789 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--icplus--ipg.ko.cil.i[396912,396925] [2021-11-04 13:49:11,790 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--icplus--ipg.ko.cil.i[397065,397078] [2021-11-04 13:49:11,790 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--icplus--ipg.ko.cil.i[397211,397224] [2021-11-04 13:49:11,790 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--icplus--ipg.ko.cil.i[397354,397367] [2021-11-04 13:49:11,791 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--icplus--ipg.ko.cil.i[397506,397519] [2021-11-04 13:49:11,791 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--icplus--ipg.ko.cil.i[397652,397665] [2021-11-04 13:49:11,791 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--icplus--ipg.ko.cil.i[397797,397810] [2021-11-04 13:49:11,792 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--icplus--ipg.ko.cil.i[397951,397964] [2021-11-04 13:49:11,793 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--icplus--ipg.ko.cil.i[398102,398115] [2021-11-04 13:49:11,793 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--icplus--ipg.ko.cil.i[398257,398270] [2021-11-04 13:49:11,794 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--icplus--ipg.ko.cil.i[398409,398422] [2021-11-04 13:49:11,794 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--icplus--ipg.ko.cil.i[398564,398577] [2021-11-04 13:49:11,795 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--icplus--ipg.ko.cil.i[398728,398741] [2021-11-04 13:49:11,795 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--icplus--ipg.ko.cil.i[398884,398897] [2021-11-04 13:49:11,796 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--icplus--ipg.ko.cil.i[399048,399061] [2021-11-04 13:49:11,796 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--icplus--ipg.ko.cil.i[399190,399203] [2021-11-04 13:49:11,797 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--icplus--ipg.ko.cil.i[399348,399361] [2021-11-04 13:49:11,797 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--icplus--ipg.ko.cil.i[399515,399528] [2021-11-04 13:49:11,798 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--icplus--ipg.ko.cil.i[399674,399687] [2021-11-04 13:49:11,799 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--icplus--ipg.ko.cil.i[399833,399846] [2021-11-04 13:49:11,799 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--icplus--ipg.ko.cil.i[399982,399995] [2021-11-04 13:49:11,800 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--icplus--ipg.ko.cil.i[400129,400142] [2021-11-04 13:49:11,800 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--icplus--ipg.ko.cil.i[400268,400281] [2021-11-04 13:49:11,801 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--icplus--ipg.ko.cil.i[400431,400444] [2021-11-04 13:49:11,801 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--icplus--ipg.ko.cil.i[400597,400610] [2021-11-04 13:49:11,802 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--icplus--ipg.ko.cil.i[400761,400774] [2021-11-04 13:49:11,802 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--icplus--ipg.ko.cil.i[400926,400939] [2021-11-04 13:49:11,802 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--icplus--ipg.ko.cil.i[401091,401104] [2021-11-04 13:49:11,803 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--icplus--ipg.ko.cil.i[401257,401270] [2021-11-04 13:49:11,803 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--icplus--ipg.ko.cil.i[401422,401435] [2021-11-04 13:49:11,803 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--icplus--ipg.ko.cil.i[401589,401602] [2021-11-04 13:49:11,804 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--icplus--ipg.ko.cil.i[401749,401762] [2021-11-04 13:49:11,804 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--icplus--ipg.ko.cil.i[401911,401924] [2021-11-04 13:49:11,804 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--icplus--ipg.ko.cil.i[402070,402083] [2021-11-04 13:49:11,805 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--icplus--ipg.ko.cil.i[402216,402229] [2021-11-04 13:49:11,805 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--icplus--ipg.ko.cil.i[402359,402372] [2021-11-04 13:49:11,805 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--icplus--ipg.ko.cil.i[402503,402516] [2021-11-04 13:49:11,806 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--icplus--ipg.ko.cil.i[402646,402659] [2021-11-04 13:49:11,806 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--icplus--ipg.ko.cil.i[402790,402803] [2021-11-04 13:49:11,807 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--icplus--ipg.ko.cil.i[402931,402944] [2021-11-04 13:49:11,809 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--icplus--ipg.ko.cil.i[403069,403082] [2021-11-04 13:49:11,811 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--icplus--ipg.ko.cil.i[403227,403240] [2021-11-04 13:49:11,812 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--icplus--ipg.ko.cil.i[403386,403399] [2021-11-04 13:49:11,814 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--icplus--ipg.ko.cil.i[403542,403555] [2021-11-04 13:49:11,814 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--icplus--ipg.ko.cil.i[403691,403704] [2021-11-04 13:49:11,814 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--icplus--ipg.ko.cil.i[403843,403856] [2021-11-04 13:49:11,815 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--icplus--ipg.ko.cil.i[403994,404007] [2021-11-04 13:49:11,815 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--icplus--ipg.ko.cil.i[404143,404156] [2021-11-04 13:49:11,816 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--icplus--ipg.ko.cil.i[404295,404308] [2021-11-04 13:49:11,816 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--icplus--ipg.ko.cil.i[404443,404456] [2021-11-04 13:49:11,816 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--icplus--ipg.ko.cil.i[404596,404609] [2021-11-04 13:49:11,817 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--icplus--ipg.ko.cil.i[404747,404760] [2021-11-04 13:49:11,821 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--icplus--ipg.ko.cil.i[404897,404910] [2021-11-04 13:49:11,821 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--icplus--ipg.ko.cil.i[405044,405057] [2021-11-04 13:49:11,822 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--icplus--ipg.ko.cil.i[405195,405208] [2021-11-04 13:49:11,822 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--icplus--ipg.ko.cil.i[405346,405359] [2021-11-04 13:49:11,823 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--icplus--ipg.ko.cil.i[405494,405507] [2021-11-04 13:49:11,824 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--icplus--ipg.ko.cil.i[405660,405673] [2021-11-04 13:49:11,824 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--icplus--ipg.ko.cil.i[405829,405842] [2021-11-04 13:49:11,825 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--icplus--ipg.ko.cil.i[405996,406009] [2021-11-04 13:49:11,825 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--icplus--ipg.ko.cil.i[406164,406177] [2021-11-04 13:49:11,825 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--icplus--ipg.ko.cil.i[406314,406327] [2021-11-04 13:49:11,826 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--icplus--ipg.ko.cil.i[406461,406474] [2021-11-04 13:49:11,826 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--icplus--ipg.ko.cil.i[406622,406635] [2021-11-04 13:49:11,826 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--icplus--ipg.ko.cil.i[406792,406805] [2021-11-04 13:49:11,827 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--icplus--ipg.ko.cil.i[406954,406967] [2021-11-04 13:49:11,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 13:49:12,070 INFO L208 MainTranslator]: Completed translation [2021-11-04 13:49:12,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12 WrapperNode [2021-11-04 13:49:12,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 13:49:12,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 13:49:12,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 13:49:12,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 13:49:12,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:12,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:12,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 13:49:12,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 13:49:12,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 13:49:12,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 13:49:12,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:13,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:13,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:13,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:13,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:13,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:14,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:14,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 13:49:14,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 13:49:14,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 13:49:14,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 13:49:14,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (1/1) ... [2021-11-04 13:49:14,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 13:49:14,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 13:49:14,525 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-04 13:49:14,589 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-04 13:49:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 13:49:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 13:49:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 13:49:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 13:49:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 13:49:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 13:49:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 13:49:14,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 13:49:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 13:49:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 13:49:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 13:49:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 13:49:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 13:49:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 13:49:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-11-04 13:49:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 13:49:19,148 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_13_returnLabel: main_#res := 0; [2021-11-04 13:49:19,149 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L9819: #t~ret1021 := main_#res; [2021-11-04 13:49:19,149 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-04 13:49:19,149 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_pci_pci_instance_2_switch_break: call ULTIMATE.dealloc(ldv_pci_pci_instance_2_~#ldv_2_resource_pm_message~0.base, ldv_pci_pci_instance_2_~#ldv_2_resource_pm_message~0.offset);havoc ldv_pci_pci_instance_2_~#ldv_2_resource_pm_message~0.base, ldv_pci_pci_instance_2_~#ldv_2_resource_pm_message~0.offset; [2021-11-04 13:49:19,193 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 13:49:19,194 INFO L299 CfgBuilder]: Removed 7540 assume(true) statements. [2021-11-04 13:49:19,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:49:19 BoogieIcfgContainer [2021-11-04 13:49:19,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 13:49:19,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 13:49:19,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 13:49:19,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 13:49:19,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 01:49:08" (1/3) ... [2021-11-04 13:49:19,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d314298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:49:19, skipping insertion in model container [2021-11-04 13:49:19,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:49:12" (2/3) ... [2021-11-04 13:49:19,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d314298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:49:19, skipping insertion in model container [2021-11-04 13:49:19,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:49:19" (3/3) ... [2021-11-04 13:49:19,211 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i [2021-11-04 13:49:19,216 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 13:49:19,216 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2021-11-04 13:49:19,271 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 13:49:19,276 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-04 13:49:19,276 INFO L340 AbstractCegarLoop]: Starting to check reachability of 112 error locations. [2021-11-04 13:49:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 6252 states, 6140 states have (on average 1.323941368078176) internal successors, (8129), 6251 states have internal predecessors, (8129), 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-04 13:49:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-04 13:49:19,358 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:49:19,358 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-04 13:49:19,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:49:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:49:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1927790907, now seen corresponding path program 1 times [2021-11-04 13:49:19,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:49:19,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223607637] [2021-11-04 13:49:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:49:19,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:49:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:49:19,896 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-04 13:49:19,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:49:19,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223607637] [2021-11-04 13:49:19,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223607637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:49:19,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:49:19,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:49:19,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640449072] [2021-11-04 13:49:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:49:19,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:49:19,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:49:19,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:49:19,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:49:19,939 INFO L87 Difference]: Start difference. First operand has 6252 states, 6140 states have (on average 1.323941368078176) internal successors, (8129), 6251 states have internal predecessors, (8129), 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) 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-04 13:49:29,971 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:49:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:49:36,969 INFO L93 Difference]: Finished difference Result 12382 states and 16099 transitions. [2021-11-04 13:49:36,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:49:36,971 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-04 13:49:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:49:37,014 INFO L225 Difference]: With dead ends: 12382 [2021-11-04 13:49:37,015 INFO L226 Difference]: Without dead ends: 6053 [2021-11-04 13:49:37,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.27ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:49:37,033 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 7917 mSDsluCounter, 7610 mSDsCounter, 0 mSdLazyCounter, 15154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14243.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7917 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 15156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 51.36ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16392.45ms IncrementalHoareTripleChecker+Time [2021-11-04 13:49:37,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7917 Valid, 232 Invalid, 15156 Unknown, 0 Unchecked, 51.36ms Time], IncrementalHoareTripleChecker [2 Valid, 15154 Invalid, 0 Unknown, 0 Unchecked, 16392.45ms Time] [2021-11-04 13:49:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2021-11-04 13:49:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 6053. [2021-11-04 13:49:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6053 states, 5943 states have (on average 1.2690560323069158) internal successors, (7542), 6052 states have internal predecessors, (7542), 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-04 13:49:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6053 states to 6053 states and 7542 transitions. [2021-11-04 13:49:37,286 INFO L78 Accepts]: Start accepts. Automaton has 6053 states and 7542 transitions. Word has length 26 [2021-11-04 13:49:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:49:37,287 INFO L470 AbstractCegarLoop]: Abstraction has 6053 states and 7542 transitions. [2021-11-04 13:49:37,288 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-04 13:49:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6053 states and 7542 transitions. [2021-11-04 13:49:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-04 13:49:37,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:49:37,290 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-04 13:49:37,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 13:49:37,290 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:49:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:49:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1475435511, now seen corresponding path program 1 times [2021-11-04 13:49:37,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:49:37,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19784770] [2021-11-04 13:49:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:49:37,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:49:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:49:37,488 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-04 13:49:37,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:49:37,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19784770] [2021-11-04 13:49:37,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19784770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:49:37,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:49:37,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:49:37,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194982924] [2021-11-04 13:49:37,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:49:37,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:49:37,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:49:37,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:49:37,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:49:37,491 INFO L87 Difference]: Start difference. First operand 6053 states and 7542 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-04 13:49:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:49:53,623 INFO L93 Difference]: Finished difference Result 6053 states and 7542 transitions. [2021-11-04 13:49:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:49:53,624 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-04 13:49:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:49:53,649 INFO L225 Difference]: With dead ends: 6053 [2021-11-04 13:49:53,649 INFO L226 Difference]: Without dead ends: 6049 [2021-11-04 13:49:53,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.56ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:49:53,654 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7665 mSDsluCounter, 7384 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13684.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7665 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.33ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15679.53ms IncrementalHoareTripleChecker+Time [2021-11-04 13:49:53,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7665 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 40.33ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 15679.53ms Time] [2021-11-04 13:49:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2021-11-04 13:49:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 6049. [2021-11-04 13:49:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6049 states, 5941 states have (on average 1.2688099646524154) internal successors, (7538), 6048 states have internal predecessors, (7538), 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-04 13:49:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6049 states to 6049 states and 7538 transitions. [2021-11-04 13:49:53,846 INFO L78 Accepts]: Start accepts. Automaton has 6049 states and 7538 transitions. Word has length 28 [2021-11-04 13:49:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:49:53,847 INFO L470 AbstractCegarLoop]: Abstraction has 6049 states and 7538 transitions. [2021-11-04 13:49:53,848 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-04 13:49:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6049 states and 7538 transitions. [2021-11-04 13:49:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-04 13:49:53,849 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:49:53,849 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-04 13:49:53,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 13:49:53,850 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:49:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:49:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -553596499, now seen corresponding path program 1 times [2021-11-04 13:49:53,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:49:53,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797762004] [2021-11-04 13:49:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:49:53,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:49:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:49:54,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-04 13:49:54,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:49:54,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797762004] [2021-11-04 13:49:54,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797762004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:49:54,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:49:54,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:49:54,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225920390] [2021-11-04 13:49:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:49:54,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:49:54,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:49:54,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:49:54,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:49:54,022 INFO L87 Difference]: Start difference. First operand 6049 states and 7538 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-04 13:50:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:50:09,793 INFO L93 Difference]: Finished difference Result 6049 states and 7538 transitions. [2021-11-04 13:50:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:50:09,793 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-04 13:50:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:50:09,816 INFO L225 Difference]: With dead ends: 6049 [2021-11-04 13:50:09,816 INFO L226 Difference]: Without dead ends: 6045 [2021-11-04 13:50:09,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.72ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:50:09,822 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7651 mSDsluCounter, 7388 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13549.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7651 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 28.02ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15392.01ms IncrementalHoareTripleChecker+Time [2021-11-04 13:50:09,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7651 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 28.02ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 15392.01ms Time] [2021-11-04 13:50:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2021-11-04 13:50:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 6045. [2021-11-04 13:50:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6045 states, 5939 states have (on average 1.2685637312678901) internal successors, (7534), 6044 states have internal predecessors, (7534), 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-04 13:50:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6045 states to 6045 states and 7534 transitions. [2021-11-04 13:50:10,028 INFO L78 Accepts]: Start accepts. Automaton has 6045 states and 7534 transitions. Word has length 30 [2021-11-04 13:50:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:50:10,029 INFO L470 AbstractCegarLoop]: Abstraction has 6045 states and 7534 transitions. [2021-11-04 13:50:10,030 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-04 13:50:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6045 states and 7534 transitions. [2021-11-04 13:50:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-04 13:50:10,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:50:10,034 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-04 13:50:10,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 13:50:10,035 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:50:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:50:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash 570431409, now seen corresponding path program 1 times [2021-11-04 13:50:10,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:50:10,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51790294] [2021-11-04 13:50:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:50:10,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:50:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:50:10,202 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-04 13:50:10,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:50:10,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51790294] [2021-11-04 13:50:10,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51790294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:50:10,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:50:10,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:50:10,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303154371] [2021-11-04 13:50:10,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:50:10,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:50:10,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:50:10,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:50:10,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:50:10,205 INFO L87 Difference]: Start difference. First operand 6045 states and 7534 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-04 13:50:14,151 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:50:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:50:24,572 INFO L93 Difference]: Finished difference Result 6045 states and 7534 transitions. [2021-11-04 13:50:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:50:24,574 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-04 13:50:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:50:24,594 INFO L225 Difference]: With dead ends: 6045 [2021-11-04 13:50:24,594 INFO L226 Difference]: Without dead ends: 6041 [2021-11-04 13:50:24,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.01ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:50:24,598 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7637 mSDsluCounter, 7392 mSDsCounter, 0 mSdLazyCounter, 14921 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12375.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7637 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.45ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14921 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14113.77ms IncrementalHoareTripleChecker+Time [2021-11-04 13:50:24,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7637 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 20.45ms Time], IncrementalHoareTripleChecker [2 Valid, 14921 Invalid, 1 Unknown, 0 Unchecked, 14113.77ms Time] [2021-11-04 13:50:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2021-11-04 13:50:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 6041. [2021-11-04 13:50:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6041 states, 5937 states have (on average 1.2683173319858514) internal successors, (7530), 6040 states have internal predecessors, (7530), 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-04 13:50:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6041 states to 6041 states and 7530 transitions. [2021-11-04 13:50:24,762 INFO L78 Accepts]: Start accepts. Automaton has 6041 states and 7530 transitions. Word has length 32 [2021-11-04 13:50:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:50:24,762 INFO L470 AbstractCegarLoop]: Abstraction has 6041 states and 7530 transitions. [2021-11-04 13:50:24,763 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-04 13:50:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 6041 states and 7530 transitions. [2021-11-04 13:50:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 13:50:24,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:50:24,766 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-04 13:50:24,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 13:50:24,766 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:50:24,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:50:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1570507243, now seen corresponding path program 1 times [2021-11-04 13:50:24,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:50:24,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678800208] [2021-11-04 13:50:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:50:24,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:50:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:50:24,910 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-04 13:50:24,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:50:24,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678800208] [2021-11-04 13:50:24,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678800208] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:50:24,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:50:24,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:50:24,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131445021] [2021-11-04 13:50:24,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:50:24,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:50:24,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:50:24,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:50:24,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:50:24,912 INFO L87 Difference]: Start difference. First operand 6041 states and 7530 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-04 13:50:30,954 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:50:32,190 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:50:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:50:40,076 INFO L93 Difference]: Finished difference Result 6041 states and 7530 transitions. [2021-11-04 13:50:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:50:40,076 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-04 13:50:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:50:40,097 INFO L225 Difference]: With dead ends: 6041 [2021-11-04 13:50:40,097 INFO L226 Difference]: Without dead ends: 6037 [2021-11-04 13:50:40,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.17ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:50:40,102 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7623 mSDsluCounter, 7396 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13049.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7623 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.26ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14828.50ms IncrementalHoareTripleChecker+Time [2021-11-04 13:50:40,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7623 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 24.26ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 14828.50ms Time] [2021-11-04 13:50:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2021-11-04 13:50:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 6037. [2021-11-04 13:50:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6037 states, 5935 states have (on average 1.2680707666385846) internal successors, (7526), 6036 states have internal predecessors, (7526), 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-04 13:50:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6037 states to 6037 states and 7526 transitions. [2021-11-04 13:50:40,254 INFO L78 Accepts]: Start accepts. Automaton has 6037 states and 7526 transitions. Word has length 34 [2021-11-04 13:50:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:50:40,255 INFO L470 AbstractCegarLoop]: Abstraction has 6037 states and 7526 transitions. [2021-11-04 13:50:40,255 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-04 13:50:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 7526 transitions. [2021-11-04 13:50:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-04 13:50:40,256 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:50:40,256 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-04 13:50:40,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 13:50:40,256 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:50:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:50:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1723216679, now seen corresponding path program 1 times [2021-11-04 13:50:40,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:50:40,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535133809] [2021-11-04 13:50:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:50:40,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:50:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:50:40,390 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-04 13:50:40,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:50:40,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535133809] [2021-11-04 13:50:40,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535133809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:50:40,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:50:40,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:50:40,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857630605] [2021-11-04 13:50:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:50:40,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:50:40,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:50:40,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:50:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:50:40,393 INFO L87 Difference]: Start difference. First operand 6037 states and 7526 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-04 13:50:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:50:55,052 INFO L93 Difference]: Finished difference Result 6037 states and 7526 transitions. [2021-11-04 13:50:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:50:55,053 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-04 13:50:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:50:55,065 INFO L225 Difference]: With dead ends: 6037 [2021-11-04 13:50:55,065 INFO L226 Difference]: Without dead ends: 6033 [2021-11-04 13:50:55,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.62ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:50:55,069 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7609 mSDsluCounter, 7400 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12413.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7609 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.02ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14258.67ms IncrementalHoareTripleChecker+Time [2021-11-04 13:50:55,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7609 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 25.02ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 14258.67ms Time] [2021-11-04 13:50:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2021-11-04 13:50:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 6033. [2021-11-04 13:50:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6033 states, 5933 states have (on average 1.2678240350581493) internal successors, (7522), 6032 states have internal predecessors, (7522), 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-04 13:50:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 7522 transitions. [2021-11-04 13:50:55,227 INFO L78 Accepts]: Start accepts. Automaton has 6033 states and 7522 transitions. Word has length 36 [2021-11-04 13:50:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:50:55,227 INFO L470 AbstractCegarLoop]: Abstraction has 6033 states and 7522 transitions. [2021-11-04 13:50:55,227 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-04 13:50:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 6033 states and 7522 transitions. [2021-11-04 13:50:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-04 13:50:55,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:50:55,229 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-04 13:50:55,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 13:50:55,229 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:50:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:50:55,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1846871037, now seen corresponding path program 1 times [2021-11-04 13:50:55,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:50:55,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593712892] [2021-11-04 13:50:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:50:55,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:50:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:50:55,356 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-04 13:50:55,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:50:55,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593712892] [2021-11-04 13:50:55,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593712892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:50:55,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:50:55,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:50:55,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627134719] [2021-11-04 13:50:55,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:50:55,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:50:55,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:50:55,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:50:55,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:50:55,359 INFO L87 Difference]: Start difference. First operand 6033 states and 7522 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-04 13:51:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:51:10,001 INFO L93 Difference]: Finished difference Result 6033 states and 7522 transitions. [2021-11-04 13:51:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:51:10,001 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-04 13:51:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:51:10,012 INFO L225 Difference]: With dead ends: 6033 [2021-11-04 13:51:10,013 INFO L226 Difference]: Without dead ends: 6029 [2021-11-04 13:51:10,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.55ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:51:10,015 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7595 mSDsluCounter, 7404 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12477.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7595 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.57ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14279.91ms IncrementalHoareTripleChecker+Time [2021-11-04 13:51:10,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7595 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 23.57ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 14279.91ms Time] [2021-11-04 13:51:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2021-11-04 13:51:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 6029. [2021-11-04 13:51:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6029 states, 5931 states have (on average 1.2675771370763784) internal successors, (7518), 6028 states have internal predecessors, (7518), 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-04 13:51:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6029 states to 6029 states and 7518 transitions. [2021-11-04 13:51:10,135 INFO L78 Accepts]: Start accepts. Automaton has 6029 states and 7518 transitions. Word has length 38 [2021-11-04 13:51:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:51:10,136 INFO L470 AbstractCegarLoop]: Abstraction has 6029 states and 7518 transitions. [2021-11-04 13:51:10,136 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-04 13:51:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6029 states and 7518 transitions. [2021-11-04 13:51:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-04 13:51:10,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:51:10,137 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-04 13:51:10,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 13:51:10,137 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:51:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:51:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1022296961, now seen corresponding path program 1 times [2021-11-04 13:51:10,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:51:10,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230126745] [2021-11-04 13:51:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:51:10,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:51:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:51:10,235 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-04 13:51:10,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:51:10,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230126745] [2021-11-04 13:51:10,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230126745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:51:10,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:51:10,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:51:10,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014266248] [2021-11-04 13:51:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:51:10,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:51:10,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:51:10,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:51:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:51:10,237 INFO L87 Difference]: Start difference. First operand 6029 states and 7518 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-04 13:51:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:51:23,468 INFO L93 Difference]: Finished difference Result 6029 states and 7518 transitions. [2021-11-04 13:51:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:51:23,468 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-04 13:51:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:51:23,480 INFO L225 Difference]: With dead ends: 6029 [2021-11-04 13:51:23,481 INFO L226 Difference]: Without dead ends: 6025 [2021-11-04 13:51:23,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.33ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:51:23,483 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7581 mSDsluCounter, 7408 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11216.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7581 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.47ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12936.09ms IncrementalHoareTripleChecker+Time [2021-11-04 13:51:23,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7581 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 19.47ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 12936.09ms Time] [2021-11-04 13:51:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2021-11-04 13:51:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 6025. [2021-11-04 13:51:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 5929 states have (on average 1.2673300725248777) internal successors, (7514), 6024 states have internal predecessors, (7514), 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-04 13:51:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 7514 transitions. [2021-11-04 13:51:23,655 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 7514 transitions. Word has length 40 [2021-11-04 13:51:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:51:23,656 INFO L470 AbstractCegarLoop]: Abstraction has 6025 states and 7514 transitions. [2021-11-04 13:51:23,656 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-04 13:51:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 7514 transitions. [2021-11-04 13:51:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 13:51:23,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:51:23,657 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-04 13:51:23,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 13:51:23,658 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:51:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:51:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1286472018, now seen corresponding path program 1 times [2021-11-04 13:51:23,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:51:23,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728593036] [2021-11-04 13:51:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:51:23,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:51:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:51:23,787 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-04 13:51:23,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:51:23,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728593036] [2021-11-04 13:51:23,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728593036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:51:23,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:51:23,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:51:23,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117121767] [2021-11-04 13:51:23,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:51:23,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 13:51:23,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:51:23,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 13:51:23,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 13:51:23,790 INFO L87 Difference]: Start difference. First operand 6025 states and 7514 transitions. Second operand has 3 states, 3 states have (on average 14.0) 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-04 13:51:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:51:36,933 INFO L93 Difference]: Finished difference Result 14545 states and 18184 transitions. [2021-11-04 13:51:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 13:51:36,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) 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-04 13:51:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:51:36,952 INFO L225 Difference]: With dead ends: 14545 [2021-11-04 13:51:36,953 INFO L226 Difference]: Without dead ends: 8551 [2021-11-04 13:51:36,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.70ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 13:51:36,969 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7498 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 13884 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10755.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7498 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.71ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12732.44ms IncrementalHoareTripleChecker+Time [2021-11-04 13:51:36,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7498 Valid, 0 Invalid, 13888 Unknown, 0 Unchecked, 16.71ms Time], IncrementalHoareTripleChecker [4 Valid, 13884 Invalid, 0 Unknown, 0 Unchecked, 12732.44ms Time] [2021-11-04 13:51:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8551 states. [2021-11-04 13:51:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8551 to 8478. [2021-11-04 13:51:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8478 states, 8382 states have (on average 1.272369362920544) internal successors, (10665), 8477 states have internal predecessors, (10665), 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-04 13:51:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8478 states to 8478 states and 10665 transitions. [2021-11-04 13:51:37,265 INFO L78 Accepts]: Start accepts. Automaton has 8478 states and 10665 transitions. Word has length 42 [2021-11-04 13:51:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:51:37,266 INFO L470 AbstractCegarLoop]: Abstraction has 8478 states and 10665 transitions. [2021-11-04 13:51:37,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) 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-04 13:51:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 8478 states and 10665 transitions. [2021-11-04 13:51:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 13:51:37,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:51:37,267 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-04 13:51:37,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 13:51:37,267 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:51:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:51:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1119408252, now seen corresponding path program 1 times [2021-11-04 13:51:37,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:51:37,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050512022] [2021-11-04 13:51:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:51:37,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:51:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:51:37,438 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-04 13:51:37,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:51:37,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050512022] [2021-11-04 13:51:37,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050512022] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:51:37,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:51:37,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:51:37,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588062162] [2021-11-04 13:51:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:51:37,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:51:37,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:51:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:51:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:51:37,441 INFO L87 Difference]: Start difference. First operand 8478 states and 10665 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-04 13:51:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:51:50,977 INFO L93 Difference]: Finished difference Result 8478 states and 10665 transitions. [2021-11-04 13:51:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:51:50,978 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-04 13:51:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:51:50,991 INFO L225 Difference]: With dead ends: 8478 [2021-11-04 13:51:50,991 INFO L226 Difference]: Without dead ends: 8474 [2021-11-04 13:51:50,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.34ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:51:50,996 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7567 mSDsluCounter, 7412 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11351.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7567 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.44ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13107.15ms IncrementalHoareTripleChecker+Time [2021-11-04 13:51:50,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7567 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 24.44ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 13107.15ms Time] [2021-11-04 13:51:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8474 states. [2021-11-04 13:51:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8474 to 8474. [2021-11-04 13:51:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8474 states, 8380 states have (on average 1.2721957040572793) internal successors, (10661), 8473 states have internal predecessors, (10661), 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-04 13:51:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8474 states to 8474 states and 10661 transitions. [2021-11-04 13:51:51,289 INFO L78 Accepts]: Start accepts. Automaton has 8474 states and 10661 transitions. Word has length 42 [2021-11-04 13:51:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:51:51,290 INFO L470 AbstractCegarLoop]: Abstraction has 8474 states and 10661 transitions. [2021-11-04 13:51:51,290 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-04 13:51:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8474 states and 10661 transitions. [2021-11-04 13:51:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-04 13:51:51,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:51:51,291 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-04 13:51:51,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 13:51:51,291 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:51:51,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:51:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2008781848, now seen corresponding path program 1 times [2021-11-04 13:51:51,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:51:51,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801506188] [2021-11-04 13:51:51,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:51:51,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:51:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:51:51,406 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-04 13:51:51,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:51:51,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801506188] [2021-11-04 13:51:51,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801506188] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:51:51,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:51:51,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:51:51,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226353702] [2021-11-04 13:51:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:51:51,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:51:51,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:51:51,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:51:51,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:51:51,408 INFO L87 Difference]: Start difference. First operand 8474 states and 10661 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-04 13:51:55,385 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:51:58,807 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:52:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:52:07,990 INFO L93 Difference]: Finished difference Result 8474 states and 10661 transitions. [2021-11-04 13:52:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:52:07,991 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-04 13:52:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:52:08,002 INFO L225 Difference]: With dead ends: 8474 [2021-11-04 13:52:08,002 INFO L226 Difference]: Without dead ends: 8470 [2021-11-04 13:52:08,005 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-04 13:52:08,007 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7553 mSDsluCounter, 7416 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14266.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7553 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16083.33ms IncrementalHoareTripleChecker+Time [2021-11-04 13:52:08,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7553 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 26.48ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 16083.33ms Time] [2021-11-04 13:52:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2021-11-04 13:52:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 8470. [2021-11-04 13:52:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8470 states, 8378 states have (on average 1.2720219622821676) internal successors, (10657), 8469 states have internal predecessors, (10657), 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-04 13:52:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8470 states to 8470 states and 10657 transitions. [2021-11-04 13:52:08,303 INFO L78 Accepts]: Start accepts. Automaton has 8470 states and 10657 transitions. Word has length 44 [2021-11-04 13:52:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:52:08,303 INFO L470 AbstractCegarLoop]: Abstraction has 8470 states and 10657 transitions. [2021-11-04 13:52:08,303 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-04 13:52:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 8470 states and 10657 transitions. [2021-11-04 13:52:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-04 13:52:08,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:52:08,304 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] [2021-11-04 13:52:08,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 13:52:08,304 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:52:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:52:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1628292531, now seen corresponding path program 1 times [2021-11-04 13:52:08,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:52:08,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577490609] [2021-11-04 13:52:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:52:08,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:52:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:52:08,433 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-04 13:52:08,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:52:08,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577490609] [2021-11-04 13:52:08,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577490609] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:52:08,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:52:08,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 13:52:08,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916380987] [2021-11-04 13:52:08,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:52:08,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 13:52:08,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:52:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 13:52:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:52:08,436 INFO L87 Difference]: Start difference. First operand 8470 states and 10657 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-04 13:52:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:52:23,169 INFO L93 Difference]: Finished difference Result 16982 states and 21319 transitions. [2021-11-04 13:52:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:52:23,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 45 [2021-11-04 13:52:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:52:23,182 INFO L225 Difference]: With dead ends: 16982 [2021-11-04 13:52:23,182 INFO L226 Difference]: Without dead ends: 8543 [2021-11-04 13:52:23,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.08ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 13:52:23,197 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 22485 mSDsluCounter, 6379 mSDsCounter, 0 mSdLazyCounter, 17067 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11860.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22485 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 45.46ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14056.77ms IncrementalHoareTripleChecker+Time [2021-11-04 13:52:23,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22485 Valid, 0 Invalid, 17083 Unknown, 0 Unchecked, 45.46ms Time], IncrementalHoareTripleChecker [16 Valid, 17067 Invalid, 0 Unknown, 0 Unchecked, 14056.77ms Time] [2021-11-04 13:52:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2021-11-04 13:52:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 8467. [2021-11-04 13:52:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8467 states, 8376 states have (on average 1.2718481375358166) internal successors, (10653), 8466 states have internal predecessors, (10653), 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-04 13:52:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 10653 transitions. [2021-11-04 13:52:23,621 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 10653 transitions. Word has length 45 [2021-11-04 13:52:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:52:23,622 INFO L470 AbstractCegarLoop]: Abstraction has 8467 states and 10653 transitions. [2021-11-04 13:52:23,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-04 13:52:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 10653 transitions. [2021-11-04 13:52:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-04 13:52:23,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:52:23,623 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-04 13:52:23,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 13:52:23,623 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:52:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:52:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1998315348, now seen corresponding path program 1 times [2021-11-04 13:52:23,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:52:23,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290214878] [2021-11-04 13:52:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:52:23,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:52:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:52:23,734 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-04 13:52:23,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:52:23,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290214878] [2021-11-04 13:52:23,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290214878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:52:23,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:52:23,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:52:23,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753560316] [2021-11-04 13:52:23,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:52:23,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:52:23,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:52:23,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:52:23,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:52:23,736 INFO L87 Difference]: Start difference. First operand 8467 states and 10653 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-04 13:52:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:52:37,111 INFO L93 Difference]: Finished difference Result 8467 states and 10653 transitions. [2021-11-04 13:52:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:52:37,112 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-04 13:52:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:52:37,123 INFO L225 Difference]: With dead ends: 8467 [2021-11-04 13:52:37,123 INFO L226 Difference]: Without dead ends: 8463 [2021-11-04 13:52:37,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:52:37,126 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7535 mSDsluCounter, 7416 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11161.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7535 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.03ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12922.11ms IncrementalHoareTripleChecker+Time [2021-11-04 13:52:37,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7535 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 23.03ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 12922.11ms Time] [2021-11-04 13:52:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8463 states. [2021-11-04 13:52:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8463 to 8463. [2021-11-04 13:52:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8463 states, 8374 states have (on average 1.271674229758777) internal successors, (10649), 8462 states have internal predecessors, (10649), 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-04 13:52:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 10649 transitions. [2021-11-04 13:52:37,442 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 10649 transitions. Word has length 46 [2021-11-04 13:52:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:52:37,442 INFO L470 AbstractCegarLoop]: Abstraction has 8463 states and 10649 transitions. [2021-11-04 13:52:37,442 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-04 13:52:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 10649 transitions. [2021-11-04 13:52:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-04 13:52:37,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:52:37,443 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-04 13:52:37,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 13:52:37,444 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:52:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:52:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -529943088, now seen corresponding path program 1 times [2021-11-04 13:52:37,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:52:37,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55961635] [2021-11-04 13:52:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:52:37,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:52:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:52:37,546 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-04 13:52:37,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:52:37,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55961635] [2021-11-04 13:52:37,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55961635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:52:37,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:52:37,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:52:37,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601302307] [2021-11-04 13:52:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:52:37,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:52:37,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:52:37,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:52:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:52:37,548 INFO L87 Difference]: Start difference. First operand 8463 states and 10649 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-04 13:52:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:52:50,627 INFO L93 Difference]: Finished difference Result 8463 states and 10649 transitions. [2021-11-04 13:52:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:52:50,628 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-04 13:52:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:52:50,637 INFO L225 Difference]: With dead ends: 8463 [2021-11-04 13:52:50,638 INFO L226 Difference]: Without dead ends: 8459 [2021-11-04 13:52:50,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:52:50,639 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7521 mSDsluCounter, 7420 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10913.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7521 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.51ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12652.50ms IncrementalHoareTripleChecker+Time [2021-11-04 13:52:50,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7521 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 21.51ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 12652.50ms Time] [2021-11-04 13:52:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2021-11-04 13:52:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8459. [2021-11-04 13:52:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8459 states, 8372 states have (on average 1.2715002388915433) internal successors, (10645), 8458 states have internal predecessors, (10645), 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-04 13:52:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 10645 transitions. [2021-11-04 13:52:50,906 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 10645 transitions. Word has length 48 [2021-11-04 13:52:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:52:50,906 INFO L470 AbstractCegarLoop]: Abstraction has 8459 states and 10645 transitions. [2021-11-04 13:52:50,906 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-04 13:52:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 10645 transitions. [2021-11-04 13:52:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-04 13:52:50,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:52:50,907 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-04 13:52:50,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 13:52:50,908 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:52:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:52:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1826526036, now seen corresponding path program 1 times [2021-11-04 13:52:50,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:52:50,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459993055] [2021-11-04 13:52:50,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:52:50,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:52:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:52:51,016 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-04 13:52:51,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:52:51,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459993055] [2021-11-04 13:52:51,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459993055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:52:51,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:52:51,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:52:51,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040323747] [2021-11-04 13:52:51,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:52:51,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:52:51,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:52:51,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:52:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:52:51,018 INFO L87 Difference]: Start difference. First operand 8459 states and 10645 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-04 13:53:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:53:05,235 INFO L93 Difference]: Finished difference Result 8459 states and 10645 transitions. [2021-11-04 13:53:05,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:53:05,235 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-04 13:53:05,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:53:05,245 INFO L225 Difference]: With dead ends: 8459 [2021-11-04 13:53:05,246 INFO L226 Difference]: Without dead ends: 8455 [2021-11-04 13:53:05,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.41ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:53:05,249 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7507 mSDsluCounter, 7424 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11986.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7507 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.52ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13765.21ms IncrementalHoareTripleChecker+Time [2021-11-04 13:53:05,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7507 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 21.52ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 13765.21ms Time] [2021-11-04 13:53:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8455 states. [2021-11-04 13:53:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8455 to 8455. [2021-11-04 13:53:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8455 states, 8370 states have (on average 1.271326164874552) internal successors, (10641), 8454 states have internal predecessors, (10641), 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-04 13:53:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 10641 transitions. [2021-11-04 13:53:05,507 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 10641 transitions. Word has length 50 [2021-11-04 13:53:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:53:05,507 INFO L470 AbstractCegarLoop]: Abstraction has 8455 states and 10641 transitions. [2021-11-04 13:53:05,507 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-04 13:53:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 10641 transitions. [2021-11-04 13:53:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-04 13:53:05,508 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:53:05,508 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-04 13:53:05,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 13:53:05,508 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:53:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:53:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1349377736, now seen corresponding path program 1 times [2021-11-04 13:53:05,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:53:05,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524021253] [2021-11-04 13:53:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:53:05,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:53:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:53:05,621 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-04 13:53:05,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:53:05,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524021253] [2021-11-04 13:53:05,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524021253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:53:05,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:53:05,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:53:05,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269420389] [2021-11-04 13:53:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:53:05,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:53:05,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:53:05,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:53:05,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:53:05,623 INFO L87 Difference]: Start difference. First operand 8455 states and 10641 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-04 13:53:08,740 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:53:20,652 INFO L93 Difference]: Finished difference Result 8455 states and 10641 transitions. [2021-11-04 13:53:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:53:20,652 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-04 13:53:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:53:20,666 INFO L225 Difference]: With dead ends: 8455 [2021-11-04 13:53:20,667 INFO L226 Difference]: Without dead ends: 8451 [2021-11-04 13:53:20,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.90ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:53:20,671 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7493 mSDsluCounter, 7428 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12663.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7493 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.26ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14488.14ms IncrementalHoareTripleChecker+Time [2021-11-04 13:53:20,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7493 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 23.26ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 14488.14ms Time] [2021-11-04 13:53:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8451 states. [2021-11-04 13:53:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8451 to 8451. [2021-11-04 13:53:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8451 states, 8368 states have (on average 1.2711520076481835) internal successors, (10637), 8450 states have internal predecessors, (10637), 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-04 13:53:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8451 states to 8451 states and 10637 transitions. [2021-11-04 13:53:20,972 INFO L78 Accepts]: Start accepts. Automaton has 8451 states and 10637 transitions. Word has length 52 [2021-11-04 13:53:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:53:20,972 INFO L470 AbstractCegarLoop]: Abstraction has 8451 states and 10637 transitions. [2021-11-04 13:53:20,972 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-04 13:53:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8451 states and 10637 transitions. [2021-11-04 13:53:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 13:53:20,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:53:20,973 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-04 13:53:20,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 13:53:20,973 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:53:20,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:53:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash 328845180, now seen corresponding path program 1 times [2021-11-04 13:53:20,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:53:20,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871261344] [2021-11-04 13:53:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:53:20,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:53:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:53:21,098 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-04 13:53:21,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:53:21,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871261344] [2021-11-04 13:53:21,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871261344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:53:21,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:53:21,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:53:21,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708185289] [2021-11-04 13:53:21,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:53:21,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:53:21,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:53:21,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:53:21,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:53:21,101 INFO L87 Difference]: Start difference. First operand 8451 states and 10637 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-04 13:53:24,370 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:53:37,166 INFO L93 Difference]: Finished difference Result 8451 states and 10637 transitions. [2021-11-04 13:53:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:53:37,167 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-04 13:53:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:53:37,181 INFO L225 Difference]: With dead ends: 8451 [2021-11-04 13:53:37,181 INFO L226 Difference]: Without dead ends: 8447 [2021-11-04 13:53:37,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.45ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:53:37,186 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7479 mSDsluCounter, 7432 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13654.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7479 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.38ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15476.38ms IncrementalHoareTripleChecker+Time [2021-11-04 13:53:37,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7479 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 22.38ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 15476.38ms Time] [2021-11-04 13:53:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8447 states. [2021-11-04 13:53:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8447 to 8447. [2021-11-04 13:53:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8447 states, 8366 states have (on average 1.2709777671527611) internal successors, (10633), 8446 states have internal predecessors, (10633), 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-04 13:53:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8447 states to 8447 states and 10633 transitions. [2021-11-04 13:53:37,498 INFO L78 Accepts]: Start accepts. Automaton has 8447 states and 10633 transitions. Word has length 54 [2021-11-04 13:53:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:53:37,498 INFO L470 AbstractCegarLoop]: Abstraction has 8447 states and 10633 transitions. [2021-11-04 13:53:37,498 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-04 13:53:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8447 states and 10633 transitions. [2021-11-04 13:53:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-04 13:53:37,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:53:37,499 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-04 13:53:37,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 13:53:37,500 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:53:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:53:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1806635488, now seen corresponding path program 1 times [2021-11-04 13:53:37,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:53:37,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837583153] [2021-11-04 13:53:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:53:37,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:53:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:53:37,620 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-04 13:53:37,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:53:37,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837583153] [2021-11-04 13:53:37,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837583153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:53:37,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:53:37,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:53:37,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387022654] [2021-11-04 13:53:37,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:53:37,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:53:37,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:53:37,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:53:37,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:53:37,622 INFO L87 Difference]: Start difference. First operand 8447 states and 10633 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-04 13:53:40,418 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:48,223 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:53:54,711 INFO L93 Difference]: Finished difference Result 8447 states and 10633 transitions. [2021-11-04 13:53:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:53:54,711 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-04 13:53:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:53:54,721 INFO L225 Difference]: With dead ends: 8447 [2021-11-04 13:53:54,721 INFO L226 Difference]: Without dead ends: 8443 [2021-11-04 13:53:54,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.09ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:53:54,725 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7465 mSDsluCounter, 7436 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14592.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7465 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.94ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16461.23ms IncrementalHoareTripleChecker+Time [2021-11-04 13:53:54,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7465 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 22.94ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 16461.23ms Time] [2021-11-04 13:53:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8443 states. [2021-11-04 13:53:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8443 to 8443. [2021-11-04 13:53:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8443 states, 8364 states have (on average 1.2708034433285509) internal successors, (10629), 8442 states have internal predecessors, (10629), 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-04 13:53:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8443 states to 8443 states and 10629 transitions. [2021-11-04 13:53:55,031 INFO L78 Accepts]: Start accepts. Automaton has 8443 states and 10629 transitions. Word has length 56 [2021-11-04 13:53:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:53:55,032 INFO L470 AbstractCegarLoop]: Abstraction has 8443 states and 10629 transitions. [2021-11-04 13:53:55,032 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-04 13:53:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8443 states and 10629 transitions. [2021-11-04 13:53:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-04 13:53:55,032 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:53:55,032 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-04 13:53:55,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 13:53:55,035 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:53:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:53:55,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1009189596, now seen corresponding path program 1 times [2021-11-04 13:53:55,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:53:55,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427259782] [2021-11-04 13:53:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:53:55,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:53:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:53:55,150 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-04 13:53:55,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:53:55,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427259782] [2021-11-04 13:53:55,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427259782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:53:55,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:53:55,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:53:55,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385436563] [2021-11-04 13:53:55,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:53:55,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:53:55,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:53:55,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:53:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:53:55,153 INFO L87 Difference]: Start difference. First operand 8443 states and 10629 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-04 13:54:06,872 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:54:10,641 INFO L93 Difference]: Finished difference Result 8443 states and 10629 transitions. [2021-11-04 13:54:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:54:10,641 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-04 13:54:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:54:10,652 INFO L225 Difference]: With dead ends: 8443 [2021-11-04 13:54:10,652 INFO L226 Difference]: Without dead ends: 8439 [2021-11-04 13:54:10,654 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-04 13:54:10,655 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7451 mSDsluCounter, 7440 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13097.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7451 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.31ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14925.66ms IncrementalHoareTripleChecker+Time [2021-11-04 13:54:10,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7451 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 22.31ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 14925.66ms Time] [2021-11-04 13:54:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2021-11-04 13:54:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 8439. [2021-11-04 13:54:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8439 states, 8362 states have (on average 1.2706290361157617) internal successors, (10625), 8438 states have internal predecessors, (10625), 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-04 13:54:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 10625 transitions. [2021-11-04 13:54:10,965 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 10625 transitions. Word has length 58 [2021-11-04 13:54:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:54:10,965 INFO L470 AbstractCegarLoop]: Abstraction has 8439 states and 10625 transitions. [2021-11-04 13:54:10,965 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-04 13:54:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 10625 transitions. [2021-11-04 13:54:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-04 13:54:10,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:54:10,966 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-04 13:54:10,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 13:54:10,966 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:54:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:54:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash 832134280, now seen corresponding path program 1 times [2021-11-04 13:54:10,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:54:10,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625645480] [2021-11-04 13:54:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:54:10,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:54:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:54:11,071 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-04 13:54:11,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:54:11,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625645480] [2021-11-04 13:54:11,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625645480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:54:11,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:54:11,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:54:11,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856884647] [2021-11-04 13:54:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:54:11,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:54:11,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:54:11,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:54:11,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:54:11,073 INFO L87 Difference]: Start difference. First operand 8439 states and 10625 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-04 13:54:22,277 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:54:25,241 INFO L93 Difference]: Finished difference Result 8439 states and 10625 transitions. [2021-11-04 13:54:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:54:25,241 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-04 13:54:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:54:25,252 INFO L225 Difference]: With dead ends: 8439 [2021-11-04 13:54:25,253 INFO L226 Difference]: Without dead ends: 8435 [2021-11-04 13:54:25,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.09ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:54:25,255 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7437 mSDsluCounter, 7444 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11812.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7437 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.44ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13595.01ms IncrementalHoareTripleChecker+Time [2021-11-04 13:54:25,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7437 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 23.44ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 13595.01ms Time] [2021-11-04 13:54:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states. [2021-11-04 13:54:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 8435. [2021-11-04 13:54:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8435 states, 8360 states have (on average 1.2704545454545455) internal successors, (10621), 8434 states have internal predecessors, (10621), 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-04 13:54:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8435 states to 8435 states and 10621 transitions. [2021-11-04 13:54:25,607 INFO L78 Accepts]: Start accepts. Automaton has 8435 states and 10621 transitions. Word has length 60 [2021-11-04 13:54:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:54:25,608 INFO L470 AbstractCegarLoop]: Abstraction has 8435 states and 10621 transitions. [2021-11-04 13:54:25,608 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-04 13:54:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 8435 states and 10621 transitions. [2021-11-04 13:54:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-04 13:54:25,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:54:25,609 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-04 13:54:25,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 13:54:25,609 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:54:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:54:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash 817853516, now seen corresponding path program 1 times [2021-11-04 13:54:25,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:54:25,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174571065] [2021-11-04 13:54:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:54:25,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:54:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:54:25,717 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-04 13:54:25,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:54:25,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174571065] [2021-11-04 13:54:25,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174571065] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:54:25,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:54:25,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:54:25,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244169710] [2021-11-04 13:54:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:54:25,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:54:25,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:54:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:54:25,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:54:25,720 INFO L87 Difference]: Start difference. First operand 8435 states and 10621 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-04 13:54:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:54:40,635 INFO L93 Difference]: Finished difference Result 8435 states and 10621 transitions. [2021-11-04 13:54:40,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:54:40,635 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-04 13:54:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:54:40,649 INFO L225 Difference]: With dead ends: 8435 [2021-11-04 13:54:40,649 INFO L226 Difference]: Without dead ends: 8431 [2021-11-04 13:54:40,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:54:40,656 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7423 mSDsluCounter, 7448 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12505.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7423 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.10ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14300.09ms IncrementalHoareTripleChecker+Time [2021-11-04 13:54:40,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7423 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 23.10ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 14300.09ms Time] [2021-11-04 13:54:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2021-11-04 13:54:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8431. [2021-11-04 13:54:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8431 states, 8358 states have (on average 1.2702799712849964) internal successors, (10617), 8430 states have internal predecessors, (10617), 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-04 13:54:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8431 states to 8431 states and 10617 transitions. [2021-11-04 13:54:41,055 INFO L78 Accepts]: Start accepts. Automaton has 8431 states and 10617 transitions. Word has length 62 [2021-11-04 13:54:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:54:41,055 INFO L470 AbstractCegarLoop]: Abstraction has 8431 states and 10617 transitions. [2021-11-04 13:54:41,055 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-04 13:54:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 8431 states and 10617 transitions. [2021-11-04 13:54:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-04 13:54:41,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:54:41,056 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-04 13:54:41,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-04 13:54:41,056 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:54:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:54:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash -21058448, now seen corresponding path program 1 times [2021-11-04 13:54:41,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:54:41,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111929067] [2021-11-04 13:54:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:54:41,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:54:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:54:41,163 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-04 13:54:41,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:54:41,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111929067] [2021-11-04 13:54:41,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111929067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:54:41,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:54:41,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:54:41,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034413570] [2021-11-04 13:54:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:54:41,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:54:41,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:54:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:54:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:54:41,165 INFO L87 Difference]: Start difference. First operand 8431 states and 10617 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-04 13:54:44,424 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:45,652 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:47,919 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:54:59,712 INFO L93 Difference]: Finished difference Result 8431 states and 10617 transitions. [2021-11-04 13:54:59,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:54:59,714 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-04 13:54:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:54:59,728 INFO L225 Difference]: With dead ends: 8431 [2021-11-04 13:54:59,728 INFO L226 Difference]: Without dead ends: 8427 [2021-11-04 13:54:59,733 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-04 13:54:59,733 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7409 mSDsluCounter, 7452 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15912.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7409 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.28ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17801.17ms IncrementalHoareTripleChecker+Time [2021-11-04 13:54:59,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7409 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 30.28ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 17801.17ms Time] [2021-11-04 13:54:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8427 states. [2021-11-04 13:55:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8427 to 8427. [2021-11-04 13:55:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8427 states, 8356 states have (on average 1.2701053135471518) internal successors, (10613), 8426 states have internal predecessors, (10613), 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-04 13:55:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8427 states to 8427 states and 10613 transitions. [2021-11-04 13:55:00,167 INFO L78 Accepts]: Start accepts. Automaton has 8427 states and 10613 transitions. Word has length 64 [2021-11-04 13:55:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:55:00,168 INFO L470 AbstractCegarLoop]: Abstraction has 8427 states and 10613 transitions. [2021-11-04 13:55:00,168 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-04 13:55:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 8427 states and 10613 transitions. [2021-11-04 13:55:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-04 13:55:00,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:55:00,169 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-04 13:55:00,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-04 13:55:00,169 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:55:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:55:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1238396148, now seen corresponding path program 1 times [2021-11-04 13:55:00,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:55:00,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040142214] [2021-11-04 13:55:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:55:00,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:55:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:55:00,282 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-04 13:55:00,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:55:00,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040142214] [2021-11-04 13:55:00,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040142214] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:55:00,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:55:00,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:55:00,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461932241] [2021-11-04 13:55:00,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:55:00,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:55:00,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:55:00,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:55:00,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:55:00,284 INFO L87 Difference]: Start difference. First operand 8427 states and 10613 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-04 13:55:05,723 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:12,086 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:18,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:55:21,553 INFO L93 Difference]: Finished difference Result 8427 states and 10613 transitions. [2021-11-04 13:55:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:55:21,553 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-04 13:55:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:55:21,568 INFO L225 Difference]: With dead ends: 8427 [2021-11-04 13:55:21,568 INFO L226 Difference]: Without dead ends: 8295 [2021-11-04 13:55:21,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:55:21,573 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7395 mSDsluCounter, 7456 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18439.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7395 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 37.39ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20413.92ms IncrementalHoareTripleChecker+Time [2021-11-04 13:55:21,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7395 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 37.39ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 20413.92ms Time] [2021-11-04 13:55:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8295 states. [2021-11-04 13:55:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8295 to 8295. [2021-11-04 13:55:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8295 states, 8226 states have (on average 1.273644541697058) internal successors, (10477), 8294 states have internal predecessors, (10477), 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-04 13:55:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8295 states to 8295 states and 10477 transitions. [2021-11-04 13:55:21,931 INFO L78 Accepts]: Start accepts. Automaton has 8295 states and 10477 transitions. Word has length 66 [2021-11-04 13:55:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:55:21,931 INFO L470 AbstractCegarLoop]: Abstraction has 8295 states and 10477 transitions. [2021-11-04 13:55:21,931 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-04 13:55:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8295 states and 10477 transitions. [2021-11-04 13:55:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-04 13:55:21,932 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:55:21,933 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] [2021-11-04 13:55:21,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-04 13:55:21,933 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:55:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:55:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2017713289, now seen corresponding path program 1 times [2021-11-04 13:55:21,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:55:21,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860180315] [2021-11-04 13:55:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:55:21,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:55:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:55:22,136 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-04 13:55:22,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:55:22,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860180315] [2021-11-04 13:55:22,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860180315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:55:22,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:55:22,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:55:22,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752364296] [2021-11-04 13:55:22,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:55:22,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:55:22,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:55:22,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:55:22,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:55:22,138 INFO L87 Difference]: Start difference. First operand 8295 states and 10477 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-04 13:55:25,899 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:39,559 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:55:49,149 INFO L93 Difference]: Finished difference Result 16455 states and 20810 transitions. [2021-11-04 13:55:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:55:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2021-11-04 13:55:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:55:49,174 INFO L225 Difference]: With dead ends: 16455 [2021-11-04 13:55:49,174 INFO L226 Difference]: Without dead ends: 16443 [2021-11-04 13:55:49,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.60ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:55:49,179 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 14475 mSDsluCounter, 7272 mSDsCounter, 0 mSdLazyCounter, 21821 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22361.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14475 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 64.73ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25515.88ms IncrementalHoareTripleChecker+Time [2021-11-04 13:55:49,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14475 Valid, 0 Invalid, 21837 Unknown, 0 Unchecked, 64.73ms Time], IncrementalHoareTripleChecker [16 Valid, 21821 Invalid, 0 Unknown, 0 Unchecked, 25515.88ms Time] [2021-11-04 13:55:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16443 states. [2021-11-04 13:55:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16443 to 8283. [2021-11-04 13:55:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8283 states, 8220 states have (on average 1.2726277372262773) internal successors, (10461), 8282 states have internal predecessors, (10461), 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-04 13:55:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 10461 transitions. [2021-11-04 13:55:49,646 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 10461 transitions. Word has length 77 [2021-11-04 13:55:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:55:49,646 INFO L470 AbstractCegarLoop]: Abstraction has 8283 states and 10461 transitions. [2021-11-04 13:55:49,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-04 13:55:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 10461 transitions. [2021-11-04 13:55:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-04 13:55:49,647 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:55:49,647 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] [2021-11-04 13:55:49,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-04 13:55:49,648 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:55:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:55:49,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1376130011, now seen corresponding path program 1 times [2021-11-04 13:55:49,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:55:49,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007859646] [2021-11-04 13:55:49,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:55:49,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:55:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:55:49,778 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-04 13:55:49,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:55:49,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007859646] [2021-11-04 13:55:49,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007859646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:55:49,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:55:49,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:55:49,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077230815] [2021-11-04 13:55:49,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:55:49,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:55:49,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:55:49,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:55:49,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:55:49,780 INFO L87 Difference]: Start difference. First operand 8283 states and 10461 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-04 13:56:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:56:10,761 INFO L93 Difference]: Finished difference Result 12190 states and 15313 transitions. [2021-11-04 13:56:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:56:10,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2021-11-04 13:56:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:56:10,775 INFO L225 Difference]: With dead ends: 12190 [2021-11-04 13:56:10,775 INFO L226 Difference]: Without dead ends: 12176 [2021-11-04 13:56:10,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.18ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:56:10,778 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 10866 mSDsluCounter, 7179 mSDsCounter, 0 mSdLazyCounter, 18061 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17353.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10866 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.71ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 18061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19821.05ms IncrementalHoareTripleChecker+Time [2021-11-04 13:56:10,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10866 Valid, 0 Invalid, 18080 Unknown, 0 Unchecked, 44.71ms Time], IncrementalHoareTripleChecker [19 Valid, 18061 Invalid, 0 Unknown, 0 Unchecked, 19821.05ms Time] [2021-11-04 13:56:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12176 states. [2021-11-04 13:56:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12176 to 8269. [2021-11-04 13:56:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8269 states, 8213 states have (on average 1.2715207597710947) internal successors, (10443), 8268 states have internal predecessors, (10443), 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-04 13:56:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 10443 transitions. [2021-11-04 13:56:11,220 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 10443 transitions. Word has length 77 [2021-11-04 13:56:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:56:11,220 INFO L470 AbstractCegarLoop]: Abstraction has 8269 states and 10443 transitions. [2021-11-04 13:56:11,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-04 13:56:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 10443 transitions. [2021-11-04 13:56:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-04 13:56:11,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:56:11,221 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] [2021-11-04 13:56:11,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-04 13:56:11,221 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:56:11,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:56:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash -510810258, now seen corresponding path program 1 times [2021-11-04 13:56:11,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:56:11,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106436153] [2021-11-04 13:56:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:56:11,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:56:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:56:11,420 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-04 13:56:11,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:56:11,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106436153] [2021-11-04 13:56:11,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106436153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:56:11,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:56:11,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 13:56:11,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367392152] [2021-11-04 13:56:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:56:11,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:56:11,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:56:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:56:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:56:11,423 INFO L87 Difference]: Start difference. First operand 8269 states and 10443 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-04 13:56:15,649 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:26,010 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:47,535 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:56:49,728 INFO L93 Difference]: Finished difference Result 16457 states and 20800 transitions. [2021-11-04 13:56:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:56:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2021-11-04 13:56:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:56:49,747 INFO L225 Difference]: With dead ends: 16457 [2021-11-04 13:56:49,747 INFO L226 Difference]: Without dead ends: 16445 [2021-11-04 13:56:49,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.79ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:56:49,751 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7270 mSDsluCounter, 21717 mSDsCounter, 0 mSdLazyCounter, 36258 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32707.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 54.78ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 36258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36725.66ms IncrementalHoareTripleChecker+Time [2021-11-04 13:56:49,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7270 Valid, 0 Invalid, 36273 Unknown, 0 Unchecked, 54.78ms Time], IncrementalHoareTripleChecker [15 Valid, 36258 Invalid, 0 Unknown, 0 Unchecked, 36725.66ms Time] [2021-11-04 13:56:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16445 states. [2021-11-04 13:56:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16445 to 8257. [2021-11-04 13:56:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8257 states, 8207 states have (on average 1.2705007920068234) internal successors, (10427), 8256 states have internal predecessors, (10427), 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-04 13:56:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8257 states to 8257 states and 10427 transitions. [2021-11-04 13:56:50,259 INFO L78 Accepts]: Start accepts. Automaton has 8257 states and 10427 transitions. Word has length 81 [2021-11-04 13:56:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:56:50,259 INFO L470 AbstractCegarLoop]: Abstraction has 8257 states and 10427 transitions. [2021-11-04 13:56:50,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-04 13:56:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 8257 states and 10427 transitions. [2021-11-04 13:56:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-04 13:56:50,260 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:56:50,260 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-04 13:56:50,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-04 13:56:50,260 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:56:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:56:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash 108190561, now seen corresponding path program 1 times [2021-11-04 13:56:50,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:56:50,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79992570] [2021-11-04 13:56:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:56:50,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:56:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:56:50,406 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-04 13:56:50,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:56:50,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79992570] [2021-11-04 13:56:50,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79992570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:56:50,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:56:50,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 13:56:50,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045165318] [2021-11-04 13:56:50,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:56:50,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:56:50,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:56:50,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:56:50,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:56:50,408 INFO L87 Difference]: Start difference. First operand 8257 states and 10427 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-04 13:57:15,091 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 [] [2021-11-04 13:57:22,606 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 [] [2021-11-04 13:57:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:57:42,803 INFO L93 Difference]: Finished difference Result 32788 states and 41448 transitions. [2021-11-04 13:57:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:57:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2021-11-04 13:57:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:57:42,842 INFO L225 Difference]: With dead ends: 32788 [2021-11-04 13:57:42,843 INFO L226 Difference]: Without dead ends: 24560 [2021-11-04 13:57:42,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.14ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:57:42,860 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 14347 mSDsluCounter, 21288 mSDsCounter, 0 mSdLazyCounter, 35611 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43487.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14347 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 100.76ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 35611 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49061.91ms IncrementalHoareTripleChecker+Time [2021-11-04 13:57:42,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14347 Valid, 0 Invalid, 35650 Unknown, 0 Unchecked, 100.76ms Time], IncrementalHoareTripleChecker [37 Valid, 35611 Invalid, 2 Unknown, 0 Unchecked, 49061.91ms Time] [2021-11-04 13:57:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24560 states. [2021-11-04 13:57:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24560 to 8359. [2021-11-04 13:57:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8359 states, 8309 states have (on average 1.2692261403297629) internal successors, (10546), 8358 states have internal predecessors, (10546), 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-04 13:57:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 10546 transitions. [2021-11-04 13:57:43,663 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 10546 transitions. Word has length 84 [2021-11-04 13:57:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:57:43,663 INFO L470 AbstractCegarLoop]: Abstraction has 8359 states and 10546 transitions. [2021-11-04 13:57:43,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-04 13:57:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 10546 transitions. [2021-11-04 13:57:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-04 13:57:43,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:57:43,665 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:57:43,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-04 13:57:43,665 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:57:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:57:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash -490298835, now seen corresponding path program 1 times [2021-11-04 13:57:43,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:57:43,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261862458] [2021-11-04 13:57:43,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:57:43,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:57:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:57:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:57:43,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:57:43,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261862458] [2021-11-04 13:57:43,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261862458] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 13:57:43,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89682082] [2021-11-04 13:57:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:57:43,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 13:57:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 13:57:43,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 13:57:43,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-04 13:57:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:57:44,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 2134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-04 13:57:44,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 13:57:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-04 13:57:44,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 13:57:44,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89682082] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:57:44,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 13:57:44,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2021-11-04 13:57:44,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793438787] [2021-11-04 13:57:44,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:57:44,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-04 13:57:44,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:57:44,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-04 13:57:44,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-04 13:57:44,982 INFO L87 Difference]: Start difference. First operand 8359 states and 10546 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-04 13:57:51,291 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:56,342 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:00,602 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:06,760 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:22,083 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:24,499 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:54,906 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 [] [2021-11-04 13:58:57,035 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:03,035 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:19,420 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:59:41,452 INFO L93 Difference]: Finished difference Result 27168 states and 34323 transitions. [2021-11-04 13:59:41,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-04 13:59:41,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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 90 [2021-11-04 13:59:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:59:41,478 INFO L225 Difference]: With dead ends: 27168 [2021-11-04 13:59:41,478 INFO L226 Difference]: Without dead ends: 18837 [2021-11-04 13:59:41,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 409.29ms TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2021-11-04 13:59:41,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 37746 mSDsluCounter, 89977 mSDsCounter, 0 mSdLazyCounter, 101278 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102364.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37746 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 101301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 314.82ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101278 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 112742.66ms IncrementalHoareTripleChecker+Time [2021-11-04 13:59:41,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37746 Valid, 0 Invalid, 101301 Unknown, 0 Unchecked, 314.82ms Time], IncrementalHoareTripleChecker [21 Valid, 101278 Invalid, 2 Unknown, 0 Unchecked, 112742.66ms Time] [2021-11-04 13:59:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18837 states. [2021-11-04 13:59:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18837 to 8383. [2021-11-04 13:59:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8383 states, 8333 states have (on average 1.2686907476299052) internal successors, (10572), 8382 states have internal predecessors, (10572), 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-04 13:59:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8383 states to 8383 states and 10572 transitions. [2021-11-04 13:59:42,223 INFO L78 Accepts]: Start accepts. Automaton has 8383 states and 10572 transitions. Word has length 90 [2021-11-04 13:59:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:59:42,223 INFO L470 AbstractCegarLoop]: Abstraction has 8383 states and 10572 transitions. [2021-11-04 13:59:42,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-04 13:59:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8383 states and 10572 transitions. [2021-11-04 13:59:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-04 13:59:42,224 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:59:42,224 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:59:42,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-04 13:59:42,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-04 13:59:42,425 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 13:59:42,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:59:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash 116250812, now seen corresponding path program 1 times [2021-11-04 13:59:42,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:59:42,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976296360] [2021-11-04 13:59:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:59:42,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:59:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:59:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-04 13:59:42,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:59:42,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976296360] [2021-11-04 13:59:42,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976296360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:59:42,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:59:42,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 13:59:42,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209918918] [2021-11-04 13:59:42,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:59:42,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 13:59:42,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:59:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 13:59:42,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:59:42,639 INFO L87 Difference]: Start difference. First operand 8383 states and 10572 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-04 14:00:08,085 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:00:16,608 INFO L93 Difference]: Finished difference Result 16813 states and 21197 transitions. [2021-11-04 14:00:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:00:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 116 [2021-11-04 14:00:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:00:16,619 INFO L225 Difference]: With dead ends: 16813 [2021-11-04 14:00:16,619 INFO L226 Difference]: Without dead ends: 8459 [2021-11-04 14:00:16,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.32ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 14:00:16,630 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 21911 mSDsCounter, 0 mSdLazyCounter, 29274 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29277.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 67.78ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32478.26ms IncrementalHoareTripleChecker+Time [2021-11-04 14:00:16,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 29275 Unknown, 0 Unchecked, 67.78ms Time], IncrementalHoareTripleChecker [0 Valid, 29274 Invalid, 1 Unknown, 0 Unchecked, 32478.26ms Time] [2021-11-04 14:00:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2021-11-04 14:00:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8386. [2021-11-04 14:00:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8386 states, 8336 states have (on average 1.2685940499040307) internal successors, (10575), 8385 states have internal predecessors, (10575), 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-04 14:00:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8386 states to 8386 states and 10575 transitions. [2021-11-04 14:00:17,247 INFO L78 Accepts]: Start accepts. Automaton has 8386 states and 10575 transitions. Word has length 116 [2021-11-04 14:00:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:00:17,247 INFO L470 AbstractCegarLoop]: Abstraction has 8386 states and 10575 transitions. [2021-11-04 14:00:17,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-04 14:00:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8386 states and 10575 transitions. [2021-11-04 14:00:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-04 14:00:17,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:00:17,249 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:00:17,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-04 14:00:17,249 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-04 14:00:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:00:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash 29196624, now seen corresponding path program 1 times [2021-11-04 14:00:17,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:00:17,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833905280] [2021-11-04 14:00:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:00:17,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:00:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:00:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:00:17,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:00:17,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833905280] [2021-11-04 14:00:17,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833905280] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 14:00:17,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185920395] [2021-11-04 14:00:17,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:00:17,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 14:00:17,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 14:00:17,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 14:00:17,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-04 14:00:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:00:18,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-04 14:00:18,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 14:00:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-04 14:00:18,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 14:00:18,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185920395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:00:18,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 14:00:18,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2021-11-04 14:00:18,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467467372] [2021-11-04 14:00:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:00:18,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-04 14:00:18,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:00:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-04 14:00:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-04 14:00:18,720 INFO L87 Difference]: Start difference. First operand 8386 states and 10575 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 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-04 14:00:32,547 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:34,109 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15