./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--usb--kaweth.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.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 f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 13:52:40,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 13:52:40,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 13:52:40,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 13:52:40,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 13:52:40,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 13:52:40,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 13:52:40,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 13:52:40,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 13:52:40,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 13:52:40,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 13:52:40,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 13:52:40,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 13:52:40,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 13:52:40,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 13:52:40,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 13:52:40,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 13:52:40,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 13:52:40,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 13:52:40,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 13:52:40,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 13:52:40,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 13:52:40,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 13:52:40,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 13:52:40,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 13:52:40,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 13:52:40,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 13:52:40,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 13:52:40,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 13:52:40,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 13:52:40,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 13:52:40,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 13:52:40,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 13:52:40,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 13:52:40,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 13:52:40,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 13:52:40,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 13:52:40,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 13:52:40,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 13:52:40,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 13:52:40,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 13:52:40,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 13:52:40,709 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 13:52:40,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 13:52:40,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 13:52:40,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 13:52:40,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 13:52:40,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 13:52:40,711 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 13:52:40,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 13:52:40,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 13:52:40,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 13:52:40,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 13:52:40,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 13:52:40,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 13:52:40,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 13:52:40,713 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 13:52:40,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 13:52:40,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 13:52:40,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 13:52:40,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 13:52:40,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 13:52:40,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 13:52:40,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 13:52:40,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 13:52:40,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 13:52:40,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 13:52:40,714 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 13:52:40,714 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 13:52:40,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 13:52:40,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 13:52:40,716 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 -> f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 [2021-11-04 13:52:40,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 13:52:40,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 13:52:40,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 13:52:40,936 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 13:52:40,936 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 13:52:40,937 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--usb--kaweth.ko.cil.i [2021-11-04 13:52:40,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab7bfdb2/47789f7f67554ee58471502b7227d811/FLAG5fa7d1927 [2021-11-04 13:52:41,674 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 13:52:41,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2021-11-04 13:52:41,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab7bfdb2/47789f7f67554ee58471502b7227d811/FLAG5fa7d1927 [2021-11-04 13:52:41,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab7bfdb2/47789f7f67554ee58471502b7227d811 [2021-11-04 13:52:41,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 13:52:41,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 13:52:41,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 13:52:41,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 13:52:41,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 13:52:41,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:52:41" (1/1) ... [2021-11-04 13:52:41,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caad25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:41, skipping insertion in model container [2021-11-04 13:52:41,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:52:41" (1/1) ... [2021-11-04 13:52:41,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 13:52:42,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 13:52:44,368 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2021-11-04 13:52:44,371 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2021-11-04 13:52:44,371 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2021-11-04 13:52:44,371 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2021-11-04 13:52:44,375 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2021-11-04 13:52:44,376 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2021-11-04 13:52:44,377 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2021-11-04 13:52:44,377 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2021-11-04 13:52:44,377 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2021-11-04 13:52:44,378 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2021-11-04 13:52:44,378 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2021-11-04 13:52:44,378 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2021-11-04 13:52:44,379 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2021-11-04 13:52:44,379 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2021-11-04 13:52:44,379 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2021-11-04 13:52:44,380 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2021-11-04 13:52:44,380 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2021-11-04 13:52:44,380 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2021-11-04 13:52:44,381 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2021-11-04 13:52:44,381 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2021-11-04 13:52:44,381 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2021-11-04 13:52:44,382 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2021-11-04 13:52:44,382 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2021-11-04 13:52:44,382 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2021-11-04 13:52:44,383 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2021-11-04 13:52:44,384 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2021-11-04 13:52:44,384 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2021-11-04 13:52:44,385 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2021-11-04 13:52:44,385 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2021-11-04 13:52:44,386 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2021-11-04 13:52:44,387 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2021-11-04 13:52:44,387 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2021-11-04 13:52:44,388 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2021-11-04 13:52:44,388 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2021-11-04 13:52:44,388 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2021-11-04 13:52:44,389 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2021-11-04 13:52:44,389 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2021-11-04 13:52:44,390 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2021-11-04 13:52:44,390 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2021-11-04 13:52:44,390 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2021-11-04 13:52:44,391 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2021-11-04 13:52:44,391 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2021-11-04 13:52:44,391 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2021-11-04 13:52:44,391 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2021-11-04 13:52:44,392 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2021-11-04 13:52:44,392 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2021-11-04 13:52:44,392 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2021-11-04 13:52:44,393 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2021-11-04 13:52:44,393 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2021-11-04 13:52:44,394 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2021-11-04 13:52:44,394 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2021-11-04 13:52:44,394 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2021-11-04 13:52:44,395 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2021-11-04 13:52:44,395 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2021-11-04 13:52:44,396 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2021-11-04 13:52:44,396 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2021-11-04 13:52:44,397 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2021-11-04 13:52:44,397 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2021-11-04 13:52:44,397 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2021-11-04 13:52:44,397 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2021-11-04 13:52:44,398 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2021-11-04 13:52:44,398 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2021-11-04 13:52:44,399 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2021-11-04 13:52:44,399 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2021-11-04 13:52:44,399 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2021-11-04 13:52:44,400 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2021-11-04 13:52:44,400 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2021-11-04 13:52:44,400 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2021-11-04 13:52:44,400 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2021-11-04 13:52:44,401 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2021-11-04 13:52:44,401 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2021-11-04 13:52:44,401 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2021-11-04 13:52:44,401 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2021-11-04 13:52:44,402 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2021-11-04 13:52:44,402 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2021-11-04 13:52:44,402 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2021-11-04 13:52:44,402 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2021-11-04 13:52:44,403 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2021-11-04 13:52:44,403 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2021-11-04 13:52:44,403 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2021-11-04 13:52:44,404 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2021-11-04 13:52:44,404 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2021-11-04 13:52:44,404 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2021-11-04 13:52:44,405 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2021-11-04 13:52:44,405 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2021-11-04 13:52:44,405 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2021-11-04 13:52:44,405 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2021-11-04 13:52:44,406 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2021-11-04 13:52:44,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 13:52:44,443 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 13:52:44,628 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2021-11-04 13:52:44,628 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2021-11-04 13:52:44,629 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2021-11-04 13:52:44,629 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2021-11-04 13:52:44,629 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2021-11-04 13:52:44,629 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2021-11-04 13:52:44,630 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2021-11-04 13:52:44,649 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2021-11-04 13:52:44,650 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2021-11-04 13:52:44,650 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2021-11-04 13:52:44,650 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2021-11-04 13:52:44,651 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2021-11-04 13:52:44,651 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2021-11-04 13:52:44,652 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2021-11-04 13:52:44,652 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2021-11-04 13:52:44,652 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2021-11-04 13:52:44,652 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2021-11-04 13:52:44,653 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2021-11-04 13:52:44,653 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2021-11-04 13:52:44,653 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2021-11-04 13:52:44,653 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2021-11-04 13:52:44,654 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2021-11-04 13:52:44,654 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2021-11-04 13:52:44,655 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2021-11-04 13:52:44,655 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2021-11-04 13:52:44,655 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2021-11-04 13:52:44,656 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2021-11-04 13:52:44,656 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2021-11-04 13:52:44,657 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2021-11-04 13:52:44,657 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2021-11-04 13:52:44,657 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2021-11-04 13:52:44,657 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2021-11-04 13:52:44,658 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2021-11-04 13:52:44,658 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2021-11-04 13:52:44,659 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2021-11-04 13:52:44,659 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2021-11-04 13:52:44,659 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2021-11-04 13:52:44,660 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2021-11-04 13:52:44,660 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2021-11-04 13:52:44,660 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2021-11-04 13:52:44,661 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2021-11-04 13:52:44,661 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2021-11-04 13:52:44,662 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2021-11-04 13:52:44,662 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2021-11-04 13:52:44,662 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2021-11-04 13:52:44,662 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2021-11-04 13:52:44,663 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2021-11-04 13:52:44,663 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2021-11-04 13:52:44,663 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2021-11-04 13:52:44,664 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2021-11-04 13:52:44,664 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2021-11-04 13:52:44,664 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2021-11-04 13:52:44,664 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2021-11-04 13:52:44,665 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2021-11-04 13:52:44,666 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2021-11-04 13:52:44,667 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2021-11-04 13:52:44,667 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2021-11-04 13:52:44,667 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2021-11-04 13:52:44,668 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2021-11-04 13:52:44,668 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2021-11-04 13:52:44,668 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2021-11-04 13:52:44,669 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2021-11-04 13:52:44,669 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2021-11-04 13:52:44,670 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2021-11-04 13:52:44,671 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2021-11-04 13:52:44,673 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2021-11-04 13:52:44,676 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2021-11-04 13:52:44,677 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2021-11-04 13:52:44,677 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2021-11-04 13:52:44,678 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2021-11-04 13:52:44,679 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2021-11-04 13:52:44,679 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2021-11-04 13:52:44,680 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2021-11-04 13:52:44,680 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2021-11-04 13:52:44,684 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2021-11-04 13:52:44,685 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2021-11-04 13:52:44,685 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2021-11-04 13:52:44,685 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2021-11-04 13:52:44,686 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2021-11-04 13:52:44,687 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2021-11-04 13:52:44,687 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2021-11-04 13:52:44,688 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2021-11-04 13:52:44,688 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2021-11-04 13:52:44,688 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2021-11-04 13:52:44,688 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2021-11-04 13:52:44,689 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2021-11-04 13:52:44,689 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2021-11-04 13:52:44,689 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2021-11-04 13:52:44,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 13:52:44,838 INFO L208 MainTranslator]: Completed translation [2021-11-04 13:52:44,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44 WrapperNode [2021-11-04 13:52:44,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 13:52:44,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 13:52:44,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 13:52:44,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 13:52:44,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:44,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 13:52:45,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 13:52:45,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 13:52:45,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 13:52:45,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 13:52:45,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 13:52:45,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 13:52:45,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 13:52:45,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (1/1) ... [2021-11-04 13:52:45,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 13:52:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 13:52:45,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-04 13:52:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-04 13:52:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 13:52:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 13:52:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 13:52:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 13:52:45,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 13:52:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 13:52:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 13:52:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-11-04 13:52:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 13:52:45,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-04 13:52:51,824 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L9169: #t~ret986 := main_#res; [2021-11-04 13:52:51,824 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_11_returnLabel: main_#res := 0; [2021-11-04 13:52:51,824 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-04 13:52:51,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 13:52:51,841 INFO L299 CfgBuilder]: Removed 3145 assume(true) statements. [2021-11-04 13:52:51,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:52:51 BoogieIcfgContainer [2021-11-04 13:52:51,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 13:52:51,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 13:52:51,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 13:52:51,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 13:52:51,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 01:52:41" (1/3) ... [2021-11-04 13:52:51,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d41af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:52:51, skipping insertion in model container [2021-11-04 13:52:51,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:52:44" (2/3) ... [2021-11-04 13:52:51,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d41af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:52:51, skipping insertion in model container [2021-11-04 13:52:51,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:52:51" (3/3) ... [2021-11-04 13:52:51,856 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2021-11-04 13:52:51,859 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 13:52:51,860 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 209 error locations. [2021-11-04 13:52:51,906 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 13:52:51,912 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-04 13:52:51,912 INFO L340 AbstractCegarLoop]: Starting to check reachability of 209 error locations. [2021-11-04 13:52:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 3008 states, 2799 states have (on average 1.4219364058592354) internal successors, (3980), 3007 states have internal predecessors, (3980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:52:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-04 13:52:51,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:52:51,961 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] [2021-11-04 13:52:51,961 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:52:51,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:52:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1015889784, now seen corresponding path program 1 times [2021-11-04 13:52:51,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:52:51,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430140327] [2021-11-04 13:52:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:52:51,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:52:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:52:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:52:52,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:52:52,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430140327] [2021-11-04 13:52:52,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430140327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:52:52,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:52:52,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:52:52,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216332648] [2021-11-04 13:52:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:52:52,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:52:52,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:52:52,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:52:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:52:52,616 INFO L87 Difference]: Start difference. First operand has 3008 states, 2799 states have (on average 1.4219364058592354) internal successors, (3980), 3007 states have internal predecessors, (3980), 0 states have call successors, (0), 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 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:52:53,894 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:52:55,751 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:06,768 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:53:25,440 INFO L93 Difference]: Finished difference Result 5845 states and 7733 transitions. [2021-11-04 13:53:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:53:25,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-04 13:53:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:53:25,464 INFO L225 Difference]: With dead ends: 5845 [2021-11-04 13:53:25,464 INFO L226 Difference]: Without dead ends: 2836 [2021-11-04 13:53:25,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.97ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:53:25,473 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 3803 mSDsluCounter, 3499 mSDsCounter, 0 mSdLazyCounter, 6898 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29843.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3803 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 6900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 78.65ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32136.95ms IncrementalHoareTripleChecker+Time [2021-11-04 13:53:25,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3803 Valid, 266 Invalid, 6900 Unknown, 0 Unchecked, 78.65ms Time], IncrementalHoareTripleChecker [2 Valid, 6898 Invalid, 0 Unknown, 0 Unchecked, 32136.95ms Time] [2021-11-04 13:53:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2021-11-04 13:53:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2836. [2021-11-04 13:53:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2836 states, 2629 states have (on average 1.292126283758083) internal successors, (3397), 2835 states have internal predecessors, (3397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:53:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 3397 transitions. [2021-11-04 13:53:25,583 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 3397 transitions. Word has length 29 [2021-11-04 13:53:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:53:25,584 INFO L470 AbstractCegarLoop]: Abstraction has 2836 states and 3397 transitions. [2021-11-04 13:53:25,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:53:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3397 transitions. [2021-11-04 13:53:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-04 13:53:25,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:53:25,586 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] [2021-11-04 13:53:25,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 13:53:25,586 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr168ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:53:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:53:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1312104596, now seen corresponding path program 1 times [2021-11-04 13:53:25,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:53:25,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624549218] [2021-11-04 13:53:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:53:25,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:53:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:53:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:53:25,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:53:25,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624549218] [2021-11-04 13:53:25,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624549218] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:53:25,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:53:25,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:53:25,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593972560] [2021-11-04 13:53:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:53:25,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:53:25,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:53:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:53:25,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:53:25,885 INFO L87 Difference]: Start difference. First operand 2836 states and 3397 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:53:29,196 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:32,324 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:33,864 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:41,282 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:43,044 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:54:01,378 INFO L93 Difference]: Finished difference Result 2836 states and 3397 transitions. [2021-11-04 13:54:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:54:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-04 13:54:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:54:01,385 INFO L225 Difference]: With dead ends: 2836 [2021-11-04 13:54:01,385 INFO L226 Difference]: Without dead ends: 2832 [2021-11-04 13:54:01,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.42ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:54:01,386 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3517 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 6631 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32985.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3517 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 50.07ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6631 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35038.12ms IncrementalHoareTripleChecker+Time [2021-11-04 13:54:01,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3517 Valid, 0 Invalid, 6634 Unknown, 0 Unchecked, 50.07ms Time], IncrementalHoareTripleChecker [2 Valid, 6631 Invalid, 1 Unknown, 0 Unchecked, 35038.12ms Time] [2021-11-04 13:54:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2021-11-04 13:54:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2832. [2021-11-04 13:54:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2832 states, 2627 states have (on average 1.2915873620098972) internal successors, (3393), 2831 states have internal predecessors, (3393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:54:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3393 transitions. [2021-11-04 13:54:01,431 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3393 transitions. Word has length 31 [2021-11-04 13:54:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:54:01,431 INFO L470 AbstractCegarLoop]: Abstraction has 2832 states and 3393 transitions. [2021-11-04 13:54:01,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:54:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3393 transitions. [2021-11-04 13:54:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-04 13:54:01,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:54:01,433 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] [2021-11-04 13:54:01,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 13:54:01,433 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr169ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:54:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:54:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1788270256, now seen corresponding path program 1 times [2021-11-04 13:54:01,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:54:01,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943384173] [2021-11-04 13:54:01,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:54:01,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:54:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:54:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:54:01,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:54:01,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943384173] [2021-11-04 13:54:01,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943384173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:54:01,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:54:01,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:54:01,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174006899] [2021-11-04 13:54:01,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:54:01,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:54:01,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:54:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:54:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:54:01,717 INFO L87 Difference]: Start difference. First operand 2832 states and 3393 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:54:03,785 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:12,069 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:16,077 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:54:37,017 INFO L93 Difference]: Finished difference Result 2832 states and 3393 transitions. [2021-11-04 13:54:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:54:37,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-04 13:54:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:54:37,024 INFO L225 Difference]: With dead ends: 2832 [2021-11-04 13:54:37,024 INFO L226 Difference]: Without dead ends: 2828 [2021-11-04 13:54:37,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:54:37,025 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3503 mSDsluCounter, 3242 mSDsCounter, 0 mSdLazyCounter, 6630 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32607.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3503 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.87ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6630 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34880.19ms IncrementalHoareTripleChecker+Time [2021-11-04 13:54:37,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3503 Valid, 0 Invalid, 6633 Unknown, 0 Unchecked, 40.87ms Time], IncrementalHoareTripleChecker [2 Valid, 6630 Invalid, 1 Unknown, 0 Unchecked, 34880.19ms Time] [2021-11-04 13:54:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2021-11-04 13:54:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2828. [2021-11-04 13:54:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2625 states have (on average 1.291047619047619) internal successors, (3389), 2827 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:54:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3389 transitions. [2021-11-04 13:54:37,069 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3389 transitions. Word has length 33 [2021-11-04 13:54:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:54:37,069 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3389 transitions. [2021-11-04 13:54:37,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:54:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3389 transitions. [2021-11-04 13:54:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-04 13:54:37,070 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:54:37,070 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] [2021-11-04 13:54:37,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 13:54:37,070 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr170ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:54:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:54:37,071 INFO L85 PathProgramCache]: Analyzing trace with hash 541199956, now seen corresponding path program 1 times [2021-11-04 13:54:37,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:54:37,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538066185] [2021-11-04 13:54:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:54:37,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:54:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:54:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:54:37,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:54:37,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538066185] [2021-11-04 13:54:37,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538066185] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:54:37,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:54:37,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:54:37,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123091377] [2021-11-04 13:54:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:54:37,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:54:37,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:54:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:54:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:54:37,341 INFO L87 Difference]: Start difference. First operand 2828 states and 3389 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:54:38,539 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:41,050 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:43,817 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:45,874 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:51,313 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:54,768 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:57,194 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-04 13:54:59,710 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-04 13:55:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:55:29,686 INFO L93 Difference]: Finished difference Result 3774 states and 4479 transitions. [2021-11-04 13:55:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:55:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-11-04 13:55:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:55:29,696 INFO L225 Difference]: With dead ends: 3774 [2021-11-04 13:55:29,696 INFO L226 Difference]: Without dead ends: 3770 [2021-11-04 13:55:29,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.93ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:55:29,698 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3480 mSDsluCounter, 4478 mSDsCounter, 0 mSdLazyCounter, 7869 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47693.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3480 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 64.34ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7869 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51802.69ms IncrementalHoareTripleChecker+Time [2021-11-04 13:55:29,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3480 Valid, 0 Invalid, 7877 Unknown, 0 Unchecked, 64.34ms Time], IncrementalHoareTripleChecker [4 Valid, 7869 Invalid, 4 Unknown, 0 Unchecked, 51802.69ms Time] [2021-11-04 13:55:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3770 states. [2021-11-04 13:55:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3770 to 3532. [2021-11-04 13:55:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 3329 states have (on average 1.2886752778612196) internal successors, (4290), 3531 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:55:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4290 transitions. [2021-11-04 13:55:29,775 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4290 transitions. Word has length 35 [2021-11-04 13:55:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:55:29,775 INFO L470 AbstractCegarLoop]: Abstraction has 3532 states and 4290 transitions. [2021-11-04 13:55:29,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:55:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4290 transitions. [2021-11-04 13:55:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-04 13:55:29,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:55:29,777 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] [2021-11-04 13:55:29,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 13:55:29,778 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr171ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:55:29,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:55:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash 402517592, now seen corresponding path program 1 times [2021-11-04 13:55:29,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:55:29,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737689145] [2021-11-04 13:55:29,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:55:29,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:55:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:55:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:55:30,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:55:30,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737689145] [2021-11-04 13:55:30,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737689145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:55:30,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:55:30,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:55:30,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642531807] [2021-11-04 13:55:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:55:30,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:55:30,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:55:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:55:30,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:55:30,041 INFO L87 Difference]: Start difference. First operand 3532 states and 4290 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:55:32,143 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:35,974 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:42,020 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:46,761 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:50,026 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:56:16,664 INFO L93 Difference]: Finished difference Result 3770 states and 4475 transitions. [2021-11-04 13:56:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:56:16,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-04 13:56:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:56:16,674 INFO L225 Difference]: With dead ends: 3770 [2021-11-04 13:56:16,674 INFO L226 Difference]: Without dead ends: 3766 [2021-11-04 13:56:16,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.94ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:56:16,675 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3458 mSDsluCounter, 4485 mSDsCounter, 0 mSdLazyCounter, 7877 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42704.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3458 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 63.87ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7877 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46107.21ms IncrementalHoareTripleChecker+Time [2021-11-04 13:56:16,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3458 Valid, 0 Invalid, 7884 Unknown, 0 Unchecked, 63.87ms Time], IncrementalHoareTripleChecker [4 Valid, 7877 Invalid, 3 Unknown, 0 Unchecked, 46107.21ms Time] [2021-11-04 13:56:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2021-11-04 13:56:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3536. [2021-11-04 13:56:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 3333 states have (on average 1.2883288328832883) internal successors, (4294), 3535 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:56:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4294 transitions. [2021-11-04 13:56:16,739 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4294 transitions. Word has length 37 [2021-11-04 13:56:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:56:16,740 INFO L470 AbstractCegarLoop]: Abstraction has 3536 states and 4294 transitions. [2021-11-04 13:56:16,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:56:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4294 transitions. [2021-11-04 13:56:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-04 13:56:16,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:56:16,740 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] [2021-11-04 13:56:16,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 13:56:16,741 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr172ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:56:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:56:16,741 INFO L85 PathProgramCache]: Analyzing trace with hash 272752316, now seen corresponding path program 1 times [2021-11-04 13:56:16,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:56:16,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788817325] [2021-11-04 13:56:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:56:16,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:56:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:56:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:56:16,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:56:16,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788817325] [2021-11-04 13:56:16,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788817325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:56:16,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:56:16,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:56:16,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507999316] [2021-11-04 13:56:16,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:56:16,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:56:16,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:56:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:56:16,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:56:16,966 INFO L87 Difference]: Start difference. First operand 3536 states and 4294 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:56:18,570 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:20,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:28,874 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:32,778 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:36,988 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:56:58,371 INFO L93 Difference]: Finished difference Result 3536 states and 4294 transitions. [2021-11-04 13:56:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:56:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-11-04 13:56:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:56:58,380 INFO L225 Difference]: With dead ends: 3536 [2021-11-04 13:56:58,380 INFO L226 Difference]: Without dead ends: 3532 [2021-11-04 13:56:58,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:56:58,381 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3469 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 6647 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37458.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3469 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.88ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6647 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40993.95ms IncrementalHoareTripleChecker+Time [2021-11-04 13:56:58,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3469 Valid, 0 Invalid, 6650 Unknown, 0 Unchecked, 39.88ms Time], IncrementalHoareTripleChecker [2 Valid, 6647 Invalid, 1 Unknown, 0 Unchecked, 40993.95ms Time] [2021-11-04 13:56:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2021-11-04 13:56:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 3532. [2021-11-04 13:56:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 3331 states have (on average 1.2879015310717503) internal successors, (4290), 3531 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:56:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4290 transitions. [2021-11-04 13:56:58,450 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4290 transitions. Word has length 39 [2021-11-04 13:56:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:56:58,450 INFO L470 AbstractCegarLoop]: Abstraction has 3532 states and 4290 transitions. [2021-11-04 13:56:58,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:56:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4290 transitions. [2021-11-04 13:56:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-04 13:56:58,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:56:58,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:56:58,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 13:56:58,454 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr173ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:56:58,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:56:58,455 INFO L85 PathProgramCache]: Analyzing trace with hash 122374016, now seen corresponding path program 1 times [2021-11-04 13:56:58,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:56:58,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57523785] [2021-11-04 13:56:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:56:58,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:56:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:56:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:56:58,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:56:58,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57523785] [2021-11-04 13:56:58,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57523785] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:56:58,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:56:58,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:56:58,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843919166] [2021-11-04 13:56:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:56:58,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:56:58,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:56:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:56:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:56:58,705 INFO L87 Difference]: Start difference. First operand 3532 states and 4290 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:57:00,552 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:03,049 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:05,870 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:10,456 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:13,800 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:16,609 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:19,147 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:22,580 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:57:51,026 INFO L93 Difference]: Finished difference Result 3758 states and 4463 transitions. [2021-11-04 13:57:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:57:51,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-04 13:57:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:57:51,036 INFO L225 Difference]: With dead ends: 3758 [2021-11-04 13:57:51,036 INFO L226 Difference]: Without dead ends: 3754 [2021-11-04 13:57:51,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.21ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:57:51,037 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3414 mSDsluCounter, 4494 mSDsCounter, 0 mSdLazyCounter, 7881 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47766.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3414 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 49.01ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7881 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51803.69ms IncrementalHoareTripleChecker+Time [2021-11-04 13:57:51,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3414 Valid, 0 Invalid, 7889 Unknown, 0 Unchecked, 49.01ms Time], IncrementalHoareTripleChecker [4 Valid, 7881 Invalid, 4 Unknown, 0 Unchecked, 51803.69ms Time] [2021-11-04 13:57:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2021-11-04 13:57:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3540. [2021-11-04 13:57:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 3339 states have (on average 1.2872117400419287) internal successors, (4298), 3539 states have internal predecessors, (4298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:57:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 4298 transitions. [2021-11-04 13:57:51,147 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 4298 transitions. Word has length 41 [2021-11-04 13:57:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:57:51,147 INFO L470 AbstractCegarLoop]: Abstraction has 3540 states and 4298 transitions. [2021-11-04 13:57:51,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:57:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4298 transitions. [2021-11-04 13:57:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-04 13:57:51,149 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:57:51,149 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] [2021-11-04 13:57:51,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 13:57:51,149 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr174ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:57:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:57:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1637716132, now seen corresponding path program 1 times [2021-11-04 13:57:51,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:57:51,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179123850] [2021-11-04 13:57:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:57:51,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:57:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:57:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:57:51,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:57:51,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179123850] [2021-11-04 13:57:51,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179123850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:57:51,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:57:51,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:57:51,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278734211] [2021-11-04 13:57:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:57:51,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:57:51,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:57:51,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:57:51,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:57:51,422 INFO L87 Difference]: Start difference. First operand 3540 states and 4298 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:57:53,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:55,725 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:59,319 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:09,762 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:58:35,633 INFO L93 Difference]: Finished difference Result 3540 states and 4298 transitions. [2021-11-04 13:58:35,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:58:35,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-04 13:58:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:58:35,642 INFO L225 Difference]: With dead ends: 3540 [2021-11-04 13:58:35,642 INFO L226 Difference]: Without dead ends: 3536 [2021-11-04 13:58:35,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:58:35,643 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3445 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 6653 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40024.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3445 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.86ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6653 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43742.67ms IncrementalHoareTripleChecker+Time [2021-11-04 13:58:35,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3445 Valid, 0 Invalid, 6658 Unknown, 0 Unchecked, 43.86ms Time], IncrementalHoareTripleChecker [2 Valid, 6653 Invalid, 3 Unknown, 0 Unchecked, 43742.67ms Time] [2021-11-04 13:58:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2021-11-04 13:58:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3536. [2021-11-04 13:58:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 3337 states have (on average 1.2867845370092899) internal successors, (4294), 3535 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:58:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4294 transitions. [2021-11-04 13:58:35,723 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4294 transitions. Word has length 43 [2021-11-04 13:58:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:58:35,725 INFO L470 AbstractCegarLoop]: Abstraction has 3536 states and 4294 transitions. [2021-11-04 13:58:35,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:58:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4294 transitions. [2021-11-04 13:58:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-04 13:58:35,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:58:35,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:58:35,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 13:58:35,726 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr175ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:58:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:58:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1887575623, now seen corresponding path program 1 times [2021-11-04 13:58:35,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:58:35,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585972961] [2021-11-04 13:58:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:58:35,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:58:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:58:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:58:35,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:58:35,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585972961] [2021-11-04 13:58:35,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585972961] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:58:35,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:58:35,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:58:35,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518661033] [2021-11-04 13:58:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:58:35,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:58:35,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:58:35,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:58:35,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:58:35,999 INFO L87 Difference]: Start difference. First operand 3536 states and 4294 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:58:38,106 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:40,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:46,746 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:52,344 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:55,750 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:58,042 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:59:20,307 INFO L93 Difference]: Finished difference Result 3536 states and 4294 transitions. [2021-11-04 13:59:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:59:20,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-04 13:59:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:59:20,315 INFO L225 Difference]: With dead ends: 3536 [2021-11-04 13:59:20,315 INFO L226 Difference]: Without dead ends: 3532 [2021-11-04 13:59:20,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.63ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:59:20,316 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3431 mSDsluCounter, 3278 mSDsCounter, 0 mSdLazyCounter, 6652 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40578.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 66.85ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6652 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43835.46ms IncrementalHoareTripleChecker+Time [2021-11-04 13:59:20,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3431 Valid, 0 Invalid, 6657 Unknown, 0 Unchecked, 66.85ms Time], IncrementalHoareTripleChecker [2 Valid, 6652 Invalid, 3 Unknown, 0 Unchecked, 43835.46ms Time] [2021-11-04 13:59:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2021-11-04 13:59:20,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 3532. [2021-11-04 13:59:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 3335 states have (on average 1.2863568215892054) internal successors, (4290), 3531 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:59:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4290 transitions. [2021-11-04 13:59:20,390 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4290 transitions. Word has length 45 [2021-11-04 13:59:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:59:20,390 INFO L470 AbstractCegarLoop]: Abstraction has 3532 states and 4290 transitions. [2021-11-04 13:59:20,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:59:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4290 transitions. [2021-11-04 13:59:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-04 13:59:20,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:59:20,391 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] [2021-11-04 13:59:20,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 13:59:20,391 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr176ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 13:59:20,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:59:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1484379211, now seen corresponding path program 1 times [2021-11-04 13:59:20,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:59:20,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578444766] [2021-11-04 13:59:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:59:20,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:59:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:59:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:59:20,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:59:20,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578444766] [2021-11-04 13:59:20,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578444766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:59:20,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:59:20,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:59:20,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997667688] [2021-11-04 13:59:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:59:20,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:59:20,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:59:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:59:20,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:59:20,637 INFO L87 Difference]: Start difference. First operand 3532 states and 4290 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:59:22,623 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:25,099 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:32,835 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:40,140 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-04 14:00:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:00:09,335 INFO L93 Difference]: Finished difference Result 3738 states and 4443 transitions. [2021-11-04 14:00:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:00:09,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-11-04 14:00:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:00:09,349 INFO L225 Difference]: With dead ends: 3738 [2021-11-04 14:00:09,349 INFO L226 Difference]: Without dead ends: 3734 [2021-11-04 14:00:09,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.10ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:00:09,351 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3348 mSDsluCounter, 4502 mSDsCounter, 0 mSdLazyCounter, 7883 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43928.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 46.47ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7883 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48207.89ms IncrementalHoareTripleChecker+Time [2021-11-04 14:00:09,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3348 Valid, 0 Invalid, 7889 Unknown, 0 Unchecked, 46.47ms Time], IncrementalHoareTripleChecker [4 Valid, 7883 Invalid, 2 Unknown, 0 Unchecked, 48207.89ms Time] [2021-11-04 14:00:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2021-11-04 14:00:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3544. [2021-11-04 14:00:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3544 states, 3347 states have (on average 1.285330146399761) internal successors, (4302), 3543 states have internal predecessors, (4302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:00:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 4302 transitions. [2021-11-04 14:00:09,429 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 4302 transitions. Word has length 47 [2021-11-04 14:00:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:00:09,429 INFO L470 AbstractCegarLoop]: Abstraction has 3544 states and 4302 transitions. [2021-11-04 14:00:09,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:00:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 4302 transitions. [2021-11-04 14:00:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-04 14:00:09,430 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:00:09,430 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] [2021-11-04 14:00:09,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 14:00:09,430 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr177ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:00:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:00:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash 559684271, now seen corresponding path program 1 times [2021-11-04 14:00:09,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:00:09,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249346212] [2021-11-04 14:00:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:00:09,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:00:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:00:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:00:09,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:00:09,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249346212] [2021-11-04 14:00:09,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249346212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:00:09,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:00:09,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:00:09,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884631097] [2021-11-04 14:00:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:00:09,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:00:09,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:00:09,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:00:09,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:00:09,644 INFO L87 Difference]: Start difference. First operand 3544 states and 4302 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:00:11,567 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:14,098 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:16,688 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:26,222 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:28,270 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:31,380 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:38,483 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:40,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:01:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:01:03,960 INFO L93 Difference]: Finished difference Result 5324 states and 6450 transitions. [2021-11-04 14:01:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:01:03,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-11-04 14:01:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:01:03,968 INFO L225 Difference]: With dead ends: 5324 [2021-11-04 14:01:03,968 INFO L226 Difference]: Without dead ends: 5320 [2021-11-04 14:01:03,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.89ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:01:03,970 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3337 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 8040 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49388.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 48.31ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8040 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53726.16ms IncrementalHoareTripleChecker+Time [2021-11-04 14:01:03,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3337 Valid, 0 Invalid, 8048 Unknown, 0 Unchecked, 48.31ms Time], IncrementalHoareTripleChecker [4 Valid, 8040 Invalid, 4 Unknown, 0 Unchecked, 53726.16ms Time] [2021-11-04 14:01:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2021-11-04 14:01:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5106. [2021-11-04 14:01:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5106 states, 4909 states have (on average 1.283560806681605) internal successors, (6301), 5105 states have internal predecessors, (6301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:01:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 6301 transitions. [2021-11-04 14:01:04,094 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 6301 transitions. Word has length 49 [2021-11-04 14:01:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:01:04,094 INFO L470 AbstractCegarLoop]: Abstraction has 5106 states and 6301 transitions. [2021-11-04 14:01:04,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:01:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 6301 transitions. [2021-11-04 14:01:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-04 14:01:04,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:01:04,095 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] [2021-11-04 14:01:04,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 14:01:04,096 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr178ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:01:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:01:04,096 INFO L85 PathProgramCache]: Analyzing trace with hash 986077555, now seen corresponding path program 1 times [2021-11-04 14:01:04,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:01:04,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175841813] [2021-11-04 14:01:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:01:04,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:01:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:01:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:01:04,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:01:04,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175841813] [2021-11-04 14:01:04,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175841813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:01:04,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:01:04,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:01:04,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960313447] [2021-11-04 14:01:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:01:04,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:01:04,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:01:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:01:04,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:01:04,348 INFO L87 Difference]: Start difference. First operand 5106 states and 6301 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:01:06,464 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:01:09,315 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:01:15,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:01:19,977 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-04 14:01:22,156 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:01:24,191 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:01:27,780 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:01:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:01:52,538 INFO L93 Difference]: Finished difference Result 5106 states and 6301 transitions. [2021-11-04 14:01:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:01:52,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-04 14:01:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:01:52,546 INFO L225 Difference]: With dead ends: 5106 [2021-11-04 14:01:52,546 INFO L226 Difference]: Without dead ends: 5102 [2021-11-04 14:01:52,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.22ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:01:52,549 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3397 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 6667 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44028.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.86ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6667 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47694.57ms IncrementalHoareTripleChecker+Time [2021-11-04 14:01:52,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3397 Valid, 0 Invalid, 6673 Unknown, 0 Unchecked, 41.86ms Time], IncrementalHoareTripleChecker [2 Valid, 6667 Invalid, 4 Unknown, 0 Unchecked, 47694.57ms Time] [2021-11-04 14:01:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2021-11-04 14:01:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 5102. [2021-11-04 14:01:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5102 states, 4907 states have (on average 1.2832687996739351) internal successors, (6297), 5101 states have internal predecessors, (6297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:01:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 6297 transitions. [2021-11-04 14:01:52,665 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 6297 transitions. Word has length 51 [2021-11-04 14:01:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:01:52,666 INFO L470 AbstractCegarLoop]: Abstraction has 5102 states and 6297 transitions. [2021-11-04 14:01:52,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:01:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 6297 transitions. [2021-11-04 14:01:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-04 14:01:52,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:01:52,666 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] [2021-11-04 14:01:52,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 14:01:52,667 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr179ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:01:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:01:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1566836585, now seen corresponding path program 1 times [2021-11-04 14:01:52,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:01:52,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509152183] [2021-11-04 14:01:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:01:52,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:01:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:01:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:01:52,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:01:52,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509152183] [2021-11-04 14:01:52,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509152183] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:01:52,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:01:52,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:01:52,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895916189] [2021-11-04 14:01:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:01:52,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:01:52,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:01:52,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:01:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:01:52,940 INFO L87 Difference]: Start difference. First operand 5102 states and 6297 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:01:55,043 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:02:06,578 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:02:08,561 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:02:34,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:02:34,801 INFO L93 Difference]: Finished difference Result 5102 states and 6297 transitions. [2021-11-04 14:02:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:02:34,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-04 14:02:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:02:34,811 INFO L225 Difference]: With dead ends: 5102 [2021-11-04 14:02:34,811 INFO L226 Difference]: Without dead ends: 5098 [2021-11-04 14:02:34,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.39ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:02:34,815 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3383 mSDsluCounter, 3302 mSDsCounter, 0 mSdLazyCounter, 6670 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38114.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.99ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6670 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41379.86ms IncrementalHoareTripleChecker+Time [2021-11-04 14:02:34,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3383 Valid, 0 Invalid, 6673 Unknown, 0 Unchecked, 42.99ms Time], IncrementalHoareTripleChecker [2 Valid, 6670 Invalid, 1 Unknown, 0 Unchecked, 41379.86ms Time] [2021-11-04 14:02:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2021-11-04 14:02:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 5098. [2021-11-04 14:02:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5098 states, 4905 states have (on average 1.2829765545361875) internal successors, (6293), 5097 states have internal predecessors, (6293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:02:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 6293 transitions. [2021-11-04 14:02:34,996 INFO L78 Accepts]: Start accepts. Automaton has 5098 states and 6293 transitions. Word has length 53 [2021-11-04 14:02:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:02:34,996 INFO L470 AbstractCegarLoop]: Abstraction has 5098 states and 6293 transitions. [2021-11-04 14:02:34,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:02:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5098 states and 6293 transitions. [2021-11-04 14:02:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-04 14:02:34,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:02:34,997 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] [2021-11-04 14:02:34,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 14:02:34,998 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr180ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:02:34,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:02:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1803968539, now seen corresponding path program 1 times [2021-11-04 14:02:34,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:02:34,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116392473] [2021-11-04 14:02:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:02:34,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:02:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:02:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:02:35,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:02:35,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116392473] [2021-11-04 14:02:35,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116392473] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:02:35,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:02:35,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:02:35,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819251841] [2021-11-04 14:02:35,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:02:35,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:02:35,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:02:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:02:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:02:35,239 INFO L87 Difference]: Start difference. First operand 5098 states and 6293 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:02:37,362 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-04 14:02:40,047 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:02:49,377 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:02:51,111 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-04 14:02:52,116 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:03:02,336 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:03:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:03:27,335 INFO L93 Difference]: Finished difference Result 8562 states and 10594 transitions. [2021-11-04 14:03:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:03:27,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-11-04 14:03:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:03:27,349 INFO L225 Difference]: With dead ends: 8562 [2021-11-04 14:03:27,349 INFO L226 Difference]: Without dead ends: 8558 [2021-11-04 14:03:27,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:03:27,353 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3275 mSDsluCounter, 4829 mSDsCounter, 0 mSdLazyCounter, 8201 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47401.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3275 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 51.90ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8201 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51357.89ms IncrementalHoareTripleChecker+Time [2021-11-04 14:03:27,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3275 Valid, 0 Invalid, 8208 Unknown, 0 Unchecked, 51.90ms Time], IncrementalHoareTripleChecker [4 Valid, 8201 Invalid, 3 Unknown, 0 Unchecked, 51357.89ms Time] [2021-11-04 14:03:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2021-11-04 14:03:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8348. [2021-11-04 14:03:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8348 states, 8155 states have (on average 1.2825260576333537) internal successors, (10459), 8347 states have internal predecessors, (10459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:03:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8348 states to 8348 states and 10459 transitions. [2021-11-04 14:03:27,600 INFO L78 Accepts]: Start accepts. Automaton has 8348 states and 10459 transitions. Word has length 55 [2021-11-04 14:03:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:03:27,600 INFO L470 AbstractCegarLoop]: Abstraction has 8348 states and 10459 transitions. [2021-11-04 14:03:27,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:03:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8348 states and 10459 transitions. [2021-11-04 14:03:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-04 14:03:27,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:03:27,601 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] [2021-11-04 14:03:27,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 14:03:27,602 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr181ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:03:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:03:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1552615425, now seen corresponding path program 1 times [2021-11-04 14:03:27,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:03:27,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531182153] [2021-11-04 14:03:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:03:27,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:03:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:03:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:03:27,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:03:27,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531182153] [2021-11-04 14:03:27,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531182153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:03:27,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:03:27,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:03:27,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283391587] [2021-11-04 14:03:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:03:27,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:03:27,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:03:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:03:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:03:27,849 INFO L87 Difference]: Start difference. First operand 8348 states and 10459 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:03:29,951 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:03:37,008 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:03:39,653 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:03:43,122 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:03:45,161 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:04:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:04:09,168 INFO L93 Difference]: Finished difference Result 8348 states and 10459 transitions. [2021-11-04 14:04:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:04:09,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-11-04 14:04:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:04:09,208 INFO L225 Difference]: With dead ends: 8348 [2021-11-04 14:04:09,209 INFO L226 Difference]: Without dead ends: 8344 [2021-11-04 14:04:09,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.50ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:04:09,211 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3359 mSDsluCounter, 3314 mSDsCounter, 0 mSdLazyCounter, 6677 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37592.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3359 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.76ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6677 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40703.43ms IncrementalHoareTripleChecker+Time [2021-11-04 14:04:09,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3359 Valid, 0 Invalid, 6681 Unknown, 0 Unchecked, 39.76ms Time], IncrementalHoareTripleChecker [2 Valid, 6677 Invalid, 2 Unknown, 0 Unchecked, 40703.43ms Time] [2021-11-04 14:04:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8344 states. [2021-11-04 14:04:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8344 to 8344. [2021-11-04 14:04:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8344 states, 8153 states have (on average 1.282350055194407) internal successors, (10455), 8343 states have internal predecessors, (10455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:04:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8344 states to 8344 states and 10455 transitions. [2021-11-04 14:04:09,447 INFO L78 Accepts]: Start accepts. Automaton has 8344 states and 10455 transitions. Word has length 57 [2021-11-04 14:04:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:04:09,447 INFO L470 AbstractCegarLoop]: Abstraction has 8344 states and 10455 transitions. [2021-11-04 14:04:09,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:04:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8344 states and 10455 transitions. [2021-11-04 14:04:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-04 14:04:09,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:04:09,448 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] [2021-11-04 14:04:09,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 14:04:09,449 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr182ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:04:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:04:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1709365181, now seen corresponding path program 1 times [2021-11-04 14:04:09,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:04:09,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044536407] [2021-11-04 14:04:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:04:09,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:04:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:04:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:04:09,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:04:09,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044536407] [2021-11-04 14:04:09,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044536407] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:04:09,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:04:09,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:04:09,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332241068] [2021-11-04 14:04:09,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:04:09,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:04:09,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:04:09,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:04:09,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:04:09,796 INFO L87 Difference]: Start difference. First operand 8344 states and 10455 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:04:11,927 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:04:14,777 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:04:24,966 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:04:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:04:50,611 INFO L93 Difference]: Finished difference Result 8344 states and 10455 transitions. [2021-11-04 14:04:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:04:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-11-04 14:04:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:04:50,621 INFO L225 Difference]: With dead ends: 8344 [2021-11-04 14:04:50,621 INFO L226 Difference]: Without dead ends: 8340 [2021-11-04 14:04:50,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.85ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:04:50,623 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3345 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 6678 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36875.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3345 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.53ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40180.00ms IncrementalHoareTripleChecker+Time [2021-11-04 14:04:50,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3345 Valid, 0 Invalid, 6681 Unknown, 0 Unchecked, 44.53ms Time], IncrementalHoareTripleChecker [2 Valid, 6678 Invalid, 1 Unknown, 0 Unchecked, 40180.00ms Time] [2021-11-04 14:04:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2021-11-04 14:04:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 8340. [2021-11-04 14:04:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8340 states, 8151 states have (on average 1.2821739663844927) internal successors, (10451), 8339 states have internal predecessors, (10451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:04:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8340 states to 8340 states and 10451 transitions. [2021-11-04 14:04:50,893 INFO L78 Accepts]: Start accepts. Automaton has 8340 states and 10451 transitions. Word has length 59 [2021-11-04 14:04:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:04:50,894 INFO L470 AbstractCegarLoop]: Abstraction has 8340 states and 10451 transitions. [2021-11-04 14:04:50,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:04:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 8340 states and 10451 transitions. [2021-11-04 14:04:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-04 14:04:50,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:04:50,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] [2021-11-04 14:04:50,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 14:04:50,897 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr183ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:04:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:04:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2022024985, now seen corresponding path program 1 times [2021-11-04 14:04:50,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:04:50,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904159483] [2021-11-04 14:04:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:04:50,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:04:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:04:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:04:51,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:04:51,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904159483] [2021-11-04 14:04:51,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904159483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:04:51,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:04:51,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:04:51,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831199998] [2021-11-04 14:04:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:04:51,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:04:51,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:04:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:04:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:04:51,115 INFO L87 Difference]: Start difference. First operand 8340 states and 10451 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:04:53,216 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:05:01,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:05:03,268 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:05:07,228 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:05:09,782 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-04 14:05:12,755 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-04 14:05:19,950 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:05:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:05:48,828 INFO L93 Difference]: Finished difference Result 11962 states and 14950 transitions. [2021-11-04 14:05:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:05:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-11-04 14:05:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:05:48,840 INFO L225 Difference]: With dead ends: 11962 [2021-11-04 14:05:48,841 INFO L226 Difference]: Without dead ends: 11958 [2021-11-04 14:05:48,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.25ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:05:48,843 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3054 mSDsluCounter, 5159 mSDsCounter, 0 mSdLazyCounter, 8522 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52124.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 53.22ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8522 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56788.89ms IncrementalHoareTripleChecker+Time [2021-11-04 14:05:48,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3054 Valid, 0 Invalid, 8530 Unknown, 0 Unchecked, 53.22ms Time], IncrementalHoareTripleChecker [4 Valid, 8522 Invalid, 4 Unknown, 0 Unchecked, 56788.89ms Time] [2021-11-04 14:05:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11958 states. [2021-11-04 14:05:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11958 to 11768. [2021-11-04 14:05:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11768 states, 11579 states have (on average 1.2813714483115985) internal successors, (14837), 11767 states have internal predecessors, (14837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:05:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11768 states to 11768 states and 14837 transitions. [2021-11-04 14:05:49,200 INFO L78 Accepts]: Start accepts. Automaton has 11768 states and 14837 transitions. Word has length 61 [2021-11-04 14:05:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:05:49,200 INFO L470 AbstractCegarLoop]: Abstraction has 11768 states and 14837 transitions. [2021-11-04 14:05:49,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:05:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11768 states and 14837 transitions. [2021-11-04 14:05:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-04 14:05:49,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:05:49,201 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] [2021-11-04 14:05:49,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 14:05:49,202 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr184ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:05:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:05:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1840385557, now seen corresponding path program 1 times [2021-11-04 14:05:49,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:05:49,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282530190] [2021-11-04 14:05:49,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:05:49,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:05:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:05:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:05:49,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:05:49,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282530190] [2021-11-04 14:05:49,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282530190] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:05:49,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:05:49,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:05:49,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476890721] [2021-11-04 14:05:49,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:05:49,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:05:49,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:05:49,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:05:49,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:05:49,395 INFO L87 Difference]: Start difference. First operand 11768 states and 14837 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:05:51,145 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:05:53,593 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:05:56,912 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:06:01,726 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:06:02,856 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:06:05,956 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:06:07,848 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-04 14:06:09,716 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:06:10,859 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:06:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:06:36,153 INFO L93 Difference]: Finished difference Result 11768 states and 14837 transitions. [2021-11-04 14:06:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:06:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-11-04 14:06:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:06:36,166 INFO L225 Difference]: With dead ends: 11768 [2021-11-04 14:06:36,166 INFO L226 Difference]: Without dead ends: 11764 [2021-11-04 14:06:36,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:06:36,169 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3321 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 6686 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42343.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.84ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6686 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45963.64ms IncrementalHoareTripleChecker+Time [2021-11-04 14:06:36,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3321 Valid, 0 Invalid, 6690 Unknown, 0 Unchecked, 41.84ms Time], IncrementalHoareTripleChecker [2 Valid, 6686 Invalid, 2 Unknown, 0 Unchecked, 45963.64ms Time] [2021-11-04 14:06:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11764 states. [2021-11-04 14:06:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11764 to 11764. [2021-11-04 14:06:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11764 states, 11577 states have (on average 1.2812473006823875) internal successors, (14833), 11763 states have internal predecessors, (14833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:06:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11764 states to 11764 states and 14833 transitions. [2021-11-04 14:06:36,554 INFO L78 Accepts]: Start accepts. Automaton has 11764 states and 14833 transitions. Word has length 63 [2021-11-04 14:06:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:06:36,554 INFO L470 AbstractCegarLoop]: Abstraction has 11764 states and 14833 transitions. [2021-11-04 14:06:36,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:06:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 11764 states and 14833 transitions. [2021-11-04 14:06:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 14:06:36,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:06:36,555 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] [2021-11-04 14:06:36,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 14:06:36,555 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr185ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-04 14:06:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:06:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash 916413263, now seen corresponding path program 1 times [2021-11-04 14:06:36,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:06:36,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358969384] [2021-11-04 14:06:36,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:06:36,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:06:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:06:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:06:36,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:06:36,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358969384] [2021-11-04 14:06:36,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358969384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:06:36,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:06:36,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:06:36,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488351473] [2021-11-04 14:06:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:06:36,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:06:36,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:06:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:06:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:06:36,766 INFO L87 Difference]: Start difference. First operand 11764 states and 14833 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:06:38,864 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:06:47,551 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-04 14:06:49,608 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15