./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 4d014703 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-4d01470 [2021-11-03 04:04:30,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:04:30,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:04:30,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:04:30,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:04:30,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:04:30,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:04:30,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:04:30,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:04:30,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:04:30,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:04:30,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:04:30,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:04:30,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:04:30,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:04:30,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:04:30,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:04:30,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:04:30,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:04:30,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:04:30,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:04:30,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:04:30,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:04:30,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:04:30,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:04:30,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:04:30,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:04:30,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:04:30,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:04:30,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:04:30,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:04:30,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:04:30,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:04:30,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:04:30,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:04:30,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:04:30,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:04:30,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:04:30,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:04:30,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:04:30,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:04:30,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-03 04:04:30,133 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:04:30,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:04:30,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 04:04:30,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 04:04:30,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 04:04:30,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 04:04:30,135 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 04:04:30,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:04:30,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:04:30,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:04:30,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:04:30,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:04:30,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:04:30,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:04:30,136 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:04:30,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:04:30,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:04:30,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 04:04:30,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:04:30,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:04:30,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:04:30,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:04:30,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:04:30,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-03 04:04:30,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:04:30,138 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 04:04:30,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 04:04:30,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:04:30,139 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:04:30,139 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-03 04:04:30,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:04:30,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:04:30,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:04:30,365 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:04:30,366 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:04:30,367 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-03 04:04:30,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27cacc5aa/c42a7736a8224c289657ce3f67d25546/FLAGb043d2f3f [2021-11-03 04:04:31,069 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:04:31,069 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-03 04:04:31,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27cacc5aa/c42a7736a8224c289657ce3f67d25546/FLAGb043d2f3f [2021-11-03 04:04:31,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27cacc5aa/c42a7736a8224c289657ce3f67d25546 [2021-11-03 04:04:31,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:04:31,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:04:31,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:04:31,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:04:31,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:04:31,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:04:31" (1/1) ... [2021-11-03 04:04:31,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0f116c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:31, skipping insertion in model container [2021-11-03 04:04:31,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:04:31" (1/1) ... [2021-11-03 04:04:31,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:04:31,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:04:33,889 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393566,393579] [2021-11-03 04:04:33,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393711,393724] [2021-11-03 04:04:33,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[393857,393870] [2021-11-03 04:04:33,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394022,394035] [2021-11-03 04:04:33,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394180,394193] [2021-11-03 04:04:33,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394338,394351] [2021-11-03 04:04:33,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394496,394509] [2021-11-03 04:04:33,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394656,394669] [2021-11-03 04:04:33,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394815,394828] [2021-11-03 04:04:33,895 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[394954,394967] [2021-11-03 04:04:33,895 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[395096,395109] [2021-11-03 04:04:33,896 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,896 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,897 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,897 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,897 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,897 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,898 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396302,396315] [2021-11-03 04:04:33,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396450,396463] [2021-11-03 04:04:33,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396607,396620] [2021-11-03 04:04:33,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396756,396769] [2021-11-03 04:04:33,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[396912,396925] [2021-11-03 04:04:33,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397065,397078] [2021-11-03 04:04:33,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397211,397224] [2021-11-03 04:04:33,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397354,397367] [2021-11-03 04:04:33,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397506,397519] [2021-11-03 04:04:33,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397652,397665] [2021-11-03 04:04:33,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397797,397810] [2021-11-03 04:04:33,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[397951,397964] [2021-11-03 04:04:33,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398102,398115] [2021-11-03 04:04:33,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398257,398270] [2021-11-03 04:04:33,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398409,398422] [2021-11-03 04:04:33,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398564,398577] [2021-11-03 04:04:33,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398728,398741] [2021-11-03 04:04:33,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i[398884,398897] [2021-11-03 04:04:33,907 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,907 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,910 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,910 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,911 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,911 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:33,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:04:33,961 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:04:34,200 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,200 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,203 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,208 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,219 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-03 04:04:34,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:04:34,400 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:04:34,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34 WrapperNode [2021-11-03 04:04:34,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:04:34,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:04:34,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:04:34,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:04:34,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:34,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:35,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:04:35,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:04:35,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:04:35,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:04:35,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:35,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:35,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:35,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:36,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:36,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:36,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:36,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:04:36,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:04:36,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:04:36,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:04:36,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2021-11-03 04:04:36,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:04:36,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:04:36,280 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-03 04:04:36,301 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-03 04:04:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 04:04:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-03 04:04:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-03 04:04:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 04:04:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 04:04:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 04:04:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:04:36,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:04:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-03 04:04:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-03 04:04:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:04:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 04:04:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 04:04:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 04:04:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-11-03 04:04:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:04:39,722 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_13_returnLabel: main_#res := 0; [2021-11-03 04:04:39,723 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L9819: #t~ret1021 := main_#res; [2021-11-03 04:04:39,723 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-03 04:04:39,724 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-03 04:04:39,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:04:39,752 INFO L299 CfgBuilder]: Removed 7540 assume(true) statements. [2021-11-03 04:04:39,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:04:39 BoogieIcfgContainer [2021-11-03 04:04:39,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:04:39,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:04:39,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:04:39,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:04:39,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:04:31" (1/3) ... [2021-11-03 04:04:39,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1e1563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:04:39, skipping insertion in model container [2021-11-03 04:04:39,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (2/3) ... [2021-11-03 04:04:39,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1e1563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:04:39, skipping insertion in model container [2021-11-03 04:04:39,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:04:39" (3/3) ... [2021-11-03 04:04:39,763 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--icplus--ipg.ko.cil.i [2021-11-03 04:04:39,767 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:04:39,767 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2021-11-03 04:04:39,807 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:04:39,811 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-03 04:04:39,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 112 error locations. [2021-11-03 04:04:39,871 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-03 04:04:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 04:04:39,875 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:04:39,876 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-03 04:04:39,876 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-03 04:04:39,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:04:39,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1927790907, now seen corresponding path program 1 times [2021-11-03 04:04:39,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:04:39,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575289578] [2021-11-03 04:04:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:04:39,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:04:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:04:40,263 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-03 04:04:40,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:04:40,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575289578] [2021-11-03 04:04:40,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575289578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:04:40,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:04:40,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:04:40,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852800763] [2021-11-03 04:04:40,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:04:40,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:04:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:04:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:04:40,321 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-03 04:04:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:04:54,105 INFO L93 Difference]: Finished difference Result 12382 states and 16099 transitions. [2021-11-03 04:04:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:04:54,107 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-03 04:04:54,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:04:54,141 INFO L225 Difference]: With dead ends: 12382 [2021-11-03 04:04:54,141 INFO L226 Difference]: Without dead ends: 6053 [2021-11-03 04:04:54,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.18ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:04:54,164 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 7917 mSDsluCounter, 7610 mSDsCounter, 0 mSdLazyCounter, 15154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11422.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7917 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 15156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 49.72ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13309.45ms IncrementalHoareTripleChecker+Time [2021-11-03 04:04:54,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7917 Valid, 232 Invalid, 15156 Unknown, 0 Unchecked, 49.72ms Time], IncrementalHoareTripleChecker [2 Valid, 15154 Invalid, 0 Unknown, 0 Unchecked, 13309.45ms Time] [2021-11-03 04:04:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2021-11-03 04:04:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 6053. [2021-11-03 04:04:54,443 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-03 04:04:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6053 states to 6053 states and 7542 transitions. [2021-11-03 04:04:54,458 INFO L78 Accepts]: Start accepts. Automaton has 6053 states and 7542 transitions. Word has length 26 [2021-11-03 04:04:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:04:54,459 INFO L470 AbstractCegarLoop]: Abstraction has 6053 states and 7542 transitions. [2021-11-03 04:04:54,459 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-03 04:04:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6053 states and 7542 transitions. [2021-11-03 04:04:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 04:04:54,461 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:04:54,461 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-03 04:04:54,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:04:54,466 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-03 04:04:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:04:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1475435511, now seen corresponding path program 1 times [2021-11-03 04:04:54,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:04:54,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751092410] [2021-11-03 04:04:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:04:54,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:04:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:04:54,625 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-03 04:04:54,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:04:54,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751092410] [2021-11-03 04:04:54,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751092410] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:04:54,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:04:54,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:04:54,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977123310] [2021-11-03 04:04:54,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:04:54,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:04:54,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:04:54,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:04:54,628 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-03 04:05:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:05:08,407 INFO L93 Difference]: Finished difference Result 6053 states and 7542 transitions. [2021-11-03 04:05:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:05:08,408 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-03 04:05:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:05:08,425 INFO L225 Difference]: With dead ends: 6053 [2021-11-03 04:05:08,425 INFO L226 Difference]: Without dead ends: 6049 [2021-11-03 04:05:08,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.42ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:05:08,427 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7665 mSDsluCounter, 7384 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11719.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7665 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.42ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13502.05ms IncrementalHoareTripleChecker+Time [2021-11-03 04:05:08,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7665 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 27.42ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 13502.05ms Time] [2021-11-03 04:05:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2021-11-03 04:05:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 6049. [2021-11-03 04:05:08,533 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-03 04:05:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6049 states to 6049 states and 7538 transitions. [2021-11-03 04:05:08,543 INFO L78 Accepts]: Start accepts. Automaton has 6049 states and 7538 transitions. Word has length 28 [2021-11-03 04:05:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:05:08,544 INFO L470 AbstractCegarLoop]: Abstraction has 6049 states and 7538 transitions. [2021-11-03 04:05:08,545 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-03 04:05:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 6049 states and 7538 transitions. [2021-11-03 04:05:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 04:05:08,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:05:08,546 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-03 04:05:08,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:05:08,546 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-03 04:05:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:05:08,547 INFO L85 PathProgramCache]: Analyzing trace with hash -553596499, now seen corresponding path program 1 times [2021-11-03 04:05:08,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:05:08,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519487255] [2021-11-03 04:05:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:05:08,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:05:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:05:08,701 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-03 04:05:08,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:05:08,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519487255] [2021-11-03 04:05:08,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519487255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:05:08,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:05:08,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:05:08,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794320979] [2021-11-03 04:05:08,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:05:08,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:05:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:05:08,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:05:08,704 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-03 04:05:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:05:22,902 INFO L93 Difference]: Finished difference Result 6049 states and 7538 transitions. [2021-11-03 04:05:22,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:05:22,903 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-03 04:05:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:05:22,922 INFO L225 Difference]: With dead ends: 6049 [2021-11-03 04:05:22,922 INFO L226 Difference]: Without dead ends: 6045 [2021-11-03 04:05:22,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:05:22,930 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7651 mSDsluCounter, 7388 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12248.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7651 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13940.94ms IncrementalHoareTripleChecker+Time [2021-11-03 04:05:22,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7651 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 22.60ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 13940.94ms Time] [2021-11-03 04:05:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2021-11-03 04:05:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 6045. [2021-11-03 04:05:23,070 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-03 04:05:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6045 states to 6045 states and 7534 transitions. [2021-11-03 04:05:23,081 INFO L78 Accepts]: Start accepts. Automaton has 6045 states and 7534 transitions. Word has length 30 [2021-11-03 04:05:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:05:23,082 INFO L470 AbstractCegarLoop]: Abstraction has 6045 states and 7534 transitions. [2021-11-03 04:05:23,082 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-03 04:05:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6045 states and 7534 transitions. [2021-11-03 04:05:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 04:05:23,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:05:23,087 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-03 04:05:23,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:05:23,087 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-03 04:05:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:05:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash 570431409, now seen corresponding path program 1 times [2021-11-03 04:05:23,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:05:23,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580878615] [2021-11-03 04:05:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:05:23,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:05:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:05:23,231 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-03 04:05:23,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:05:23,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580878615] [2021-11-03 04:05:23,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580878615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:05:23,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:05:23,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:05:23,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173399364] [2021-11-03 04:05:23,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:05:23,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:05:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:05:23,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:05:23,234 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-03 04:05:26,989 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-03 04:05:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:05:38,668 INFO L93 Difference]: Finished difference Result 6045 states and 7534 transitions. [2021-11-03 04:05:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:05:38,669 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-03 04:05:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:05:38,685 INFO L225 Difference]: With dead ends: 6045 [2021-11-03 04:05:38,686 INFO L226 Difference]: Without dead ends: 6041 [2021-11-03 04:05:38,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.88ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:05:38,689 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7637 mSDsluCounter, 7392 mSDsCounter, 0 mSdLazyCounter, 14921 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13595.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7637 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.02ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14921 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15180.85ms IncrementalHoareTripleChecker+Time [2021-11-03 04:05:38,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7637 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 21.02ms Time], IncrementalHoareTripleChecker [2 Valid, 14921 Invalid, 1 Unknown, 0 Unchecked, 15180.85ms Time] [2021-11-03 04:05:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2021-11-03 04:05:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 6041. [2021-11-03 04:05:38,792 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-03 04:05:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6041 states to 6041 states and 7530 transitions. [2021-11-03 04:05:38,804 INFO L78 Accepts]: Start accepts. Automaton has 6041 states and 7530 transitions. Word has length 32 [2021-11-03 04:05:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:05:38,804 INFO L470 AbstractCegarLoop]: Abstraction has 6041 states and 7530 transitions. [2021-11-03 04:05:38,805 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-03 04:05:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6041 states and 7530 transitions. [2021-11-03 04:05:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-03 04:05:38,807 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:05:38,807 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-03 04:05:38,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:05:38,808 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-03 04:05:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:05:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1570507243, now seen corresponding path program 1 times [2021-11-03 04:05:38,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:05:38,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875592985] [2021-11-03 04:05:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:05:38,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:05:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:05:38,925 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-03 04:05:38,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:05:38,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875592985] [2021-11-03 04:05:38,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875592985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:05:38,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:05:38,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:05:38,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724254638] [2021-11-03 04:05:38,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:05:38,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:05:38,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:05:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:05:38,928 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-03 04:05:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:05:50,878 INFO L93 Difference]: Finished difference Result 6041 states and 7530 transitions. [2021-11-03 04:05:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:05:50,879 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-03 04:05:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:05:50,900 INFO L225 Difference]: With dead ends: 6041 [2021-11-03 04:05:50,901 INFO L226 Difference]: Without dead ends: 6037 [2021-11-03 04:05:50,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:05:50,905 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7623 mSDsluCounter, 7396 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10168.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7623 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.31ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11653.29ms IncrementalHoareTripleChecker+Time [2021-11-03 04:05:50,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7623 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 24.31ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 11653.29ms Time] [2021-11-03 04:05:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2021-11-03 04:05:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 6037. [2021-11-03 04:05:51,042 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-03 04:05:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6037 states to 6037 states and 7526 transitions. [2021-11-03 04:05:51,050 INFO L78 Accepts]: Start accepts. Automaton has 6037 states and 7526 transitions. Word has length 34 [2021-11-03 04:05:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:05:51,051 INFO L470 AbstractCegarLoop]: Abstraction has 6037 states and 7526 transitions. [2021-11-03 04:05:51,051 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-03 04:05:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 7526 transitions. [2021-11-03 04:05:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 04:05:51,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:05:51,052 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-03 04:05:51,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:05:51,052 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-03 04:05:51,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:05:51,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1723216679, now seen corresponding path program 1 times [2021-11-03 04:05:51,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:05:51,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928430284] [2021-11-03 04:05:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:05:51,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:05:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:05:51,160 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-03 04:05:51,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:05:51,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928430284] [2021-11-03 04:05:51,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928430284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:05:51,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:05:51,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:05:51,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735222642] [2021-11-03 04:05:51,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:05:51,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:05:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:05:51,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:05:51,162 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-03 04:06:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:06:03,282 INFO L93 Difference]: Finished difference Result 6037 states and 7526 transitions. [2021-11-03 04:06:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:06:03,282 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-03 04:06:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:06:03,293 INFO L225 Difference]: With dead ends: 6037 [2021-11-03 04:06:03,294 INFO L226 Difference]: Without dead ends: 6033 [2021-11-03 04:06:03,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.58ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:06:03,297 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7609 mSDsluCounter, 7400 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10419.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7609 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.59ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11852.06ms IncrementalHoareTripleChecker+Time [2021-11-03 04:06:03,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7609 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 19.59ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 11852.06ms Time] [2021-11-03 04:06:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2021-11-03 04:06:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 6033. [2021-11-03 04:06:03,444 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-03 04:06:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 7522 transitions. [2021-11-03 04:06:03,452 INFO L78 Accepts]: Start accepts. Automaton has 6033 states and 7522 transitions. Word has length 36 [2021-11-03 04:06:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:06:03,452 INFO L470 AbstractCegarLoop]: Abstraction has 6033 states and 7522 transitions. [2021-11-03 04:06:03,452 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-03 04:06:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6033 states and 7522 transitions. [2021-11-03 04:06:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-03 04:06:03,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:06:03,453 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-03 04:06:03,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:06:03,453 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-03 04:06:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:06:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1846871037, now seen corresponding path program 1 times [2021-11-03 04:06:03,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:06:03,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912288774] [2021-11-03 04:06:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:06:03,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:06:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:06:03,535 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-03 04:06:03,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:06:03,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912288774] [2021-11-03 04:06:03,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912288774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:06:03,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:06:03,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:06:03,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197235604] [2021-11-03 04:06:03,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:06:03,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:06:03,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:06:03,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:06:03,537 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-03 04:06:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:06:15,864 INFO L93 Difference]: Finished difference Result 6033 states and 7522 transitions. [2021-11-03 04:06:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:06:15,865 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-03 04:06:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:06:15,875 INFO L225 Difference]: With dead ends: 6033 [2021-11-03 04:06:15,875 INFO L226 Difference]: Without dead ends: 6029 [2021-11-03 04:06:15,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:06:15,879 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7595 mSDsluCounter, 7404 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10322.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7595 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.40ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12032.39ms IncrementalHoareTripleChecker+Time [2021-11-03 04:06:15,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7595 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 21.40ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 12032.39ms Time] [2021-11-03 04:06:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2021-11-03 04:06:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 6029. [2021-11-03 04:06:16,050 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-03 04:06:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6029 states to 6029 states and 7518 transitions. [2021-11-03 04:06:16,057 INFO L78 Accepts]: Start accepts. Automaton has 6029 states and 7518 transitions. Word has length 38 [2021-11-03 04:06:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:06:16,057 INFO L470 AbstractCegarLoop]: Abstraction has 6029 states and 7518 transitions. [2021-11-03 04:06:16,057 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-03 04:06:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6029 states and 7518 transitions. [2021-11-03 04:06:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-03 04:06:16,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:06:16,058 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-03 04:06:16,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:06:16,058 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-03 04:06:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:06:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1022296961, now seen corresponding path program 1 times [2021-11-03 04:06:16,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:06:16,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897342440] [2021-11-03 04:06:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:06:16,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:06:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:06:16,146 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-03 04:06:16,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:06:16,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897342440] [2021-11-03 04:06:16,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897342440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:06:16,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:06:16,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:06:16,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325365075] [2021-11-03 04:06:16,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:06:16,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:06:16,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:06:16,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:06:16,149 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-03 04:06:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:06:29,817 INFO L93 Difference]: Finished difference Result 6029 states and 7518 transitions. [2021-11-03 04:06:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:06:29,818 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-03 04:06:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:06:29,829 INFO L225 Difference]: With dead ends: 6029 [2021-11-03 04:06:29,829 INFO L226 Difference]: Without dead ends: 6025 [2021-11-03 04:06:29,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.85ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:06:29,833 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7581 mSDsluCounter, 7408 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11675.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7581 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.10ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13386.10ms IncrementalHoareTripleChecker+Time [2021-11-03 04:06:29,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7581 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 21.10ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 13386.10ms Time] [2021-11-03 04:06:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2021-11-03 04:06:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 6025. [2021-11-03 04:06:29,956 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-03 04:06:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 7514 transitions. [2021-11-03 04:06:29,964 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 7514 transitions. Word has length 40 [2021-11-03 04:06:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:06:29,965 INFO L470 AbstractCegarLoop]: Abstraction has 6025 states and 7514 transitions. [2021-11-03 04:06:29,965 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-03 04:06:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 7514 transitions. [2021-11-03 04:06:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-03 04:06:29,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:06:29,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] [2021-11-03 04:06:29,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 04:06:29,966 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-03 04:06:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:06:29,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1286472018, now seen corresponding path program 1 times [2021-11-03 04:06:29,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:06:29,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412930205] [2021-11-03 04:06:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:06:29,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:06:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:06:30,079 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-03 04:06:30,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:06:30,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412930205] [2021-11-03 04:06:30,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412930205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:06:30,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:06:30,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:06:30,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721586492] [2021-11-03 04:06:30,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:06:30,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:06:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:06:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:06:30,081 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-03 04:06:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:06:42,075 INFO L93 Difference]: Finished difference Result 14545 states and 18184 transitions. [2021-11-03 04:06:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:06:42,075 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-03 04:06:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:06:42,089 INFO L225 Difference]: With dead ends: 14545 [2021-11-03 04:06:42,090 INFO L226 Difference]: Without dead ends: 8551 [2021-11-03 04:06:42,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.44ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:06:42,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7498 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 13884 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9757.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7498 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.79ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11575.81ms IncrementalHoareTripleChecker+Time [2021-11-03 04:06:42,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7498 Valid, 0 Invalid, 13888 Unknown, 0 Unchecked, 19.79ms Time], IncrementalHoareTripleChecker [4 Valid, 13884 Invalid, 0 Unknown, 0 Unchecked, 11575.81ms Time] [2021-11-03 04:06:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8551 states. [2021-11-03 04:06:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8551 to 8478. [2021-11-03 04:06:42,306 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-03 04:06:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8478 states to 8478 states and 10665 transitions. [2021-11-03 04:06:42,317 INFO L78 Accepts]: Start accepts. Automaton has 8478 states and 10665 transitions. Word has length 42 [2021-11-03 04:06:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:06:42,317 INFO L470 AbstractCegarLoop]: Abstraction has 8478 states and 10665 transitions. [2021-11-03 04:06:42,317 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-03 04:06:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 8478 states and 10665 transitions. [2021-11-03 04:06:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-03 04:06:42,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:06:42,318 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-03 04:06:42,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:06:42,318 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-03 04:06:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:06:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1119408252, now seen corresponding path program 1 times [2021-11-03 04:06:42,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:06:42,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912854612] [2021-11-03 04:06:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:06:42,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:06:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:06:42,408 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-03 04:06:42,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:06:42,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912854612] [2021-11-03 04:06:42,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912854612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:06:42,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:06:42,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:06:42,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142219215] [2021-11-03 04:06:42,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:06:42,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:06:42,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:06:42,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:06:42,410 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-03 04:06:49,750 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-03 04:06:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:06:55,364 INFO L93 Difference]: Finished difference Result 8478 states and 10665 transitions. [2021-11-03 04:06:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:06:55,365 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-03 04:06:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:06:55,401 INFO L225 Difference]: With dead ends: 8478 [2021-11-03 04:06:55,415 INFO L226 Difference]: Without dead ends: 8474 [2021-11-03 04:06:55,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.28ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:06:55,420 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7567 mSDsluCounter, 7412 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11102.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7567 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.03ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12600.05ms IncrementalHoareTripleChecker+Time [2021-11-03 04:06:55,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7567 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 43.03ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 12600.05ms Time] [2021-11-03 04:06:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8474 states. [2021-11-03 04:06:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8474 to 8474. [2021-11-03 04:06:55,754 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-03 04:06:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8474 states to 8474 states and 10661 transitions. [2021-11-03 04:06:55,764 INFO L78 Accepts]: Start accepts. Automaton has 8474 states and 10661 transitions. Word has length 42 [2021-11-03 04:06:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:06:55,764 INFO L470 AbstractCegarLoop]: Abstraction has 8474 states and 10661 transitions. [2021-11-03 04:06:55,764 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-03 04:06:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8474 states and 10661 transitions. [2021-11-03 04:06:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-03 04:06:55,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:06:55,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:06:55,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 04:06:55,765 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-03 04:06:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:06:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2008781848, now seen corresponding path program 1 times [2021-11-03 04:06:55,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:06:55,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384179861] [2021-11-03 04:06:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:06:55,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:06:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:06:55,852 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-03 04:06:55,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:06:55,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384179861] [2021-11-03 04:06:55,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384179861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:06:55,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:06:55,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:06:55,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011655385] [2021-11-03 04:06:55,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:06:55,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:06:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:06:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:06:55,855 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-03 04:07:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:08,950 INFO L93 Difference]: Finished difference Result 8474 states and 10661 transitions. [2021-11-03 04:07:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:07:08,951 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-03 04:07:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:08,966 INFO L225 Difference]: With dead ends: 8474 [2021-11-03 04:07:08,966 INFO L226 Difference]: Without dead ends: 8470 [2021-11-03 04:07:08,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.73ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:08,971 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7553 mSDsluCounter, 7416 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10996.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7553 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12724.64ms IncrementalHoareTripleChecker+Time [2021-11-03 04:07:08,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7553 Valid, 0 Invalid, 14924 Unknown, 0 Unchecked, 22.60ms Time], IncrementalHoareTripleChecker [2 Valid, 14922 Invalid, 0 Unknown, 0 Unchecked, 12724.64ms Time] [2021-11-03 04:07:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2021-11-03 04:07:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 8470. [2021-11-03 04:07:09,186 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-03 04:07:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8470 states to 8470 states and 10657 transitions. [2021-11-03 04:07:09,196 INFO L78 Accepts]: Start accepts. Automaton has 8470 states and 10657 transitions. Word has length 44 [2021-11-03 04:07:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:09,197 INFO L470 AbstractCegarLoop]: Abstraction has 8470 states and 10657 transitions. [2021-11-03 04:07:09,197 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-03 04:07:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8470 states and 10657 transitions. [2021-11-03 04:07:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-03 04:07:09,197 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:07:09,197 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-03 04:07:09,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 04:07:09,198 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-03 04:07:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1628292531, now seen corresponding path program 1 times [2021-11-03 04:07:09,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:07:09,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845659616] [2021-11-03 04:07:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:09,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:09,304 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-03 04:07:09,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:07:09,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845659616] [2021-11-03 04:07:09,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845659616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:09,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:09,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:07:09,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292992095] [2021-11-03 04:07:09,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:07:09,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:07:09,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:07:09,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:09,306 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-03 04:07:13,689 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:07:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:23,881 INFO L93 Difference]: Finished difference Result 16982 states and 21319 transitions. [2021-11-03 04:07:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:07:23,881 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-03 04:07:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:23,895 INFO L225 Difference]: With dead ends: 16982 [2021-11-03 04:07:23,895 INFO L226 Difference]: Without dead ends: 8543 [2021-11-03 04:07:23,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.98ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:07:23,908 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 22485 mSDsluCounter, 6379 mSDsCounter, 0 mSdLazyCounter, 17067 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11916.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22485 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.42ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14016.96ms IncrementalHoareTripleChecker+Time [2021-11-03 04:07:23,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22485 Valid, 0 Invalid, 17083 Unknown, 0 Unchecked, 40.42ms Time], IncrementalHoareTripleChecker [16 Valid, 17067 Invalid, 0 Unknown, 0 Unchecked, 14016.96ms Time] [2021-11-03 04:07:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2021-11-03 04:07:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 8467. [2021-11-03 04:07:24,121 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-03 04:07:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 10653 transitions. [2021-11-03 04:07:24,132 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 10653 transitions. Word has length 45 [2021-11-03 04:07:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:24,132 INFO L470 AbstractCegarLoop]: Abstraction has 8467 states and 10653 transitions. [2021-11-03 04:07:24,132 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-03 04:07:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 10653 transitions. [2021-11-03 04:07:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-03 04:07:24,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:07:24,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:07:24,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 04:07:24,133 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-03 04:07:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1998315348, now seen corresponding path program 1 times [2021-11-03 04:07:24,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:07:24,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231441070] [2021-11-03 04:07:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:24,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:24,212 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-03 04:07:24,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:07:24,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231441070] [2021-11-03 04:07:24,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231441070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:24,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:24,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:07:24,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499757438] [2021-11-03 04:07:24,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:07:24,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:07:24,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:07:24,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:07:24,214 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-03 04:07:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:37,261 INFO L93 Difference]: Finished difference Result 8467 states and 10653 transitions. [2021-11-03 04:07:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:07:37,261 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-03 04:07:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:37,271 INFO L225 Difference]: With dead ends: 8467 [2021-11-03 04:07:37,272 INFO L226 Difference]: Without dead ends: 8463 [2021-11-03 04:07:37,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:37,275 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7535 mSDsluCounter, 7416 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10935.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7535 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.57ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12647.09ms IncrementalHoareTripleChecker+Time [2021-11-03 04:07:37,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7535 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 22.57ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 12647.09ms Time] [2021-11-03 04:07:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8463 states. [2021-11-03 04:07:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8463 to 8463. [2021-11-03 04:07:37,496 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-03 04:07:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 10649 transitions. [2021-11-03 04:07:37,507 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 10649 transitions. Word has length 46 [2021-11-03 04:07:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:37,507 INFO L470 AbstractCegarLoop]: Abstraction has 8463 states and 10649 transitions. [2021-11-03 04:07:37,507 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-03 04:07:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 10649 transitions. [2021-11-03 04:07:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-03 04:07:37,509 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:07:37,509 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-03 04:07:37,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 04:07:37,510 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-03 04:07:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash -529943088, now seen corresponding path program 1 times [2021-11-03 04:07:37,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:07:37,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120490560] [2021-11-03 04:07:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:37,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:37,604 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-03 04:07:37,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:07:37,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120490560] [2021-11-03 04:07:37,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120490560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:37,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:37,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:07:37,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687949436] [2021-11-03 04:07:37,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:07:37,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:07:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:07:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:07:37,606 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-03 04:07:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:07:51,013 INFO L93 Difference]: Finished difference Result 8463 states and 10649 transitions. [2021-11-03 04:07:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:07:51,013 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-03 04:07:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:07:51,026 INFO L225 Difference]: With dead ends: 8463 [2021-11-03 04:07:51,026 INFO L226 Difference]: Without dead ends: 8459 [2021-11-03 04:07:51,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.74ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:07:51,030 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7521 mSDsluCounter, 7420 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11244.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7521 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.84ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12960.33ms IncrementalHoareTripleChecker+Time [2021-11-03 04:07:51,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7521 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 23.84ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 12960.33ms Time] [2021-11-03 04:07:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2021-11-03 04:07:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8459. [2021-11-03 04:07:51,275 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-03 04:07:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 10645 transitions. [2021-11-03 04:07:51,286 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 10645 transitions. Word has length 48 [2021-11-03 04:07:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:07:51,286 INFO L470 AbstractCegarLoop]: Abstraction has 8459 states and 10645 transitions. [2021-11-03 04:07:51,287 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-03 04:07:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 10645 transitions. [2021-11-03 04:07:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-03 04:07:51,287 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:07:51,287 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-03 04:07:51,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 04:07:51,288 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-03 04:07:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:07:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1826526036, now seen corresponding path program 1 times [2021-11-03 04:07:51,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:07:51,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145298679] [2021-11-03 04:07:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:07:51,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:07:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:07:51,366 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-03 04:07:51,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:07:51,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145298679] [2021-11-03 04:07:51,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145298679] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:07:51,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:07:51,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:07:51,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662984298] [2021-11-03 04:07:51,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:07:51,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:07:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:07:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:07:51,368 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-03 04:07:55,212 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:08:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:08:05,764 INFO L93 Difference]: Finished difference Result 8459 states and 10645 transitions. [2021-11-03 04:08:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:08:05,765 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-03 04:08:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:08:05,777 INFO L225 Difference]: With dead ends: 8459 [2021-11-03 04:08:05,777 INFO L226 Difference]: Without dead ends: 8455 [2021-11-03 04:08:05,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.32ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:08:05,780 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7507 mSDsluCounter, 7424 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12252.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7507 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13971.26ms IncrementalHoareTripleChecker+Time [2021-11-03 04:08:05,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7507 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 21.60ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 13971.26ms Time] [2021-11-03 04:08:05,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8455 states. [2021-11-03 04:08:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8455 to 8455. [2021-11-03 04:08:06,025 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-03 04:08:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 10641 transitions. [2021-11-03 04:08:06,132 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 10641 transitions. Word has length 50 [2021-11-03 04:08:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:08:06,133 INFO L470 AbstractCegarLoop]: Abstraction has 8455 states and 10641 transitions. [2021-11-03 04:08:06,133 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-03 04:08:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 10641 transitions. [2021-11-03 04:08:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-03 04:08:06,134 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:08:06,134 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-03 04:08:06,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 04:08:06,134 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-03 04:08:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:08:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1349377736, now seen corresponding path program 1 times [2021-11-03 04:08:06,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:08:06,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659185217] [2021-11-03 04:08:06,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:08:06,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:08:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:08:06,210 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-03 04:08:06,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:08:06,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659185217] [2021-11-03 04:08:06,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659185217] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:08:06,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:08:06,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:08:06,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543356884] [2021-11-03 04:08:06,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:08:06,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:08:06,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:08:06,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:08:06,213 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-03 04:08:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:08:19,341 INFO L93 Difference]: Finished difference Result 8455 states and 10641 transitions. [2021-11-03 04:08:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:08:19,342 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-03 04:08:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:08:19,353 INFO L225 Difference]: With dead ends: 8455 [2021-11-03 04:08:19,369 INFO L226 Difference]: Without dead ends: 8451 [2021-11-03 04:08:19,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.10ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:08:19,374 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7493 mSDsluCounter, 7428 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10922.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7493 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.18ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12659.13ms IncrementalHoareTripleChecker+Time [2021-11-03 04:08:19,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7493 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 23.18ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 12659.13ms Time] [2021-11-03 04:08:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8451 states. [2021-11-03 04:08:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8451 to 8451. [2021-11-03 04:08:19,636 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-03 04:08:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8451 states to 8451 states and 10637 transitions. [2021-11-03 04:08:19,650 INFO L78 Accepts]: Start accepts. Automaton has 8451 states and 10637 transitions. Word has length 52 [2021-11-03 04:08:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:08:19,650 INFO L470 AbstractCegarLoop]: Abstraction has 8451 states and 10637 transitions. [2021-11-03 04:08:19,650 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-03 04:08:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 8451 states and 10637 transitions. [2021-11-03 04:08:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-03 04:08:19,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:08:19,651 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-03 04:08:19,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 04:08:19,651 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-03 04:08:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:08:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash 328845180, now seen corresponding path program 1 times [2021-11-03 04:08:19,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:08:19,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344409882] [2021-11-03 04:08:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:08:19,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:08:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:08:19,758 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-03 04:08:19,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:08:19,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344409882] [2021-11-03 04:08:19,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344409882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:08:19,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:08:19,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:08:19,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114301021] [2021-11-03 04:08:19,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:08:19,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:08:19,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:08:19,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:08:19,761 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-03 04:08:22,922 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-03 04:08:30,055 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:08:34,942 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-03 04:08:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:08:37,376 INFO L93 Difference]: Finished difference Result 8451 states and 10637 transitions. [2021-11-03 04:08:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:08:37,376 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-03 04:08:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:08:37,389 INFO L225 Difference]: With dead ends: 8451 [2021-11-03 04:08:37,389 INFO L226 Difference]: Without dead ends: 8447 [2021-11-03 04:08:37,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.73ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:08:37,394 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7479 mSDsluCounter, 7432 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15432.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7479 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.37ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17127.38ms IncrementalHoareTripleChecker+Time [2021-11-03 04:08:37,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7479 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 20.37ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 17127.38ms Time] [2021-11-03 04:08:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8447 states. [2021-11-03 04:08:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8447 to 8447. [2021-11-03 04:08:37,696 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-03 04:08:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8447 states to 8447 states and 10633 transitions. [2021-11-03 04:08:37,707 INFO L78 Accepts]: Start accepts. Automaton has 8447 states and 10633 transitions. Word has length 54 [2021-11-03 04:08:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:08:37,707 INFO L470 AbstractCegarLoop]: Abstraction has 8447 states and 10633 transitions. [2021-11-03 04:08:37,707 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-03 04:08:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8447 states and 10633 transitions. [2021-11-03 04:08:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-03 04:08:37,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:08:37,708 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-03 04:08:37,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 04:08:37,709 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-03 04:08:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:08:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1806635488, now seen corresponding path program 1 times [2021-11-03 04:08:37,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:08:37,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956823699] [2021-11-03 04:08:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:08:37,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:08:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:08:37,810 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-03 04:08:37,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:08:37,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956823699] [2021-11-03 04:08:37,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956823699] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:08:37,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:08:37,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:08:37,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328216418] [2021-11-03 04:08:37,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:08:37,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:08:37,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:08:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:08:37,812 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-03 04:08:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:08:50,561 INFO L93 Difference]: Finished difference Result 8447 states and 10633 transitions. [2021-11-03 04:08:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:08:50,562 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-03 04:08:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:08:50,573 INFO L225 Difference]: With dead ends: 8447 [2021-11-03 04:08:50,573 INFO L226 Difference]: Without dead ends: 8443 [2021-11-03 04:08:50,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.06ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:08:50,576 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7465 mSDsluCounter, 7436 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10486.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7465 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12263.82ms IncrementalHoareTripleChecker+Time [2021-11-03 04:08:50,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7465 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 22.48ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 12263.82ms Time] [2021-11-03 04:08:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8443 states. [2021-11-03 04:08:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8443 to 8443. [2021-11-03 04:08:50,853 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-03 04:08:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8443 states to 8443 states and 10629 transitions. [2021-11-03 04:08:50,864 INFO L78 Accepts]: Start accepts. Automaton has 8443 states and 10629 transitions. Word has length 56 [2021-11-03 04:08:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:08:50,864 INFO L470 AbstractCegarLoop]: Abstraction has 8443 states and 10629 transitions. [2021-11-03 04:08:50,864 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-03 04:08:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 8443 states and 10629 transitions. [2021-11-03 04:08:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-03 04:08:50,865 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:08:50,865 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-03 04:08:50,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 04:08:50,866 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-03 04:08:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:08:50,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1009189596, now seen corresponding path program 1 times [2021-11-03 04:08:50,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:08:50,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101150672] [2021-11-03 04:08:50,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:08:50,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:08:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:08:50,960 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-03 04:08:50,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:08:50,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101150672] [2021-11-03 04:08:50,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101150672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:08:50,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:08:50,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:08:50,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823672530] [2021-11-03 04:08:50,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:08:50,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:08:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:08:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:08:50,963 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-03 04:09:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:09:03,186 INFO L93 Difference]: Finished difference Result 8443 states and 10629 transitions. [2021-11-03 04:09:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:09:03,186 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-03 04:09:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:09:03,197 INFO L225 Difference]: With dead ends: 8443 [2021-11-03 04:09:03,198 INFO L226 Difference]: Without dead ends: 8439 [2021-11-03 04:09:03,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.77ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:09:03,201 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7451 mSDsluCounter, 7440 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10205.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7451 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.72ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11756.35ms IncrementalHoareTripleChecker+Time [2021-11-03 04:09:03,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7451 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 21.72ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 11756.35ms Time] [2021-11-03 04:09:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2021-11-03 04:09:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 8439. [2021-11-03 04:09:03,489 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-03 04:09:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 10625 transitions. [2021-11-03 04:09:03,500 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 10625 transitions. Word has length 58 [2021-11-03 04:09:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:09:03,500 INFO L470 AbstractCegarLoop]: Abstraction has 8439 states and 10625 transitions. [2021-11-03 04:09:03,501 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-03 04:09:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 10625 transitions. [2021-11-03 04:09:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-03 04:09:03,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:09:03,501 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-03 04:09:03,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 04:09:03,502 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-03 04:09:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:09:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash 832134280, now seen corresponding path program 1 times [2021-11-03 04:09:03,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:09:03,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331335682] [2021-11-03 04:09:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:09:03,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:09:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:09:03,589 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-03 04:09:03,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:09:03,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331335682] [2021-11-03 04:09:03,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331335682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:09:03,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:09:03,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:09:03,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087605630] [2021-11-03 04:09:03,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:09:03,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:09:03,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:09:03,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:09:03,591 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-03 04:09:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:09:15,973 INFO L93 Difference]: Finished difference Result 8439 states and 10625 transitions. [2021-11-03 04:09:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:09:15,973 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-03 04:09:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:09:15,982 INFO L225 Difference]: With dead ends: 8439 [2021-11-03 04:09:15,982 INFO L226 Difference]: Without dead ends: 8435 [2021-11-03 04:09:15,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:09:15,984 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7437 mSDsluCounter, 7444 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10390.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7437 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.21ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11885.70ms IncrementalHoareTripleChecker+Time [2021-11-03 04:09:15,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7437 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 19.21ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 11885.70ms Time] [2021-11-03 04:09:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states. [2021-11-03 04:09:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 8435. [2021-11-03 04:09:16,271 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-03 04:09:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8435 states to 8435 states and 10621 transitions. [2021-11-03 04:09:16,282 INFO L78 Accepts]: Start accepts. Automaton has 8435 states and 10621 transitions. Word has length 60 [2021-11-03 04:09:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:09:16,283 INFO L470 AbstractCegarLoop]: Abstraction has 8435 states and 10621 transitions. [2021-11-03 04:09:16,283 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-03 04:09:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8435 states and 10621 transitions. [2021-11-03 04:09:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-03 04:09:16,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:09:16,284 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-03 04:09:16,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-03 04:09:16,284 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-03 04:09:16,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:09:16,285 INFO L85 PathProgramCache]: Analyzing trace with hash 817853516, now seen corresponding path program 1 times [2021-11-03 04:09:16,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:09:16,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941913117] [2021-11-03 04:09:16,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:09:16,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:09:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:09:16,360 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-03 04:09:16,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:09:16,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941913117] [2021-11-03 04:09:16,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941913117] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:09:16,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:09:16,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:09:16,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797578038] [2021-11-03 04:09:16,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:09:16,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:09:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:09:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:09:16,362 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-03 04:09:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:09:29,157 INFO L93 Difference]: Finished difference Result 8435 states and 10621 transitions. [2021-11-03 04:09:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:09:29,158 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-03 04:09:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:09:29,172 INFO L225 Difference]: With dead ends: 8435 [2021-11-03 04:09:29,172 INFO L226 Difference]: Without dead ends: 8431 [2021-11-03 04:09:29,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.03ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:09:29,178 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7423 mSDsluCounter, 7448 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10577.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7423 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.13ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12253.98ms IncrementalHoareTripleChecker+Time [2021-11-03 04:09:29,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7423 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 22.13ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 12253.98ms Time] [2021-11-03 04:09:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2021-11-03 04:09:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8431. [2021-11-03 04:09:29,488 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-03 04:09:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8431 states to 8431 states and 10617 transitions. [2021-11-03 04:09:29,499 INFO L78 Accepts]: Start accepts. Automaton has 8431 states and 10617 transitions. Word has length 62 [2021-11-03 04:09:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:09:29,499 INFO L470 AbstractCegarLoop]: Abstraction has 8431 states and 10617 transitions. [2021-11-03 04:09:29,499 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-03 04:09:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 8431 states and 10617 transitions. [2021-11-03 04:09:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-03 04:09:29,500 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:09:29,500 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-03 04:09:29,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-03 04:09:29,501 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-03 04:09:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:09:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash -21058448, now seen corresponding path program 1 times [2021-11-03 04:09:29,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:09:29,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125278407] [2021-11-03 04:09:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:09:29,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:09:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:09:29,573 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-03 04:09:29,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:09:29,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125278407] [2021-11-03 04:09:29,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125278407] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:09:29,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:09:29,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:09:29,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258079222] [2021-11-03 04:09:29,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:09:29,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:09:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:09:29,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:09:29,575 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-03 04:09:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:09:42,174 INFO L93 Difference]: Finished difference Result 8431 states and 10617 transitions. [2021-11-03 04:09:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:09:42,174 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-03 04:09:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:09:42,183 INFO L225 Difference]: With dead ends: 8431 [2021-11-03 04:09:42,183 INFO L226 Difference]: Without dead ends: 8427 [2021-11-03 04:09:42,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:09:42,185 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7409 mSDsluCounter, 7452 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10372.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7409 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.55ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12055.50ms IncrementalHoareTripleChecker+Time [2021-11-03 04:09:42,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7409 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 21.55ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 12055.50ms Time] [2021-11-03 04:09:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8427 states. [2021-11-03 04:09:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8427 to 8427. [2021-11-03 04:09:42,490 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-03 04:09:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8427 states to 8427 states and 10613 transitions. [2021-11-03 04:09:42,501 INFO L78 Accepts]: Start accepts. Automaton has 8427 states and 10613 transitions. Word has length 64 [2021-11-03 04:09:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:09:42,501 INFO L470 AbstractCegarLoop]: Abstraction has 8427 states and 10613 transitions. [2021-11-03 04:09:42,501 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-03 04:09:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 8427 states and 10613 transitions. [2021-11-03 04:09:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-03 04:09:42,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:09:42,502 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-03 04:09:42,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-03 04:09:42,503 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-03 04:09:42,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:09:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1238396148, now seen corresponding path program 1 times [2021-11-03 04:09:42,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:09:42,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494326593] [2021-11-03 04:09:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:09:42,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:09:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:09:42,573 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-03 04:09:42,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:09:42,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494326593] [2021-11-03 04:09:42,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494326593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:09:42,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:09:42,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:09:42,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824914172] [2021-11-03 04:09:42,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:09:42,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:09:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:09:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:09:42,576 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-03 04:09:50,170 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:09:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:09:56,657 INFO L93 Difference]: Finished difference Result 8427 states and 10613 transitions. [2021-11-03 04:09:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:09:56,657 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-03 04:09:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:09:56,670 INFO L225 Difference]: With dead ends: 8427 [2021-11-03 04:09:56,670 INFO L226 Difference]: Without dead ends: 8295 [2021-11-03 04:09:56,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.55ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:09:56,674 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7395 mSDsluCounter, 7456 mSDsCounter, 0 mSdLazyCounter, 14914 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11798.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7395 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.58ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13535.21ms IncrementalHoareTripleChecker+Time [2021-11-03 04:09:56,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7395 Valid, 0 Invalid, 14916 Unknown, 0 Unchecked, 21.58ms Time], IncrementalHoareTripleChecker [2 Valid, 14914 Invalid, 0 Unknown, 0 Unchecked, 13535.21ms Time] [2021-11-03 04:09:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8295 states. [2021-11-03 04:09:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8295 to 8295. [2021-11-03 04:09:56,992 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-03 04:09:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8295 states to 8295 states and 10477 transitions. [2021-11-03 04:09:57,003 INFO L78 Accepts]: Start accepts. Automaton has 8295 states and 10477 transitions. Word has length 66 [2021-11-03 04:09:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:09:57,004 INFO L470 AbstractCegarLoop]: Abstraction has 8295 states and 10477 transitions. [2021-11-03 04:09:57,004 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-03 04:09:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 8295 states and 10477 transitions. [2021-11-03 04:09:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-03 04:09:57,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:09:57,005 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-03 04:09:57,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-03 04:09:57,005 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-03 04:09:57,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:09:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2017713289, now seen corresponding path program 1 times [2021-11-03 04:09:57,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:09:57,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737041951] [2021-11-03 04:09:57,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:09:57,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:09:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:09:57,128 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-03 04:09:57,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:09:57,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737041951] [2021-11-03 04:09:57,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737041951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:09:57,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:09:57,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:09:57,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064103578] [2021-11-03 04:09:57,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:09:57,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:09:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:09:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:09:57,130 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-03 04:10:15,876 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:10:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:10:18,668 INFO L93 Difference]: Finished difference Result 16455 states and 20810 transitions. [2021-11-03 04:10:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:10:18,669 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-03 04:10:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:10:18,694 INFO L225 Difference]: With dead ends: 16455 [2021-11-03 04:10:18,695 INFO L226 Difference]: Without dead ends: 16443 [2021-11-03 04:10:18,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.22ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:10:18,703 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 14475 mSDsluCounter, 7272 mSDsCounter, 0 mSdLazyCounter, 21821 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17530.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14475 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.60ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20462.09ms IncrementalHoareTripleChecker+Time [2021-11-03 04:10:18,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14475 Valid, 0 Invalid, 21837 Unknown, 0 Unchecked, 42.60ms Time], IncrementalHoareTripleChecker [16 Valid, 21821 Invalid, 0 Unknown, 0 Unchecked, 20462.09ms Time] [2021-11-03 04:10:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16443 states. [2021-11-03 04:10:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16443 to 8283. [2021-11-03 04:10:19,153 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-03 04:10:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 10461 transitions. [2021-11-03 04:10:19,167 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 10461 transitions. Word has length 77 [2021-11-03 04:10:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:10:19,168 INFO L470 AbstractCegarLoop]: Abstraction has 8283 states and 10461 transitions. [2021-11-03 04:10:19,168 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-03 04:10:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 10461 transitions. [2021-11-03 04:10:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-03 04:10:19,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:10:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:10:19,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-03 04:10:19,169 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-03 04:10:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:10:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1376130011, now seen corresponding path program 1 times [2021-11-03 04:10:19,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:10:19,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512783497] [2021-11-03 04:10:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:10:19,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:10:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:10:19,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-03 04:10:19,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:10:19,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512783497] [2021-11-03 04:10:19,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512783497] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:10:19,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:10:19,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:10:19,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425188594] [2021-11-03 04:10:19,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:10:19,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:10:19,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:10:19,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:10:19,283 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-03 04:10:23,015 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:10:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:10:38,446 INFO L93 Difference]: Finished difference Result 12190 states and 15313 transitions. [2021-11-03 04:10:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:10:38,446 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-03 04:10:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:10:38,458 INFO L225 Difference]: With dead ends: 12190 [2021-11-03 04:10:38,459 INFO L226 Difference]: Without dead ends: 12176 [2021-11-03 04:10:38,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:10:38,461 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 10866 mSDsluCounter, 7179 mSDsCounter, 0 mSdLazyCounter, 18061 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15979.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10866 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.80ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 18061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18155.62ms IncrementalHoareTripleChecker+Time [2021-11-03 04:10:38,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10866 Valid, 0 Invalid, 18080 Unknown, 0 Unchecked, 31.80ms Time], IncrementalHoareTripleChecker [19 Valid, 18061 Invalid, 0 Unknown, 0 Unchecked, 18155.62ms Time] [2021-11-03 04:10:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12176 states. [2021-11-03 04:10:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12176 to 8269. [2021-11-03 04:10:38,886 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-03 04:10:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 10443 transitions. [2021-11-03 04:10:38,896 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 10443 transitions. Word has length 77 [2021-11-03 04:10:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:10:38,896 INFO L470 AbstractCegarLoop]: Abstraction has 8269 states and 10443 transitions. [2021-11-03 04:10:38,896 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-03 04:10:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 10443 transitions. [2021-11-03 04:10:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-03 04:10:38,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:10:38,897 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-03 04:10:38,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-03 04:10:38,898 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-03 04:10:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:10:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash -510810258, now seen corresponding path program 1 times [2021-11-03 04:10:38,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:10:38,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134872370] [2021-11-03 04:10:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:10:38,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:10:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:10:39,066 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-03 04:10:39,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:10:39,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134872370] [2021-11-03 04:10:39,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134872370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:10:39,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:10:39,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:10:39,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175550394] [2021-11-03 04:10:39,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:10:39,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:10:39,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:10:39,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:10:39,068 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-03 04:10:57,826 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:11:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:11:13,089 INFO L93 Difference]: Finished difference Result 16457 states and 20800 transitions. [2021-11-03 04:11:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:11:13,089 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-03 04:11:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:11:13,109 INFO L225 Difference]: With dead ends: 16457 [2021-11-03 04:11:13,110 INFO L226 Difference]: Without dead ends: 16445 [2021-11-03 04:11:13,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.44ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:11:13,115 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7270 mSDsluCounter, 21717 mSDsCounter, 0 mSdLazyCounter, 36258 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28750.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 49.45ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 36258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32633.94ms IncrementalHoareTripleChecker+Time [2021-11-03 04:11:13,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7270 Valid, 0 Invalid, 36273 Unknown, 0 Unchecked, 49.45ms Time], IncrementalHoareTripleChecker [15 Valid, 36258 Invalid, 0 Unknown, 0 Unchecked, 32633.94ms Time] [2021-11-03 04:11:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16445 states. [2021-11-03 04:11:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16445 to 8257. [2021-11-03 04:11:13,602 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-03 04:11:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8257 states to 8257 states and 10427 transitions. [2021-11-03 04:11:13,613 INFO L78 Accepts]: Start accepts. Automaton has 8257 states and 10427 transitions. Word has length 81 [2021-11-03 04:11:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:11:13,613 INFO L470 AbstractCegarLoop]: Abstraction has 8257 states and 10427 transitions. [2021-11-03 04:11:13,613 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-03 04:11:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 8257 states and 10427 transitions. [2021-11-03 04:11:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-03 04:11:13,614 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:11:13,614 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-03 04:11:13,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-03 04:11:13,615 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-03 04:11:13,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:11:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 108190561, now seen corresponding path program 1 times [2021-11-03 04:11:13,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:11:13,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955936937] [2021-11-03 04:11:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:11:13,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:11:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:11:13,712 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-03 04:11:13,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:11:13,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955936937] [2021-11-03 04:11:13,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955936937] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:11:13,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:11:13,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:11:13,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247862627] [2021-11-03 04:11:13,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:11:13,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:11:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:11:13,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:11:13,714 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-03 04:11:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:11:49,700 INFO L93 Difference]: Finished difference Result 32788 states and 41448 transitions. [2021-11-03 04:11:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:11:49,701 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-03 04:11:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:11:49,736 INFO L225 Difference]: With dead ends: 32788 [2021-11-03 04:11:49,736 INFO L226 Difference]: Without dead ends: 24560 [2021-11-03 04:11:49,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.62ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:11:49,764 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 14347 mSDsluCounter, 21288 mSDsCounter, 0 mSdLazyCounter, 35613 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29536.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14347 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 48.93ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 35613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33779.27ms IncrementalHoareTripleChecker+Time [2021-11-03 04:11:49,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14347 Valid, 0 Invalid, 35650 Unknown, 0 Unchecked, 48.93ms Time], IncrementalHoareTripleChecker [37 Valid, 35613 Invalid, 0 Unknown, 0 Unchecked, 33779.27ms Time] [2021-11-03 04:11:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24560 states. [2021-11-03 04:11:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24560 to 8359. [2021-11-03 04:11:50,381 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-03 04:11:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 10546 transitions. [2021-11-03 04:11:50,392 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 10546 transitions. Word has length 84 [2021-11-03 04:11:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:11:50,392 INFO L470 AbstractCegarLoop]: Abstraction has 8359 states and 10546 transitions. [2021-11-03 04:11:50,392 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-03 04:11:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 10546 transitions. [2021-11-03 04:11:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-03 04:11:50,393 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:11:50,394 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-03 04:11:50,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-03 04:11:50,394 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-03 04:11:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:11:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash -490298835, now seen corresponding path program 1 times [2021-11-03 04:11:50,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:11:50,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938849070] [2021-11-03 04:11:50,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:11:50,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:11:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:11:50,525 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-03 04:11:50,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:11:50,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938849070] [2021-11-03 04:11:50,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938849070] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:11:50,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010630021] [2021-11-03 04:11:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:11:50,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:11:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:11:50,527 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-03 04:11:50,530 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-03 04:11:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:11:51,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 2134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-03 04:11:51,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:11:51,481 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-03 04:11:51,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 04:11:51,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010630021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:11:51,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:11:51,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2021-11-03 04:11:51,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710106935] [2021-11-03 04:11:51,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 04:11:51,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:11:51,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 04:11:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-03 04:11:51,482 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-03 04:12:11,553 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:12:40,586 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:12:46,604 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-03 04:12:48,730 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-03 04:12:50,857 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-03 04:12:53,693 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:12:55,817 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:12:57,946 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-03 04:12:59,980 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:13:06,452 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-03 04:13:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:13:38,935 INFO L93 Difference]: Finished difference Result 27188 states and 34345 transitions. [2021-11-03 04:13:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-03 04:13:38,935 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-03 04:13:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:13:38,959 INFO L225 Difference]: With dead ends: 27188 [2021-11-03 04:13:38,960 INFO L226 Difference]: Without dead ends: 18857 [2021-11-03 04:13:38,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 327.56ms TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2021-11-03 04:13:38,973 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 34524 mSDsluCounter, 93233 mSDsCounter, 0 mSdLazyCounter, 104534 mSolverCounterSat, 20 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94670.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34524 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 104560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 196.58ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104534 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104452.21ms IncrementalHoareTripleChecker+Time [2021-11-03 04:13:38,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34524 Valid, 0 Invalid, 104560 Unknown, 0 Unchecked, 196.58ms Time], IncrementalHoareTripleChecker [20 Valid, 104534 Invalid, 6 Unknown, 0 Unchecked, 104452.21ms Time] [2021-11-03 04:13:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18857 states. [2021-11-03 04:13:39,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18857 to 8383. [2021-11-03 04:13:39,624 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-03 04:13:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8383 states to 8383 states and 10572 transitions. [2021-11-03 04:13:39,635 INFO L78 Accepts]: Start accepts. Automaton has 8383 states and 10572 transitions. Word has length 90 [2021-11-03 04:13:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:13:39,635 INFO L470 AbstractCegarLoop]: Abstraction has 8383 states and 10572 transitions. [2021-11-03 04:13:39,636 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-03 04:13:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8383 states and 10572 transitions. [2021-11-03 04:13:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-03 04:13:39,637 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:13:39,637 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-03 04:13:39,660 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-03 04:13:39,859 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-03 04:13:39,860 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-03 04:13:39,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:13:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash 116250812, now seen corresponding path program 1 times [2021-11-03 04:13:39,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:13:39,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628417163] [2021-11-03 04:13:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:13:39,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:13:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:13:40,034 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-03 04:13:40,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:13:40,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628417163] [2021-11-03 04:13:40,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628417163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:13:40,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:13:40,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:13:40,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111173928] [2021-11-03 04:13:40,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:13:40,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:13:40,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:13:40,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:13:40,036 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-03 04:13:49,593 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:13:54,596 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:14:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:14:12,177 INFO L93 Difference]: Finished difference Result 16813 states and 21197 transitions. [2021-11-03 04:14:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:14:12,178 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-03 04:14:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:14:12,187 INFO L225 Difference]: With dead ends: 16813 [2021-11-03 04:14:12,188 INFO L226 Difference]: Without dead ends: 8459 [2021-11-03 04:14:12,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.31ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:14:12,196 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 21911 mSDsCounter, 0 mSdLazyCounter, 29274 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27929.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.44ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30957.21ms IncrementalHoareTripleChecker+Time [2021-11-03 04:14:12,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 29275 Unknown, 0 Unchecked, 47.44ms Time], IncrementalHoareTripleChecker [0 Valid, 29274 Invalid, 1 Unknown, 0 Unchecked, 30957.21ms Time] [2021-11-03 04:14:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2021-11-03 04:14:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8386. [2021-11-03 04:14:12,807 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-03 04:14:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8386 states to 8386 states and 10575 transitions. [2021-11-03 04:14:12,818 INFO L78 Accepts]: Start accepts. Automaton has 8386 states and 10575 transitions. Word has length 116 [2021-11-03 04:14:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:14:12,819 INFO L470 AbstractCegarLoop]: Abstraction has 8386 states and 10575 transitions. [2021-11-03 04:14:12,819 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-03 04:14:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 8386 states and 10575 transitions. [2021-11-03 04:14:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-03 04:14:12,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:14:12,820 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-03 04:14:12,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-03 04:14:12,821 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-03 04:14:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:14:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash 29196624, now seen corresponding path program 1 times [2021-11-03 04:14:12,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:14:12,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652971103] [2021-11-03 04:14:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:14:12,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:14:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:14:12,947 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-03 04:14:12,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:14:12,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652971103] [2021-11-03 04:14:12,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652971103] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:14:12,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706509858] [2021-11-03 04:14:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:14:12,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:14:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 04:14:12,955 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-03 04:14:12,983 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-03 04:14:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:14:13,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-03 04:14:13,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:14:13,969 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-03 04:14:13,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 04:14:13,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706509858] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:14:13,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:14:13,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2021-11-03 04:14:13,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440866271] [2021-11-03 04:14:13,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 04:14:13,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:14:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 04:14:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-03 04:14:13,970 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-03 04:14:19,631 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:14:35,315 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:14:38,954 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-03 04:15:01,327 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-03 04:15:15,295 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:15:16,912 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:15:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:15:48,455 INFO L93 Difference]: Finished difference Result 27509 states and 34704 transitions. [2021-11-03 04:15:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 04:15:48,456 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 122 [2021-11-03 04:15:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:15:48,484 INFO L225 Difference]: With dead ends: 27509 [2021-11-03 04:15:48,484 INFO L226 Difference]: Without dead ends: 19151 [2021-11-03 04:15:48,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 267.54ms TimeCoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2021-11-03 04:15:48,501 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 21521 mSDsluCounter, 86690 mSDsCounter, 0 mSdLazyCounter, 97984 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81788.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21521 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 208.03ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 97984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91094.41ms IncrementalHoareTripleChecker+Time [2021-11-03 04:15:48,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21521 Valid, 0 Invalid, 98015 Unknown, 0 Unchecked, 208.03ms Time], IncrementalHoareTripleChecker [31 Valid, 97984 Invalid, 0 Unknown, 0 Unchecked, 91094.41ms Time] [2021-11-03 04:15:48,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19151 states. [2021-11-03 04:15:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19151 to 8383. [2021-11-03 04:15:49,284 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-03 04:15:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8383 states to 8383 states and 10572 transitions. [2021-11-03 04:15:49,293 INFO L78 Accepts]: Start accepts. Automaton has 8383 states and 10572 transitions. Word has length 122 [2021-11-03 04:15:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:15:49,294 INFO L470 AbstractCegarLoop]: Abstraction has 8383 states and 10572 transitions. [2021-11-03 04:15:49,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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-03 04:15:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8383 states and 10572 transitions. [2021-11-03 04:15:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-03 04:15:49,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:15:49,295 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, 1] [2021-11-03 04:15:49,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 04:15:49,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:15:49,516 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-03 04:15:49,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:15:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash -62940191, now seen corresponding path program 1 times [2021-11-03 04:15:49,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:15:49,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063127231] [2021-11-03 04:15:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:15:49,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:15:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:15:49,652 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-03 04:15:49,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:15:49,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063127231] [2021-11-03 04:15:49,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063127231] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:15:49,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:15:49,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:15:49,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296447327] [2021-11-03 04:15:49,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:15:49,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:15:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:15:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:15:49,654 INFO L87 Difference]: Start difference. First operand 8383 states and 10572 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-03 04:16:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:16,208 INFO L93 Difference]: Finished difference Result 16888 states and 21279 transitions. [2021-11-03 04:16:16,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:16:16,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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 123 [2021-11-03 04:16:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:16,222 INFO L225 Difference]: With dead ends: 16888 [2021-11-03 04:16:16,222 INFO L226 Difference]: Without dead ends: 8534 [2021-11-03 04:16:16,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.47ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:16:16,236 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 21928 mSDsCounter, 0 mSdLazyCounter, 29372 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22514.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.13ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25333.10ms IncrementalHoareTripleChecker+Time [2021-11-03 04:16:16,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 29379 Unknown, 0 Unchecked, 43.13ms Time], IncrementalHoareTripleChecker [7 Valid, 29372 Invalid, 0 Unknown, 0 Unchecked, 25333.10ms Time] [2021-11-03 04:16:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8534 states. [2021-11-03 04:16:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8534 to 8386. [2021-11-03 04:16:17,030 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-03 04:16:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8386 states to 8386 states and 10575 transitions. [2021-11-03 04:16:17,040 INFO L78 Accepts]: Start accepts. Automaton has 8386 states and 10575 transitions. Word has length 123 [2021-11-03 04:16:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:17,040 INFO L470 AbstractCegarLoop]: Abstraction has 8386 states and 10575 transitions. [2021-11-03 04:16:17,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-03 04:16:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8386 states and 10575 transitions. [2021-11-03 04:16:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-03 04:16:17,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:16:17,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:16:17,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-03 04:16:17,042 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-03 04:16:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -957251190, now seen corresponding path program 1 times [2021-11-03 04:16:17,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:16:17,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687204965] [2021-11-03 04:16:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:17,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:17,156 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-03 04:16:17,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:16:17,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687204965] [2021-11-03 04:16:17,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687204965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:17,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:17,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:16:17,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550984265] [2021-11-03 04:16:17,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:16:17,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:16:17,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:16:17,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:16:17,158 INFO L87 Difference]: Start difference. First operand 8386 states and 10575 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-03 04:16:24,555 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:16:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:16:48,004 INFO L93 Difference]: Finished difference Result 23374 states and 29495 transitions. [2021-11-03 04:16:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:16:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 136 [2021-11-03 04:16:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:16:48,029 INFO L225 Difference]: With dead ends: 23374 [2021-11-03 04:16:48,029 INFO L226 Difference]: Without dead ends: 15017 [2021-11-03 04:16:48,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.60ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:16:48,043 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6129 mSDsluCounter, 17995 mSDsCounter, 0 mSdLazyCounter, 28840 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25478.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 46.54ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28885.08ms IncrementalHoareTripleChecker+Time [2021-11-03 04:16:48,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6129 Valid, 0 Invalid, 28852 Unknown, 0 Unchecked, 46.54ms Time], IncrementalHoareTripleChecker [12 Valid, 28840 Invalid, 0 Unknown, 0 Unchecked, 28885.08ms Time] [2021-11-03 04:16:48,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15017 states. [2021-11-03 04:16:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15017 to 8388. [2021-11-03 04:16:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8388 states, 8338 states have (on average 1.2685296234108898) internal successors, (10577), 8387 states have internal predecessors, (10577), 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-03 04:16:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8388 states to 8388 states and 10577 transitions. [2021-11-03 04:16:48,956 INFO L78 Accepts]: Start accepts. Automaton has 8388 states and 10577 transitions. Word has length 136 [2021-11-03 04:16:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:16:48,956 INFO L470 AbstractCegarLoop]: Abstraction has 8388 states and 10577 transitions. [2021-11-03 04:16:48,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-03 04:16:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8388 states and 10577 transitions. [2021-11-03 04:16:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-03 04:16:48,957 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:16:48,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:16:48,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-03 04:16:48,958 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-03 04:16:48,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:16:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash -652203533, now seen corresponding path program 1 times [2021-11-03 04:16:48,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:16:48,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703149199] [2021-11-03 04:16:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:16:48,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:16:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:16:49,104 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-03 04:16:49,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:16:49,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703149199] [2021-11-03 04:16:49,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703149199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:16:49,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:16:49,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 04:16:49,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611297797] [2021-11-03 04:16:49,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:16:49,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:16:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:16:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:16:49,106 INFO L87 Difference]: Start difference. First operand 8388 states and 10577 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-03 04:16:52,122 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:16:54,986 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:17:01,257 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-03 04:17:51,262 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-03 04:17:57,653 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-03 04:17:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:17:58,423 INFO L93 Difference]: Finished difference Result 20613 states and 25846 transitions. [2021-11-03 04:17:58,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 04:17:58,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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 139 [2021-11-03 04:17:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:17:58,437 INFO L225 Difference]: With dead ends: 20613 [2021-11-03 04:17:58,438 INFO L226 Difference]: Without dead ends: 12254 [2021-11-03 04:17:58,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.72ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-11-03 04:17:58,450 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 10365 mSDsluCounter, 52858 mSDsCounter, 0 mSdLazyCounter, 64327 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59965.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10365 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 128.96ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64327 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66781.25ms IncrementalHoareTripleChecker+Time [2021-11-03 04:17:58,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10365 Valid, 0 Invalid, 64335 Unknown, 0 Unchecked, 128.96ms Time], IncrementalHoareTripleChecker [7 Valid, 64327 Invalid, 1 Unknown, 0 Unchecked, 66781.25ms Time] [2021-11-03 04:17:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2021-11-03 04:17:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 8392. [2021-11-03 04:17:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8392 states, 8342 states have (on average 1.2684008631023735) internal successors, (10581), 8391 states have internal predecessors, (10581), 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-03 04:17:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8392 states to 8392 states and 10581 transitions. [2021-11-03 04:17:59,221 INFO L78 Accepts]: Start accepts. Automaton has 8392 states and 10581 transitions. Word has length 139 [2021-11-03 04:17:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:17:59,221 INFO L470 AbstractCegarLoop]: Abstraction has 8392 states and 10581 transitions. [2021-11-03 04:17:59,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-03 04:17:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 8392 states and 10581 transitions. [2021-11-03 04:17:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-03 04:17:59,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 04:17:59,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:17:59,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-03 04:17:59,223 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 109 more)] === [2021-11-03 04:17:59,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:17:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2074532876, now seen corresponding path program 1 times [2021-11-03 04:17:59,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 04:17:59,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376208608] [2021-11-03 04:17:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:17:59,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:17:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:17:59,423 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-03 04:17:59,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 04:17:59,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376208608] [2021-11-03 04:17:59,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376208608] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:17:59,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:17:59,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 04:17:59,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927695404] [2021-11-03 04:17:59,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:17:59,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 04:17:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:17:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:17:59,425 INFO L87 Difference]: Start difference. First operand 8392 states and 10581 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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-03 04:18:04,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 04:18:15,742 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-03 04:18:37,534 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-03 04:18:39,716 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-03 04:18:41,721 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 [] Killed by 15