./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--atm--fore_200e.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--atm--fore_200e.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 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 13:19:04,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 13:19:04,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 13:19:04,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 13:19:04,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 13:19:04,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 13:19:04,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 13:19:04,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 13:19:04,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 13:19:04,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 13:19:04,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 13:19:04,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 13:19:04,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 13:19:04,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 13:19:04,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 13:19:04,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 13:19:04,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 13:19:04,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 13:19:04,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 13:19:04,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 13:19:04,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 13:19:04,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 13:19:04,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 13:19:04,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 13:19:04,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 13:19:04,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 13:19:04,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 13:19:04,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 13:19:04,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 13:19:04,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 13:19:04,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 13:19:04,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 13:19:04,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 13:19:04,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 13:19:04,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 13:19:04,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 13:19:04,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 13:19:04,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 13:19:04,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 13:19:04,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 13:19:04,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 13:19:04,781 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:19:04,810 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 13:19:04,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 13:19:04,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 13:19:04,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 13:19:04,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 13:19:04,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 13:19:04,812 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 13:19:04,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 13:19:04,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 13:19:04,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 13:19:04,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 13:19:04,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 13:19:04,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 13:19:04,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 13:19:04,813 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 13:19:04,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 13:19:04,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 13:19:04,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 13:19:04,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 13:19:04,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 13:19:04,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 13:19:04,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 13:19:04,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 13:19:04,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 13:19:04,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 13:19:04,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 13:19:04,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 13:19:04,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 13:19:04,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 13:19:04,816 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 -> 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 [2021-11-04 13:19:05,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 13:19:05,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 13:19:05,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 13:19:05,059 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 13:19:05,060 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 13:19:05,060 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--atm--fore_200e.ko.cil.i [2021-11-04 13:19:05,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19db62c7c/bdf9fe8d440f4bd0887e06177a12e5bd/FLAG4fa38448d [2021-11-04 13:19:05,723 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 13:19:05,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2021-11-04 13:19:05,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19db62c7c/bdf9fe8d440f4bd0887e06177a12e5bd/FLAG4fa38448d [2021-11-04 13:19:05,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19db62c7c/bdf9fe8d440f4bd0887e06177a12e5bd [2021-11-04 13:19:05,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 13:19:05,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 13:19:05,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 13:19:05,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 13:19:05,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 13:19:05,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:19:05" (1/1) ... [2021-11-04 13:19:05,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6c7a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:05, skipping insertion in model container [2021-11-04 13:19:05,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:19:05" (1/1) ... [2021-11-04 13:19:05,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 13:19:05,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 13:19:09,889 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2021-11-04 13:19:09,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2021-11-04 13:19:09,892 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2021-11-04 13:19:09,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2021-11-04 13:19:09,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2021-11-04 13:19:09,893 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2021-11-04 13:19:09,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2021-11-04 13:19:09,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2021-11-04 13:19:09,894 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2021-11-04 13:19:09,895 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2021-11-04 13:19:09,895 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2021-11-04 13:19:09,895 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2021-11-04 13:19:09,896 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2021-11-04 13:19:09,896 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2021-11-04 13:19:09,897 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2021-11-04 13:19:09,897 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2021-11-04 13:19:09,897 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2021-11-04 13:19:09,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2021-11-04 13:19:09,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2021-11-04 13:19:09,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2021-11-04 13:19:09,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2021-11-04 13:19:09,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2021-11-04 13:19:09,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2021-11-04 13:19:09,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2021-11-04 13:19:09,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2021-11-04 13:19:09,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2021-11-04 13:19:09,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2021-11-04 13:19:09,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2021-11-04 13:19:09,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2021-11-04 13:19:09,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2021-11-04 13:19:09,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2021-11-04 13:19:09,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2021-11-04 13:19:09,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2021-11-04 13:19:09,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2021-11-04 13:19:09,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2021-11-04 13:19:09,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2021-11-04 13:19:09,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2021-11-04 13:19:09,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2021-11-04 13:19:09,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2021-11-04 13:19:09,907 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2021-11-04 13:19:09,907 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2021-11-04 13:19:09,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2021-11-04 13:19:09,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2021-11-04 13:19:09,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2021-11-04 13:19:09,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2021-11-04 13:19:09,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2021-11-04 13:19:09,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2021-11-04 13:19:09,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2021-11-04 13:19:09,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2021-11-04 13:19:09,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2021-11-04 13:19:09,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2021-11-04 13:19:09,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2021-11-04 13:19:09,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2021-11-04 13:19:09,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2021-11-04 13:19:09,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2021-11-04 13:19:09,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2021-11-04 13:19:09,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2021-11-04 13:19:09,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2021-11-04 13:19:09,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2021-11-04 13:19:09,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2021-11-04 13:19:09,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2021-11-04 13:19:09,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2021-11-04 13:19:09,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2021-11-04 13:19:09,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2021-11-04 13:19:09,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2021-11-04 13:19:09,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2021-11-04 13:19:09,919 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2021-11-04 13:19:09,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2021-11-04 13:19:09,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2021-11-04 13:19:09,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2021-11-04 13:19:09,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2021-11-04 13:19:09,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2021-11-04 13:19:09,921 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2021-11-04 13:19:09,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2021-11-04 13:19:09,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2021-11-04 13:19:09,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2021-11-04 13:19:09,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2021-11-04 13:19:09,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2021-11-04 13:19:09,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2021-11-04 13:19:09,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2021-11-04 13:19:09,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2021-11-04 13:19:09,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2021-11-04 13:19:09,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2021-11-04 13:19:09,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2021-11-04 13:19:09,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2021-11-04 13:19:09,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2021-11-04 13:19:09,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2021-11-04 13:19:09,927 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2021-11-04 13:19:09,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 13:19:09,958 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 13:19:10,442 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2021-11-04 13:19:10,442 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2021-11-04 13:19:10,443 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2021-11-04 13:19:10,443 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2021-11-04 13:19:10,444 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2021-11-04 13:19:10,444 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2021-11-04 13:19:10,444 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2021-11-04 13:19:10,445 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2021-11-04 13:19:10,445 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2021-11-04 13:19:10,445 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2021-11-04 13:19:10,446 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2021-11-04 13:19:10,446 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2021-11-04 13:19:10,446 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2021-11-04 13:19:10,447 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2021-11-04 13:19:10,447 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2021-11-04 13:19:10,447 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2021-11-04 13:19:10,448 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2021-11-04 13:19:10,448 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2021-11-04 13:19:10,448 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2021-11-04 13:19:10,449 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2021-11-04 13:19:10,449 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2021-11-04 13:19:10,449 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2021-11-04 13:19:10,450 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2021-11-04 13:19:10,450 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2021-11-04 13:19:10,450 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2021-11-04 13:19:10,451 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2021-11-04 13:19:10,451 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2021-11-04 13:19:10,451 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2021-11-04 13:19:10,452 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2021-11-04 13:19:10,452 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2021-11-04 13:19:10,452 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2021-11-04 13:19:10,453 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2021-11-04 13:19:10,453 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2021-11-04 13:19:10,453 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2021-11-04 13:19:10,454 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2021-11-04 13:19:10,454 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2021-11-04 13:19:10,454 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2021-11-04 13:19:10,455 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2021-11-04 13:19:10,455 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2021-11-04 13:19:10,455 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2021-11-04 13:19:10,456 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2021-11-04 13:19:10,456 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2021-11-04 13:19:10,456 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2021-11-04 13:19:10,457 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2021-11-04 13:19:10,457 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2021-11-04 13:19:10,457 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2021-11-04 13:19:10,458 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2021-11-04 13:19:10,458 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2021-11-04 13:19:10,458 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2021-11-04 13:19:10,459 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2021-11-04 13:19:10,459 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2021-11-04 13:19:10,459 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2021-11-04 13:19:10,460 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2021-11-04 13:19:10,460 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2021-11-04 13:19:10,460 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2021-11-04 13:19:10,460 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2021-11-04 13:19:10,461 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2021-11-04 13:19:10,461 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2021-11-04 13:19:10,461 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2021-11-04 13:19:10,462 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2021-11-04 13:19:10,462 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2021-11-04 13:19:10,462 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2021-11-04 13:19:10,463 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2021-11-04 13:19:10,463 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2021-11-04 13:19:10,463 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2021-11-04 13:19:10,464 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2021-11-04 13:19:10,464 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2021-11-04 13:19:10,464 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2021-11-04 13:19:10,465 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2021-11-04 13:19:10,465 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2021-11-04 13:19:10,465 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2021-11-04 13:19:10,466 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2021-11-04 13:19:10,466 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2021-11-04 13:19:10,466 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2021-11-04 13:19:10,466 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2021-11-04 13:19:10,467 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2021-11-04 13:19:10,467 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2021-11-04 13:19:10,467 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2021-11-04 13:19:10,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2021-11-04 13:19:10,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2021-11-04 13:19:10,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2021-11-04 13:19:10,469 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2021-11-04 13:19:10,469 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2021-11-04 13:19:10,469 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2021-11-04 13:19:10,469 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2021-11-04 13:19:10,470 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2021-11-04 13:19:10,470 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2021-11-04 13:19:10,470 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2021-11-04 13:19:10,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 13:19:10,703 INFO L208 MainTranslator]: Completed translation [2021-11-04 13:19:10,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10 WrapperNode [2021-11-04 13:19:10,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 13:19:10,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 13:19:10,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 13:19:10,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 13:19:10,710 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:19:10" (1/1) ... [2021-11-04 13:19:10,774 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:19:10" (1/1) ... [2021-11-04 13:19:11,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 13:19:11,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 13:19:11,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 13:19:11,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 13:19:11,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (1/1) ... [2021-11-04 13:19:11,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (1/1) ... [2021-11-04 13:19:11,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (1/1) ... [2021-11-04 13:19:11,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (1/1) ... [2021-11-04 13:19:11,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (1/1) ... [2021-11-04 13:19:11,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (1/1) ... [2021-11-04 13:19:11,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (1/1) ... [2021-11-04 13:19:12,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 13:19:12,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 13:19:12,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 13:19:12,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 13:19:12,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (1/1) ... [2021-11-04 13:19:12,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 13:19:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 13:19:12,126 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:19:12,146 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:19:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2021-11-04 13:19:12,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2021-11-04 13:19:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2021-11-04 13:19:12,168 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2021-11-04 13:19:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2021-11-04 13:19:12,168 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2021-11-04 13:19:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 13:19:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2021-11-04 13:19:12,169 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2021-11-04 13:19:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2021-11-04 13:19:12,169 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2021-11-04 13:19:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 13:19:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 13:19:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 13:19:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2021-11-04 13:19:12,170 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2021-11-04 13:19:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 13:19:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 13:19:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-04 13:19:12,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-04 13:19:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2021-11-04 13:19:12,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2021-11-04 13:19:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2021-11-04 13:19:12,172 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2021-11-04 13:19:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2021-11-04 13:19:12,173 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2021-11-04 13:19:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 13:19:12,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 13:19:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 13:19:12,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 13:19:12,174 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2021-11-04 13:19:12,174 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2021-11-04 13:19:12,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2021-11-04 13:19:12,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2021-11-04 13:19:12,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 13:19:12,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 13:19:12,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 13:19:12,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2021-11-04 13:19:12,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2021-11-04 13:19:12,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2021-11-04 13:19:12,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2021-11-04 13:19:12,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 13:19:12,175 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-04 13:19:12,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-04 13:19:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 13:19:25,574 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L11887: #t~ret2081 := main_#res; [2021-11-04 13:19:25,575 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_9_returnLabel: main_#res := 0; [2021-11-04 13:19:25,575 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-04 13:19:25,575 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_pci_pci_instance_1_switch_break: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0.offset; [2021-11-04 13:19:25,603 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 13:19:25,604 INFO L299 CfgBuilder]: Removed 4286 assume(true) statements. [2021-11-04 13:19:25,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:19:25 BoogieIcfgContainer [2021-11-04 13:19:25,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 13:19:25,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 13:19:25,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 13:19:25,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 13:19:25,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 01:19:05" (1/3) ... [2021-11-04 13:19:25,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569dbe9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:19:25, skipping insertion in model container [2021-11-04 13:19:25,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:19:10" (2/3) ... [2021-11-04 13:19:25,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569dbe9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:19:25, skipping insertion in model container [2021-11-04 13:19:25,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:19:25" (3/3) ... [2021-11-04 13:19:25,613 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2021-11-04 13:19:25,618 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 13:19:25,619 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 130 error locations. [2021-11-04 13:19:25,664 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 13:19:25,673 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:19:25,673 INFO L340 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2021-11-04 13:19:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 3741 states, 3572 states have (on average 1.3743001119820828) internal successors, (4909), 3702 states have internal predecessors, (4909), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-11-04 13:19:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-04 13:19:25,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:19:25,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:19:25,719 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:19:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:19:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1485327355, now seen corresponding path program 1 times [2021-11-04 13:19:25,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:19:25,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088965769] [2021-11-04 13:19:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:19:25,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:19:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:19:26,314 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:19:26,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:19:26,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088965769] [2021-11-04 13:19:26,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088965769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:19:26,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:19:26,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:19:26,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230738703] [2021-11-04 13:19:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:19:26,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:19:26,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:19:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:19:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:19:26,382 INFO L87 Difference]: Start difference. First operand has 3741 states, 3572 states have (on average 1.3743001119820828) internal successors, (4909), 3702 states have internal predecessors, (4909), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:19:28,476 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:20:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:20:01,354 INFO L93 Difference]: Finished difference Result 11131 states and 14823 transitions. [2021-11-04 13:20:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:20:01,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-04 13:20:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:20:01,387 INFO L225 Difference]: With dead ends: 11131 [2021-11-04 13:20:01,387 INFO L226 Difference]: Without dead ends: 7187 [2021-11-04 13:20:01,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.95ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:20:01,410 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 5049 mSDsluCounter, 9375 mSDsCounter, 0 mSdLazyCounter, 13650 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31161.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5049 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 13655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 84.12ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13650 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33927.29ms IncrementalHoareTripleChecker+Time [2021-11-04 13:20:01,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5049 Valid, 583 Invalid, 13655 Unknown, 0 Unchecked, 84.12ms Time], IncrementalHoareTripleChecker [4 Valid, 13650 Invalid, 1 Unknown, 0 Unchecked, 33927.29ms Time] [2021-11-04 13:20:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2021-11-04 13:20:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 6847. [2021-11-04 13:20:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6847 states, 6639 states have (on average 1.2997439373399609) internal successors, (8629), 6770 states have internal predecessors, (8629), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:20:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6847 states to 6847 states and 8749 transitions. [2021-11-04 13:20:01,684 INFO L78 Accepts]: Start accepts. Automaton has 6847 states and 8749 transitions. Word has length 26 [2021-11-04 13:20:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:20:01,685 INFO L470 AbstractCegarLoop]: Abstraction has 6847 states and 8749 transitions. [2021-11-04 13:20:01,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:20:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6847 states and 8749 transitions. [2021-11-04 13:20:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-04 13:20:01,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:20:01,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:20:01,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 13:20:01,687 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:20:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:20:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1469993239, now seen corresponding path program 1 times [2021-11-04 13:20:01,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:20:01,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910888263] [2021-11-04 13:20:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:20:01,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:20:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:20:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:20:01,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:20:01,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910888263] [2021-11-04 13:20:01,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910888263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:20:01,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:20:01,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:20:01,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386589518] [2021-11-04 13:20:01,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:20:01,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:20:01,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:20:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:20:01,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:20:01,964 INFO L87 Difference]: Start difference. First operand 6847 states and 8749 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:20:03,999 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:20:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:20:23,022 INFO L93 Difference]: Finished difference Result 6847 states and 8749 transitions. [2021-11-04 13:20:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:20:23,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-04 13:20:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:20:23,051 INFO L225 Difference]: With dead ends: 6847 [2021-11-04 13:20:23,051 INFO L226 Difference]: Without dead ends: 6843 [2021-11-04 13:20:23,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.16ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:20:23,054 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4631 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18828.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4631 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.63ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20534.49ms IncrementalHoareTripleChecker+Time [2021-11-04 13:20:23,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4631 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 39.63ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 20534.49ms Time] [2021-11-04 13:20:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6843 states. [2021-11-04 13:20:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6843 to 6843. [2021-11-04 13:20:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6843 states, 6637 states have (on average 1.2995329215006781) internal successors, (8625), 6766 states have internal predecessors, (8625), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:20:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6843 states to 6843 states and 8745 transitions. [2021-11-04 13:20:23,186 INFO L78 Accepts]: Start accepts. Automaton has 6843 states and 8745 transitions. Word has length 28 [2021-11-04 13:20:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:20:23,187 INFO L470 AbstractCegarLoop]: Abstraction has 6843 states and 8745 transitions. [2021-11-04 13:20:23,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:20:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6843 states and 8745 transitions. [2021-11-04 13:20:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-04 13:20:23,188 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:20:23,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:20:23,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 13:20:23,189 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:20:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:20:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash 381190701, now seen corresponding path program 1 times [2021-11-04 13:20:23,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:20:23,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358829904] [2021-11-04 13:20:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:20:23,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:20:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:20:23,389 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:20:23,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:20:23,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358829904] [2021-11-04 13:20:23,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358829904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:20:23,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:20:23,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:20:23,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714789063] [2021-11-04 13:20:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:20:23,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:20:23,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:20:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:20:23,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:20:23,390 INFO L87 Difference]: Start difference. First operand 6843 states and 8745 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:20:25,422 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:20:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:20:44,736 INFO L93 Difference]: Finished difference Result 6843 states and 8745 transitions. [2021-11-04 13:20:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:20:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-04 13:20:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:20:44,763 INFO L225 Difference]: With dead ends: 6843 [2021-11-04 13:20:44,763 INFO L226 Difference]: Without dead ends: 6839 [2021-11-04 13:20:44,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.31ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:20:44,766 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4617 mSDsluCounter, 4353 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19265.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4617 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 36.09ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20939.84ms IncrementalHoareTripleChecker+Time [2021-11-04 13:20:44,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4617 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 36.09ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 20939.84ms Time] [2021-11-04 13:20:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6839 states. [2021-11-04 13:20:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6839 to 6839. [2021-11-04 13:20:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6839 states, 6635 states have (on average 1.2993217784476263) internal successors, (8621), 6762 states have internal predecessors, (8621), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:20:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6839 states to 6839 states and 8741 transitions. [2021-11-04 13:20:44,884 INFO L78 Accepts]: Start accepts. Automaton has 6839 states and 8741 transitions. Word has length 30 [2021-11-04 13:20:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:20:44,884 INFO L470 AbstractCegarLoop]: Abstraction has 6839 states and 8741 transitions. [2021-11-04 13:20:44,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:20:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6839 states and 8741 transitions. [2021-11-04 13:20:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-04 13:20:44,885 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:20:44,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:20:44,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 13:20:44,886 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:20:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:20:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1252496849, now seen corresponding path program 1 times [2021-11-04 13:20:44,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:20:44,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003180726] [2021-11-04 13:20:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:20:44,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:20:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:20:45,086 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:20:45,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:20:45,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003180726] [2021-11-04 13:20:45,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003180726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:20:45,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:20:45,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:20:45,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727794015] [2021-11-04 13:20:45,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:20:45,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:20:45,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:20:45,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:20:45,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:20:45,089 INFO L87 Difference]: Start difference. First operand 6839 states and 8741 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:20:47,120 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:21:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:21:05,856 INFO L93 Difference]: Finished difference Result 6839 states and 8741 transitions. [2021-11-04 13:21:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:21:05,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-04 13:21:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:21:05,875 INFO L225 Difference]: With dead ends: 6839 [2021-11-04 13:21:05,876 INFO L226 Difference]: Without dead ends: 6835 [2021-11-04 13:21:05,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.62ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:21:05,879 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4603 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18692.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4603 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.93ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20374.67ms IncrementalHoareTripleChecker+Time [2021-11-04 13:21:05,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4603 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 31.93ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 20374.67ms Time] [2021-11-04 13:21:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2021-11-04 13:21:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6835. [2021-11-04 13:21:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6835 states, 6633 states have (on average 1.299110508065732) internal successors, (8617), 6758 states have internal predecessors, (8617), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:21:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6835 states to 6835 states and 8737 transitions. [2021-11-04 13:21:06,008 INFO L78 Accepts]: Start accepts. Automaton has 6835 states and 8737 transitions. Word has length 32 [2021-11-04 13:21:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:21:06,009 INFO L470 AbstractCegarLoop]: Abstraction has 6835 states and 8737 transitions. [2021-11-04 13:21:06,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:21:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6835 states and 8737 transitions. [2021-11-04 13:21:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 13:21:06,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:21:06,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:21:06,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 13:21:06,012 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:21:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:21:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1059082709, now seen corresponding path program 1 times [2021-11-04 13:21:06,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:21:06,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698004216] [2021-11-04 13:21:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:21:06,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:21:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:21:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:21:06,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:21:06,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698004216] [2021-11-04 13:21:06,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698004216] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:21:06,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:21:06,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:21:06,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075400132] [2021-11-04 13:21:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:21:06,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:21:06,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:21:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:21:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:21:06,165 INFO L87 Difference]: Start difference. First operand 6835 states and 8737 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:21:08,197 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:21:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:21:27,376 INFO L93 Difference]: Finished difference Result 6835 states and 8737 transitions. [2021-11-04 13:21:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:21:27,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-04 13:21:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:21:27,386 INFO L225 Difference]: With dead ends: 6835 [2021-11-04 13:21:27,387 INFO L226 Difference]: Without dead ends: 6831 [2021-11-04 13:21:27,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.27ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:21:27,390 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4589 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18888.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 32.30ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20687.91ms IncrementalHoareTripleChecker+Time [2021-11-04 13:21:27,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4589 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 32.30ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 20687.91ms Time] [2021-11-04 13:21:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6831 states. [2021-11-04 13:21:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6831 to 6831. [2021-11-04 13:21:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6831 states, 6631 states have (on average 1.2988991102397829) internal successors, (8613), 6754 states have internal predecessors, (8613), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:21:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6831 states to 6831 states and 8733 transitions. [2021-11-04 13:21:27,511 INFO L78 Accepts]: Start accepts. Automaton has 6831 states and 8733 transitions. Word has length 34 [2021-11-04 13:21:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:21:27,512 INFO L470 AbstractCegarLoop]: Abstraction has 6831 states and 8733 transitions. [2021-11-04 13:21:27,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:21:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 6831 states and 8733 transitions. [2021-11-04 13:21:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-04 13:21:27,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:21:27,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:21:27,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 13:21:27,516 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:21:27,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:21:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash -128311751, now seen corresponding path program 1 times [2021-11-04 13:21:27,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:21:27,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22939845] [2021-11-04 13:21:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:21:27,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:21:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:21:27,661 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:21:27,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:21:27,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22939845] [2021-11-04 13:21:27,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22939845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:21:27,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:21:27,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:21:27,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837296040] [2021-11-04 13:21:27,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:21:27,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:21:27,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:21:27,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:21:27,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:21:27,665 INFO L87 Difference]: Start difference. First operand 6831 states and 8733 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:21:29,697 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:21:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:21:49,343 INFO L93 Difference]: Finished difference Result 6831 states and 8733 transitions. [2021-11-04 13:21:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:21:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-04 13:21:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:21:49,357 INFO L225 Difference]: With dead ends: 6831 [2021-11-04 13:21:49,357 INFO L226 Difference]: Without dead ends: 6827 [2021-11-04 13:21:49,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.50ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:21:49,361 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4575 mSDsluCounter, 4365 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19400.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4575 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 32.40ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21268.63ms IncrementalHoareTripleChecker+Time [2021-11-04 13:21:49,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4575 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 32.40ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 21268.63ms Time] [2021-11-04 13:21:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6827 states. [2021-11-04 13:21:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6827 to 6827. [2021-11-04 13:21:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6827 states, 6629 states have (on average 1.2986875848544275) internal successors, (8609), 6750 states have internal predecessors, (8609), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:21:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6827 states to 6827 states and 8729 transitions. [2021-11-04 13:21:49,567 INFO L78 Accepts]: Start accepts. Automaton has 6827 states and 8729 transitions. Word has length 36 [2021-11-04 13:21:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:21:49,568 INFO L470 AbstractCegarLoop]: Abstraction has 6827 states and 8729 transitions. [2021-11-04 13:21:49,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:21:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6827 states and 8729 transitions. [2021-11-04 13:21:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-04 13:21:49,569 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:21:49,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:21:49,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 13:21:49,570 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:21:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:21:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1246913277, now seen corresponding path program 1 times [2021-11-04 13:21:49,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:21:49,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016450344] [2021-11-04 13:21:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:21:49,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:21:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:21:49,724 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:21:49,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:21:49,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016450344] [2021-11-04 13:21:49,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016450344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:21:49,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:21:49,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:21:49,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742712119] [2021-11-04 13:21:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:21:49,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:21:49,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:21:49,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:21:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:21:49,726 INFO L87 Difference]: Start difference. First operand 6827 states and 8729 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:21:51,757 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:22:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:22:13,923 INFO L93 Difference]: Finished difference Result 6827 states and 8729 transitions. [2021-11-04 13:22:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:22:13,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-04 13:22:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:22:13,937 INFO L225 Difference]: With dead ends: 6827 [2021-11-04 13:22:13,937 INFO L226 Difference]: Without dead ends: 6823 [2021-11-04 13:22:13,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.55ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:22:13,940 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4561 mSDsluCounter, 4369 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21553.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.62ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23707.36ms IncrementalHoareTripleChecker+Time [2021-11-04 13:22:13,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4561 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 41.62ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 23707.36ms Time] [2021-11-04 13:22:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2021-11-04 13:22:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6823. [2021-11-04 13:22:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6823 states, 6627 states have (on average 1.2984759317941754) internal successors, (8605), 6746 states have internal predecessors, (8605), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:22:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6823 states to 6823 states and 8725 transitions. [2021-11-04 13:22:14,069 INFO L78 Accepts]: Start accepts. Automaton has 6823 states and 8725 transitions. Word has length 38 [2021-11-04 13:22:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:22:14,069 INFO L470 AbstractCegarLoop]: Abstraction has 6823 states and 8725 transitions. [2021-11-04 13:22:14,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:22:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6823 states and 8725 transitions. [2021-11-04 13:22:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-04 13:22:14,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:22:14,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:22:14,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 13:22:14,071 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:22:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:22:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -11761631, now seen corresponding path program 1 times [2021-11-04 13:22:14,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:22:14,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57511314] [2021-11-04 13:22:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:22:14,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:22:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:22:14,302 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:22:14,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:22:14,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57511314] [2021-11-04 13:22:14,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57511314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:22:14,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:22:14,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:22:14,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336058566] [2021-11-04 13:22:14,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:22:14,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:22:14,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:22:14,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:22:14,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:22:14,304 INFO L87 Difference]: Start difference. First operand 6823 states and 8725 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:22:16,334 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:22:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:22:36,841 INFO L93 Difference]: Finished difference Result 6823 states and 8725 transitions. [2021-11-04 13:22:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:22:36,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-04 13:22:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:22:36,882 INFO L225 Difference]: With dead ends: 6823 [2021-11-04 13:22:36,882 INFO L226 Difference]: Without dead ends: 6819 [2021-11-04 13:22:36,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.66ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:22:36,886 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4547 mSDsluCounter, 4373 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20021.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4547 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 32.08ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22110.72ms IncrementalHoareTripleChecker+Time [2021-11-04 13:22:36,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4547 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 32.08ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 22110.72ms Time] [2021-11-04 13:22:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6819 states. [2021-11-04 13:22:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6819 to 6819. [2021-11-04 13:22:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6819 states, 6625 states have (on average 1.2982641509433963) internal successors, (8601), 6742 states have internal predecessors, (8601), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:22:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6819 states to 6819 states and 8721 transitions. [2021-11-04 13:22:37,024 INFO L78 Accepts]: Start accepts. Automaton has 6819 states and 8721 transitions. Word has length 40 [2021-11-04 13:22:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:22:37,026 INFO L470 AbstractCegarLoop]: Abstraction has 6819 states and 8721 transitions. [2021-11-04 13:22:37,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:22:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6819 states and 8721 transitions. [2021-11-04 13:22:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-04 13:22:37,027 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:22:37,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:22:37,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 13:22:37,027 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:22:37,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:22:37,027 INFO L85 PathProgramCache]: Analyzing trace with hash -302839317, now seen corresponding path program 1 times [2021-11-04 13:22:37,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:22:37,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321208701] [2021-11-04 13:22:37,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:22:37,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:22:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:22:39,796 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:22:39,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:22:39,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321208701] [2021-11-04 13:22:39,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321208701] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:22:39,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:22:39,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-04 13:22:39,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464471283] [2021-11-04 13:22:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:22:39,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-04 13:22:39,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:22:39,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-04 13:22:39,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-04 13:22:39,798 INFO L87 Difference]: Start difference. First operand 6819 states and 8721 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:22:41,833 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:24:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:24:47,469 INFO L93 Difference]: Finished difference Result 7494 states and 9532 transitions. [2021-11-04 13:24:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-04 13:24:47,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-04 13:24:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:24:47,499 INFO L225 Difference]: With dead ends: 7494 [2021-11-04 13:24:47,500 INFO L226 Difference]: Without dead ends: 6901 [2021-11-04 13:24:47,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1391.85ms TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2021-11-04 13:24:47,514 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 843 mSDsluCounter, 53633 mSDsCounter, 0 mSdLazyCounter, 57681 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 117479.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 57693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 239.26ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57681 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 125484.60ms IncrementalHoareTripleChecker+Time [2021-11-04 13:24:47,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [843 Valid, 624 Invalid, 57693 Unknown, 0 Unchecked, 239.26ms Time], IncrementalHoareTripleChecker [11 Valid, 57681 Invalid, 1 Unknown, 0 Unchecked, 125484.60ms Time] [2021-11-04 13:24:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2021-11-04 13:24:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6832. [2021-11-04 13:24:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6832 states, 6638 states have (on average 1.2976800241036457) internal successors, (8614), 6755 states have internal predecessors, (8614), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:24:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 8734 transitions. [2021-11-04 13:24:47,647 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 8734 transitions. Word has length 40 [2021-11-04 13:24:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:24:47,648 INFO L470 AbstractCegarLoop]: Abstraction has 6832 states and 8734 transitions. [2021-11-04 13:24:47,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:24:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 8734 transitions. [2021-11-04 13:24:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 13:24:47,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:24:47,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:24:47,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 13:24:47,649 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:24:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:24:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1582428612, now seen corresponding path program 1 times [2021-11-04 13:24:47,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:24:47,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495112640] [2021-11-04 13:24:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:24:47,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:24:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:24:47,802 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:24:47,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:24:47,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495112640] [2021-11-04 13:24:47,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495112640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:24:47,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:24:47,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:24:47,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197280572] [2021-11-04 13:24:47,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:24:47,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:24:47,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:24:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:24:47,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:24:47,804 INFO L87 Difference]: Start difference. First operand 6832 states and 8734 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:24:50,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:25:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:25:11,034 INFO L93 Difference]: Finished difference Result 6832 states and 8734 transitions. [2021-11-04 13:25:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:25:11,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-04 13:25:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:25:11,045 INFO L225 Difference]: With dead ends: 6832 [2021-11-04 13:25:11,045 INFO L226 Difference]: Without dead ends: 6828 [2021-11-04 13:25:11,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:25:11,047 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4533 mSDsluCounter, 4377 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20436.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 38.56ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22751.69ms IncrementalHoareTripleChecker+Time [2021-11-04 13:25:11,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4533 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 38.56ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 22751.69ms Time] [2021-11-04 13:25:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6828 states. [2021-11-04 13:25:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6828 to 6828. [2021-11-04 13:25:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6828 states, 6636 states have (on average 1.2974683544303798) internal successors, (8610), 6751 states have internal predecessors, (8610), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:25:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6828 states to 6828 states and 8730 transitions. [2021-11-04 13:25:11,285 INFO L78 Accepts]: Start accepts. Automaton has 6828 states and 8730 transitions. Word has length 42 [2021-11-04 13:25:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:25:11,285 INFO L470 AbstractCegarLoop]: Abstraction has 6828 states and 8730 transitions. [2021-11-04 13:25:11,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:25:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 6828 states and 8730 transitions. [2021-11-04 13:25:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-04 13:25:11,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:25:11,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:25:11,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 13:25:11,286 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:25:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:25:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 295928776, now seen corresponding path program 1 times [2021-11-04 13:25:11,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:25:11,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7749455] [2021-11-04 13:25:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:25:11,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:25:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:25:11,474 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:25:11,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:25:11,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7749455] [2021-11-04 13:25:11,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7749455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:25:11,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:25:11,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:25:11,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241199907] [2021-11-04 13:25:11,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:25:11,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:25:11,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:25:11,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:25:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:25:11,477 INFO L87 Difference]: Start difference. First operand 6828 states and 8730 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:25:13,511 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:25:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:25:37,682 INFO L93 Difference]: Finished difference Result 6828 states and 8730 transitions. [2021-11-04 13:25:37,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:25:37,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-04 13:25:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:25:37,697 INFO L225 Difference]: With dead ends: 6828 [2021-11-04 13:25:37,697 INFO L226 Difference]: Without dead ends: 6824 [2021-11-04 13:25:37,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.15ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:25:37,702 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4519 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23085.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4519 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.08ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25676.83ms IncrementalHoareTripleChecker+Time [2021-11-04 13:25:37,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4519 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 41.08ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 25676.83ms Time] [2021-11-04 13:25:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2021-11-04 13:25:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 6824. [2021-11-04 13:25:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6824 states, 6634 states have (on average 1.2972565571299366) internal successors, (8606), 6747 states have internal predecessors, (8606), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 13:25:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6824 states to 6824 states and 8726 transitions. [2021-11-04 13:25:37,871 INFO L78 Accepts]: Start accepts. Automaton has 6824 states and 8726 transitions. Word has length 44 [2021-11-04 13:25:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:25:37,871 INFO L470 AbstractCegarLoop]: Abstraction has 6824 states and 8726 transitions. [2021-11-04 13:25:37,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:25:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 6824 states and 8726 transitions. [2021-11-04 13:25:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-04 13:25:37,872 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:25:37,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:25:37,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 13:25:37,873 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:25:37,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:25:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1006825962, now seen corresponding path program 1 times [2021-11-04 13:25:37,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:25:37,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320674163] [2021-11-04 13:25:37,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:25:37,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:25:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:25:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-04 13:25:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:25:38,087 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:25:38,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:25:38,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320674163] [2021-11-04 13:25:38,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320674163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:25:38,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:25:38,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 13:25:38,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686838789] [2021-11-04 13:25:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:25:38,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:25:38,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:25:38,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:25:38,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:25:38,089 INFO L87 Difference]: Start difference. First operand 6824 states and 8726 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:25:40,123 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:26:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:26:04,046 INFO L93 Difference]: Finished difference Result 13708 states and 17548 transitions. [2021-11-04 13:26:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:26:04,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-11-04 13:26:04,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:26:04,058 INFO L225 Difference]: With dead ends: 13708 [2021-11-04 13:26:04,058 INFO L226 Difference]: Without dead ends: 6928 [2021-11-04 13:26:04,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.71ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:26:04,073 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 4575 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 8863 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22381.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4583 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 52.26ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 8863 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25334.75ms IncrementalHoareTripleChecker+Time [2021-11-04 13:26:04,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4583 Valid, 49 Invalid, 8919 Unknown, 0 Unchecked, 52.26ms Time], IncrementalHoareTripleChecker [55 Valid, 8863 Invalid, 1 Unknown, 0 Unchecked, 25334.75ms Time] [2021-11-04 13:26:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2021-11-04 13:26:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 6858. [2021-11-04 13:26:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6858 states, 6665 states have (on average 1.2964741185296325) internal successors, (8641), 6780 states have internal predecessors, (8641), 48 states have call successors, (48), 30 states have call predecessors, (48), 34 states have return successors, (82), 49 states have call predecessors, (82), 48 states have call successors, (82) [2021-11-04 13:26:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6858 states to 6858 states and 8771 transitions. [2021-11-04 13:26:04,224 INFO L78 Accepts]: Start accepts. Automaton has 6858 states and 8771 transitions. Word has length 46 [2021-11-04 13:26:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:26:04,224 INFO L470 AbstractCegarLoop]: Abstraction has 6858 states and 8771 transitions. [2021-11-04 13:26:04,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:26:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 6858 states and 8771 transitions. [2021-11-04 13:26:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-04 13:26:04,225 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:26:04,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:26:04,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 13:26:04,225 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:26:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:26:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 920167980, now seen corresponding path program 1 times [2021-11-04 13:26:04,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:26:04,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903526216] [2021-11-04 13:26:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:26:04,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:26:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:26:04,392 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:26:04,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:26:04,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903526216] [2021-11-04 13:26:04,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903526216] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:26:04,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:26:04,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:26:04,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054097910] [2021-11-04 13:26:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:26:04,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:26:04,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:26:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:26:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:26:04,394 INFO L87 Difference]: Start difference. First operand 6858 states and 8771 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:26:06,873 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:26:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:26:29,256 INFO L93 Difference]: Finished difference Result 6858 states and 8771 transitions. [2021-11-04 13:26:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:26:29,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-04 13:26:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:26:29,271 INFO L225 Difference]: With dead ends: 6858 [2021-11-04 13:26:29,271 INFO L226 Difference]: Without dead ends: 6854 [2021-11-04 13:26:29,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.11ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:26:29,280 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4501 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 8748 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21622.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4501 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 37.17ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8748 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24335.65ms IncrementalHoareTripleChecker+Time [2021-11-04 13:26:29,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4501 Valid, 96 Invalid, 8751 Unknown, 0 Unchecked, 37.17ms Time], IncrementalHoareTripleChecker [2 Valid, 8748 Invalid, 1 Unknown, 0 Unchecked, 24335.65ms Time] [2021-11-04 13:26:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6854 states. [2021-11-04 13:26:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6854 to 6854. [2021-11-04 13:26:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6854 states, 6663 states have (on average 1.2962629446195408) internal successors, (8637), 6776 states have internal predecessors, (8637), 48 states have call successors, (48), 30 states have call predecessors, (48), 34 states have return successors, (82), 49 states have call predecessors, (82), 48 states have call successors, (82) [2021-11-04 13:26:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6854 states to 6854 states and 8767 transitions. [2021-11-04 13:26:29,480 INFO L78 Accepts]: Start accepts. Automaton has 6854 states and 8767 transitions. Word has length 46 [2021-11-04 13:26:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:26:29,480 INFO L470 AbstractCegarLoop]: Abstraction has 6854 states and 8767 transitions. [2021-11-04 13:26:29,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:26:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6854 states and 8767 transitions. [2021-11-04 13:26:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-04 13:26:29,481 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:26:29,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:26:29,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 13:26:29,482 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:26:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:26:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1477068798, now seen corresponding path program 1 times [2021-11-04 13:26:29,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:26:29,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172444539] [2021-11-04 13:26:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:26:29,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:26:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:26:29,742 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:26:29,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:26:29,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172444539] [2021-11-04 13:26:29,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172444539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:26:29,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:26:29,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 13:26:29,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540755905] [2021-11-04 13:26:29,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:26:29,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 13:26:29,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:26:29,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 13:26:29,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:26:29,743 INFO L87 Difference]: Start difference. First operand 6854 states and 8767 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:26:31,780 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:27:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:27:04,762 INFO L93 Difference]: Finished difference Result 14352 states and 18422 transitions. [2021-11-04 13:27:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:27:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-04 13:27:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:27:04,781 INFO L225 Difference]: With dead ends: 14352 [2021-11-04 13:27:04,782 INFO L226 Difference]: Without dead ends: 7542 [2021-11-04 13:27:04,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.72ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 13:27:04,800 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 4292 mSDsluCounter, 9475 mSDsCounter, 0 mSdLazyCounter, 13801 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30763.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4292 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 13809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 64.76ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13801 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34244.76ms IncrementalHoareTripleChecker+Time [2021-11-04 13:27:04,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4292 Valid, 172 Invalid, 13809 Unknown, 0 Unchecked, 64.76ms Time], IncrementalHoareTripleChecker [7 Valid, 13801 Invalid, 1 Unknown, 0 Unchecked, 34244.76ms Time] [2021-11-04 13:27:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7542 states. [2021-11-04 13:27:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7542 to 7526. [2021-11-04 13:27:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7526 states, 7315 states have (on average 1.2963773069036226) internal successors, (9483), 7432 states have internal predecessors, (9483), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:27:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7526 states to 7526 states and 9642 transitions. [2021-11-04 13:27:04,999 INFO L78 Accepts]: Start accepts. Automaton has 7526 states and 9642 transitions. Word has length 48 [2021-11-04 13:27:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:27:04,999 INFO L470 AbstractCegarLoop]: Abstraction has 7526 states and 9642 transitions. [2021-11-04 13:27:04,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:27:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7526 states and 9642 transitions. [2021-11-04 13:27:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-04 13:27:05,000 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:27:05,000 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:27:05,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 13:27:05,000 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:27:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:27:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1477128380, now seen corresponding path program 1 times [2021-11-04 13:27:05,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:27:05,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302288506] [2021-11-04 13:27:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:27:05,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:27:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:27:05,126 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:27:05,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:27:05,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302288506] [2021-11-04 13:27:05,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302288506] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:27:05,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:27:05,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 13:27:05,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106259719] [2021-11-04 13:27:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:27:05,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:27:05,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:27:05,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:27:05,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:27:05,128 INFO L87 Difference]: Start difference. First operand 7526 states and 9642 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:27:07,161 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:27:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:27:38,573 INFO L93 Difference]: Finished difference Result 7532 states and 9650 transitions. [2021-11-04 13:27:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:27:38,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-04 13:27:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:27:38,586 INFO L225 Difference]: With dead ends: 7532 [2021-11-04 13:27:38,586 INFO L226 Difference]: Without dead ends: 7530 [2021-11-04 13:27:38,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.67ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:27:38,591 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 8854 mSDsCounter, 0 mSdLazyCounter, 13173 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29226.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 50.84ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13173 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32826.80ms IncrementalHoareTripleChecker+Time [2021-11-04 13:27:38,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 146 Invalid, 13178 Unknown, 0 Unchecked, 50.84ms Time], IncrementalHoareTripleChecker [4 Valid, 13173 Invalid, 1 Unknown, 0 Unchecked, 32826.80ms Time] [2021-11-04 13:27:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7530 states. [2021-11-04 13:27:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7530 to 7524. [2021-11-04 13:27:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7524 states, 7314 states have (on average 1.296007656549084) internal successors, (9479), 7430 states have internal predecessors, (9479), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:27:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7524 states to 7524 states and 9638 transitions. [2021-11-04 13:27:38,863 INFO L78 Accepts]: Start accepts. Automaton has 7524 states and 9638 transitions. Word has length 48 [2021-11-04 13:27:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:27:38,864 INFO L470 AbstractCegarLoop]: Abstraction has 7524 states and 9638 transitions. [2021-11-04 13:27:38,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:27:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7524 states and 9638 transitions. [2021-11-04 13:27:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-04 13:27:38,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:27:38,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:27:38,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 13:27:38,865 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:27:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:27:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash -481378064, now seen corresponding path program 1 times [2021-11-04 13:27:38,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:27:38,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680234476] [2021-11-04 13:27:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:27:38,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:27:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:27:38,995 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:27:38,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:27:38,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680234476] [2021-11-04 13:27:38,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680234476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:27:38,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:27:38,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:27:38,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607125031] [2021-11-04 13:27:38,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:27:38,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:27:38,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:27:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:27:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:27:38,999 INFO L87 Difference]: Start difference. First operand 7524 states and 9638 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:27:41,032 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:28:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:28:05,137 INFO L93 Difference]: Finished difference Result 7524 states and 9638 transitions. [2021-11-04 13:28:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:28:05,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-04 13:28:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:28:05,148 INFO L225 Difference]: With dead ends: 7524 [2021-11-04 13:28:05,149 INFO L226 Difference]: Without dead ends: 7520 [2021-11-04 13:28:05,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:28:05,152 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4484 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 8742 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22520.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4484 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.32ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8742 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25563.30ms IncrementalHoareTripleChecker+Time [2021-11-04 13:28:05,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4484 Valid, 96 Invalid, 8745 Unknown, 0 Unchecked, 43.32ms Time], IncrementalHoareTripleChecker [2 Valid, 8742 Invalid, 1 Unknown, 0 Unchecked, 25563.30ms Time] [2021-11-04 13:28:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7520 states. [2021-11-04 13:28:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7520 to 7520. [2021-11-04 13:28:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7520 states, 7312 states have (on average 1.2958150984682713) internal successors, (9475), 7426 states have internal predecessors, (9475), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:28:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7520 states to 7520 states and 9634 transitions. [2021-11-04 13:28:05,346 INFO L78 Accepts]: Start accepts. Automaton has 7520 states and 9634 transitions. Word has length 48 [2021-11-04 13:28:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:28:05,346 INFO L470 AbstractCegarLoop]: Abstraction has 7520 states and 9634 transitions. [2021-11-04 13:28:05,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:28:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 7520 states and 9634 transitions. [2021-11-04 13:28:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-04 13:28:05,347 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:28:05,347 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 13:28:05,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 13:28:05,347 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:28:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:28:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2032833628, now seen corresponding path program 1 times [2021-11-04 13:28:05,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:28:05,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640037550] [2021-11-04 13:28:05,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:28:05,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:28:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:28:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-04 13:28:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:28:05,608 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:28:05,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:28:05,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640037550] [2021-11-04 13:28:05,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640037550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:28:05,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:28:05,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 13:28:05,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760120524] [2021-11-04 13:28:05,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:28:05,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 13:28:05,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:28:05,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 13:28:05,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 13:28:05,611 INFO L87 Difference]: Start difference. First operand 7520 states and 9634 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:28:07,650 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:28:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:28:33,453 INFO L93 Difference]: Finished difference Result 15064 states and 19314 transitions. [2021-11-04 13:28:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:28:33,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-11-04 13:28:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:28:33,470 INFO L225 Difference]: With dead ends: 15064 [2021-11-04 13:28:33,471 INFO L226 Difference]: Without dead ends: 7588 [2021-11-04 13:28:33,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 299.27ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-04 13:28:33,487 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 13303 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 8923 mSolverCounterSat, 269 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23706.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13303 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 9193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 79.68ms SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 8923 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26970.66ms IncrementalHoareTripleChecker+Time [2021-11-04 13:28:33,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13303 Valid, 49 Invalid, 9193 Unknown, 0 Unchecked, 79.68ms Time], IncrementalHoareTripleChecker [269 Valid, 8923 Invalid, 1 Unknown, 0 Unchecked, 26970.66ms Time] [2021-11-04 13:28:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7588 states. [2021-11-04 13:28:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7588 to 7516. [2021-11-04 13:28:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7516 states, 7309 states have (on average 1.2953892461349021) internal successors, (9468), 7422 states have internal predecessors, (9468), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:28:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7516 states to 7516 states and 9627 transitions. [2021-11-04 13:28:33,714 INFO L78 Accepts]: Start accepts. Automaton has 7516 states and 9627 transitions. Word has length 49 [2021-11-04 13:28:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:28:33,715 INFO L470 AbstractCegarLoop]: Abstraction has 7516 states and 9627 transitions. [2021-11-04 13:28:33,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:28:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states and 9627 transitions. [2021-11-04 13:28:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-04 13:28:33,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:28:33,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:28:33,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 13:28:33,716 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:28:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:28:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1252604948, now seen corresponding path program 1 times [2021-11-04 13:28:33,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:28:33,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104894376] [2021-11-04 13:28:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:28:33,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:28:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:28:33,885 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:28:33,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:28:33,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104894376] [2021-11-04 13:28:33,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104894376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:28:33,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:28:33,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:28:33,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441614616] [2021-11-04 13:28:33,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:28:33,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:28:33,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:28:33,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:28:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:28:33,887 INFO L87 Difference]: Start difference. First operand 7516 states and 9627 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:28:36,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:29:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:29:00,132 INFO L93 Difference]: Finished difference Result 7516 states and 9627 transitions. [2021-11-04 13:29:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:29:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-04 13:29:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:29:00,142 INFO L225 Difference]: With dead ends: 7516 [2021-11-04 13:29:00,142 INFO L226 Difference]: Without dead ends: 7512 [2021-11-04 13:29:00,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.61ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:29:00,145 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4466 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 8734 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22370.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4466 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.55ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8734 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25655.43ms IncrementalHoareTripleChecker+Time [2021-11-04 13:29:00,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4466 Valid, 96 Invalid, 8737 Unknown, 0 Unchecked, 41.55ms Time], IncrementalHoareTripleChecker [2 Valid, 8734 Invalid, 1 Unknown, 0 Unchecked, 25655.43ms Time] [2021-11-04 13:29:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7512 states. [2021-11-04 13:29:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7512 to 7512. [2021-11-04 13:29:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7512 states, 7307 states have (on average 1.2951963870261394) internal successors, (9464), 7418 states have internal predecessors, (9464), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:29:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 9623 transitions. [2021-11-04 13:29:00,411 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 9623 transitions. Word has length 50 [2021-11-04 13:29:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:29:00,412 INFO L470 AbstractCegarLoop]: Abstraction has 7512 states and 9623 transitions. [2021-11-04 13:29:00,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:29:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 9623 transitions. [2021-11-04 13:29:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-04 13:29:00,413 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:29:00,413 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 13:29:00,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 13:29:00,413 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:29:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:29:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1098650111, now seen corresponding path program 1 times [2021-11-04 13:29:00,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:29:00,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332040850] [2021-11-04 13:29:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:29:00,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:29:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:29:00,534 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:29:00,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:29:00,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332040850] [2021-11-04 13:29:00,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332040850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:29:00,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:29:00,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 13:29:00,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012622952] [2021-11-04 13:29:00,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:29:00,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 13:29:00,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:29:00,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 13:29:00,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 13:29:00,536 INFO L87 Difference]: Start difference. First operand 7512 states and 9623 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:29:03,557 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:29:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:29:18,741 INFO L93 Difference]: Finished difference Result 14923 states and 19172 transitions. [2021-11-04 13:29:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 13:29:18,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 13:29:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:29:18,753 INFO L225 Difference]: With dead ends: 14923 [2021-11-04 13:29:18,753 INFO L226 Difference]: Without dead ends: 7455 [2021-11-04 13:29:18,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.12ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 13:29:18,770 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4345 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15265.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4345 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 4358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.35ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17654.63ms IncrementalHoareTripleChecker+Time [2021-11-04 13:29:18,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4345 Valid, 48 Invalid, 4358 Unknown, 0 Unchecked, 12.35ms Time], IncrementalHoareTripleChecker [13 Valid, 4344 Invalid, 1 Unknown, 0 Unchecked, 17654.63ms Time] [2021-11-04 13:29:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2021-11-04 13:29:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2021-11-04 13:29:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7264 states have (on average 1.2889592511013215) internal successors, (9363), 7361 states have internal predecessors, (9363), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:29:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9522 transitions. [2021-11-04 13:29:18,987 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9522 transitions. Word has length 51 [2021-11-04 13:29:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:29:18,987 INFO L470 AbstractCegarLoop]: Abstraction has 7455 states and 9522 transitions. [2021-11-04 13:29:18,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:29:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9522 transitions. [2021-11-04 13:29:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-04 13:29:18,988 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:29:18,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:29:18,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 13:29:18,989 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:29:18,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:29:18,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1162968984, now seen corresponding path program 1 times [2021-11-04 13:29:18,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:29:18,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389436863] [2021-11-04 13:29:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:29:18,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:29:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:29:19,131 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:29:19,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:29:19,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389436863] [2021-11-04 13:29:19,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389436863] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:29:19,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:29:19,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:29:19,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512735844] [2021-11-04 13:29:19,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:29:19,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:29:19,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:29:19,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:29:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:29:19,133 INFO L87 Difference]: Start difference. First operand 7455 states and 9522 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:29:21,572 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:29:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:29:50,738 INFO L93 Difference]: Finished difference Result 7455 states and 9522 transitions. [2021-11-04 13:29:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:29:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-04 13:29:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:29:50,750 INFO L225 Difference]: With dead ends: 7455 [2021-11-04 13:29:50,750 INFO L226 Difference]: Without dead ends: 7451 [2021-11-04 13:29:50,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.61ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:29:50,755 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4396 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26701.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4396 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 50.43ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30851.33ms IncrementalHoareTripleChecker+Time [2021-11-04 13:29:50,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4396 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 50.43ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 30851.33ms Time] [2021-11-04 13:29:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2021-11-04 13:29:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7451. [2021-11-04 13:29:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7451 states, 7262 states have (on average 1.2887634260534289) internal successors, (9359), 7357 states have internal predecessors, (9359), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:29:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9518 transitions. [2021-11-04 13:29:51,032 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9518 transitions. Word has length 52 [2021-11-04 13:29:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:29:51,032 INFO L470 AbstractCegarLoop]: Abstraction has 7451 states and 9518 transitions. [2021-11-04 13:29:51,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:29:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9518 transitions. [2021-11-04 13:29:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 13:29:51,033 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:29:51,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:29:51,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 13:29:51,034 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:29:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:29:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 922153852, now seen corresponding path program 1 times [2021-11-04 13:29:51,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:29:51,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098595815] [2021-11-04 13:29:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:29:51,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:29:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:29:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:29:51,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:29:51,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098595815] [2021-11-04 13:29:51,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098595815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:29:51,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:29:51,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:29:51,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191850981] [2021-11-04 13:29:51,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:29:51,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:29:51,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:29:51,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:29:51,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:29:51,221 INFO L87 Difference]: Start difference. First operand 7451 states and 9518 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:29:53,462 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:30:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:30:20,274 INFO L93 Difference]: Finished difference Result 7451 states and 9518 transitions. [2021-11-04 13:30:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:30:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-04 13:30:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:30:20,282 INFO L225 Difference]: With dead ends: 7451 [2021-11-04 13:30:20,282 INFO L226 Difference]: Without dead ends: 7447 [2021-11-04 13:30:20,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.18ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:30:20,302 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4382 mSDsluCounter, 4334 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24629.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4382 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 46.99ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28293.36ms IncrementalHoareTripleChecker+Time [2021-11-04 13:30:20,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4382 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 46.99ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 28293.36ms Time] [2021-11-04 13:30:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7447 states. [2021-11-04 13:30:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7447 to 7447. [2021-11-04 13:30:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7447 states, 7260 states have (on average 1.2885674931129476) internal successors, (9355), 7353 states have internal predecessors, (9355), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:30:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7447 states to 7447 states and 9514 transitions. [2021-11-04 13:30:20,584 INFO L78 Accepts]: Start accepts. Automaton has 7447 states and 9514 transitions. Word has length 54 [2021-11-04 13:30:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:30:20,584 INFO L470 AbstractCegarLoop]: Abstraction has 7447 states and 9514 transitions. [2021-11-04 13:30:20,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:30:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7447 states and 9514 transitions. [2021-11-04 13:30:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-04 13:30:20,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:30:20,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:30:20,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-04 13:30:20,586 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:30:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:30:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1427046336, now seen corresponding path program 1 times [2021-11-04 13:30:20,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:30:20,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763372097] [2021-11-04 13:30:20,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:30:20,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:30:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:30:20,815 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:30:20,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:30:20,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763372097] [2021-11-04 13:30:20,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763372097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:30:20,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:30:20,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:30:20,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817574515] [2021-11-04 13:30:20,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:30:20,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:30:20,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:30:20,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:30:20,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:30:20,817 INFO L87 Difference]: Start difference. First operand 7447 states and 9514 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:30:22,861 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:30:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:30:50,378 INFO L93 Difference]: Finished difference Result 7447 states and 9514 transitions. [2021-11-04 13:30:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:30:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-04 13:30:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:30:50,391 INFO L225 Difference]: With dead ends: 7447 [2021-11-04 13:30:50,391 INFO L226 Difference]: Without dead ends: 7443 [2021-11-04 13:30:50,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.34ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:30:50,395 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4368 mSDsluCounter, 4338 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24738.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4368 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.55ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28850.19ms IncrementalHoareTripleChecker+Time [2021-11-04 13:30:50,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4368 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 47.55ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 28850.19ms Time] [2021-11-04 13:30:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7443 states. [2021-11-04 13:30:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7443 to 7443. [2021-11-04 13:30:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 7258 states have (on average 1.2883714521906862) internal successors, (9351), 7349 states have internal predecessors, (9351), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:30:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 9510 transitions. [2021-11-04 13:30:50,668 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 9510 transitions. Word has length 56 [2021-11-04 13:30:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:30:50,669 INFO L470 AbstractCegarLoop]: Abstraction has 7443 states and 9510 transitions. [2021-11-04 13:30:50,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:30:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 9510 transitions. [2021-11-04 13:30:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-04 13:30:50,670 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:30:50,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:30:50,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-04 13:30:50,670 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:30:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:30:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1297419364, now seen corresponding path program 1 times [2021-11-04 13:30:50,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:30:50,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974518346] [2021-11-04 13:30:50,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:30:50,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:30:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:30:50,902 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:30:50,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:30:50,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974518346] [2021-11-04 13:30:50,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974518346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:30:50,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:30:50,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:30:50,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468882013] [2021-11-04 13:30:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:30:50,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:30:50,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:30:50,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:30:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:30:50,906 INFO L87 Difference]: Start difference. First operand 7443 states and 9510 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:30:52,944 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:31:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:31:21,863 INFO L93 Difference]: Finished difference Result 7443 states and 9510 transitions. [2021-11-04 13:31:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:31:21,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-04 13:31:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:31:21,874 INFO L225 Difference]: With dead ends: 7443 [2021-11-04 13:31:21,874 INFO L226 Difference]: Without dead ends: 7439 [2021-11-04 13:31:21,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:31:21,878 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4354 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26027.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4354 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 48.19ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30218.25ms IncrementalHoareTripleChecker+Time [2021-11-04 13:31:21,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4354 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 48.19ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 30218.25ms Time] [2021-11-04 13:31:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7439 states. [2021-11-04 13:31:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7439 to 7439. [2021-11-04 13:31:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7439 states, 7256 states have (on average 1.288175303197354) internal successors, (9347), 7345 states have internal predecessors, (9347), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:31:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7439 states to 7439 states and 9506 transitions. [2021-11-04 13:31:22,167 INFO L78 Accepts]: Start accepts. Automaton has 7439 states and 9506 transitions. Word has length 58 [2021-11-04 13:31:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:31:22,167 INFO L470 AbstractCegarLoop]: Abstraction has 7439 states and 9506 transitions. [2021-11-04 13:31:22,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:31:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 7439 states and 9506 transitions. [2021-11-04 13:31:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-04 13:31:22,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:31:22,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:31:22,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-04 13:31:22,169 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:31:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:31:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1279951208, now seen corresponding path program 1 times [2021-11-04 13:31:22,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:31:22,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594145589] [2021-11-04 13:31:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:31:22,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:31:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:31:22,325 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:31:22,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:31:22,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594145589] [2021-11-04 13:31:22,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594145589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:31:22,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:31:22,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:31:22,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674036323] [2021-11-04 13:31:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:31:22,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:31:22,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:31:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:31:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:31:22,326 INFO L87 Difference]: Start difference. First operand 7439 states and 9506 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:31:24,367 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:31:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:31:51,664 INFO L93 Difference]: Finished difference Result 7439 states and 9506 transitions. [2021-11-04 13:31:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:31:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-04 13:31:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:31:51,673 INFO L225 Difference]: With dead ends: 7439 [2021-11-04 13:31:51,674 INFO L226 Difference]: Without dead ends: 7435 [2021-11-04 13:31:51,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:31:51,676 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4340 mSDsluCounter, 4346 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24612.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4340 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.13ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28627.09ms IncrementalHoareTripleChecker+Time [2021-11-04 13:31:51,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4340 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 44.13ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 28627.09ms Time] [2021-11-04 13:31:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2021-11-04 13:31:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7435. [2021-11-04 13:31:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 7254 states have (on average 1.2879790460435623) internal successors, (9343), 7341 states have internal predecessors, (9343), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:31:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 9502 transitions. [2021-11-04 13:31:51,956 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 9502 transitions. Word has length 60 [2021-11-04 13:31:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:31:51,956 INFO L470 AbstractCegarLoop]: Abstraction has 7435 states and 9502 transitions. [2021-11-04 13:31:51,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:31:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9502 transitions. [2021-11-04 13:31:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-04 13:31:51,957 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:31:51,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:31:51,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-04 13:31:51,957 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:31:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:31:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1672922828, now seen corresponding path program 1 times [2021-11-04 13:31:51,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:31:51,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158895278] [2021-11-04 13:31:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:31:51,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:31:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:31:52,099 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:31:52,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:31:52,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158895278] [2021-11-04 13:31:52,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158895278] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:31:52,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:31:52,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:31:52,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873026941] [2021-11-04 13:31:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:31:52,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:31:52,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:31:52,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:31:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:31:52,101 INFO L87 Difference]: Start difference. First operand 7435 states and 9502 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:31:54,219 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 13:32:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:32:25,531 INFO L93 Difference]: Finished difference Result 7435 states and 9502 transitions. [2021-11-04 13:32:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:32:25,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-04 13:32:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:32:25,539 INFO L225 Difference]: With dead ends: 7435 [2021-11-04 13:32:25,539 INFO L226 Difference]: Without dead ends: 7431 [2021-11-04 13:32:25,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.38ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:32:25,540 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4326 mSDsluCounter, 4350 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27705.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4326 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 49.21ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32575.66ms IncrementalHoareTripleChecker+Time [2021-11-04 13:32:25,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4326 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 49.21ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 32575.66ms Time] [2021-11-04 13:32:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2021-11-04 13:32:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7431. [2021-11-04 13:32:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7431 states, 7252 states have (on average 1.2877826806398236) internal successors, (9339), 7337 states have internal predecessors, (9339), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:32:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7431 states to 7431 states and 9498 transitions. [2021-11-04 13:32:25,820 INFO L78 Accepts]: Start accepts. Automaton has 7431 states and 9498 transitions. Word has length 62 [2021-11-04 13:32:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:32:25,820 INFO L470 AbstractCegarLoop]: Abstraction has 7431 states and 9498 transitions. [2021-11-04 13:32:25,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:32:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 7431 states and 9498 transitions. [2021-11-04 13:32:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-04 13:32:25,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:32:25,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:32:25,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-04 13:32:25,822 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:32:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:32:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1361527952, now seen corresponding path program 1 times [2021-11-04 13:32:25,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:32:25,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873939136] [2021-11-04 13:32:25,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:32:25,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:32:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:32:25,961 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:32:25,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:32:25,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873939136] [2021-11-04 13:32:25,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873939136] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:32:25,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:32:25,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:32:25,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355691895] [2021-11-04 13:32:25,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:32:25,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:32:25,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:32:25,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:32:25,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:32:25,962 INFO L87 Difference]: Start difference. First operand 7431 states and 9498 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:32:28,030 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:33:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:33:05,117 INFO L93 Difference]: Finished difference Result 7431 states and 9498 transitions. [2021-11-04 13:33:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:33:05,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-04 13:33:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:33:05,130 INFO L225 Difference]: With dead ends: 7431 [2021-11-04 13:33:05,130 INFO L226 Difference]: Without dead ends: 7427 [2021-11-04 13:33:05,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:33:05,133 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4312 mSDsluCounter, 4354 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32353.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4312 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 60.67ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38291.64ms IncrementalHoareTripleChecker+Time [2021-11-04 13:33:05,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4312 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 60.67ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 38291.64ms Time] [2021-11-04 13:33:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7427 states. [2021-11-04 13:33:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7427 to 7427. [2021-11-04 13:33:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7250 states have (on average 1.2875862068965518) internal successors, (9335), 7333 states have internal predecessors, (9335), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-04 13:33:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 9494 transitions. [2021-11-04 13:33:05,498 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 9494 transitions. Word has length 64 [2021-11-04 13:33:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:33:05,498 INFO L470 AbstractCegarLoop]: Abstraction has 7427 states and 9494 transitions. [2021-11-04 13:33:05,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:33:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 9494 transitions. [2021-11-04 13:33:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-04 13:33:05,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:33:05,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:33:05,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-04 13:33:05,499 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-04 13:33:05,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:33:05,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1536204108, now seen corresponding path program 1 times [2021-11-04 13:33:05,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:33:05,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295846051] [2021-11-04 13:33:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:33:05,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:33:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:33:05,660 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:33:05,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:33:05,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295846051] [2021-11-04 13:33:05,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295846051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:33:05,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:33:05,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:33:05,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194021711] [2021-11-04 13:33:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:33:05,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:33:05,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:33:05,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:33:05,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:33:05,662 INFO L87 Difference]: Start difference. First operand 7427 states and 9494 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:33:07,734 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 [] Killed by 15