./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--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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--vme--bridges--vme_ca91cx42.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 a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-23 04:54:47,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 04:54:47,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 04:54:47,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 04:54:47,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 04:54:47,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 04:54:47,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 04:54:47,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 04:54:47,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 04:54:47,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 04:54:47,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 04:54:47,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 04:54:47,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 04:54:47,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 04:54:47,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 04:54:47,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 04:54:47,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 04:54:47,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 04:54:47,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 04:54:47,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 04:54:47,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 04:54:47,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 04:54:47,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 04:54:47,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 04:54:47,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 04:54:47,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 04:54:47,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 04:54:47,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 04:54:47,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 04:54:47,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 04:54:47,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 04:54:47,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 04:54:47,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 04:54:47,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 04:54:47,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 04:54:47,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 04:54:47,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 04:54:47,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 04:54:47,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 04:54:47,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 04:54:47,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 04:54:47,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-23 04:54:47,560 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 04:54:47,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 04:54:47,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 04:54:47,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 04:54:47,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 04:54:47,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 04:54:47,562 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 04:54:47,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 04:54:47,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 04:54:47,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 04:54:47,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 04:54:47,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 04:54:47,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 04:54:47,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 04:54:47,567 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 04:54:47,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 04:54:47,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 04:54:47,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 04:54:47,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 04:54:47,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 04:54:47,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 04:54:47,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 04:54:47,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 04:54:47,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 04:54:47,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 04:54:47,569 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 04:54:47,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 04:54:47,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 04:54:47,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 04:54:47,570 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 -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2021-11-23 04:54:47,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 04:54:47,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 04:54:47,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 04:54:47,825 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 04:54:47,828 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 04:54:47,829 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--vme--bridges--vme_ca91cx42.ko.cil.i [2021-11-23 04:54:47,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e36a1c1c/7605ab1993e64e7c9de68bc98ccd950f/FLAG823f4edc6 [2021-11-23 04:54:48,601 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 04:54:48,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2021-11-23 04:54:48,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e36a1c1c/7605ab1993e64e7c9de68bc98ccd950f/FLAG823f4edc6 [2021-11-23 04:54:48,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e36a1c1c/7605ab1993e64e7c9de68bc98ccd950f [2021-11-23 04:54:48,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 04:54:48,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 04:54:48,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 04:54:48,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 04:54:48,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 04:54:48,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:54:48" (1/1) ... [2021-11-23 04:54:48,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9fa0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:48, skipping insertion in model container [2021-11-23 04:54:48,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:54:48" (1/1) ... [2021-11-23 04:54:48,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 04:54:49,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 04:54:50,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2021-11-23 04:54:50,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2021-11-23 04:54:50,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2021-11-23 04:54:50,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2021-11-23 04:54:50,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2021-11-23 04:54:50,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2021-11-23 04:54:50,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2021-11-23 04:54:50,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2021-11-23 04:54:50,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2021-11-23 04:54:50,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2021-11-23 04:54:50,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2021-11-23 04:54:50,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2021-11-23 04:54:50,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2021-11-23 04:54:50,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2021-11-23 04:54:50,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2021-11-23 04:54:50,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2021-11-23 04:54:50,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2021-11-23 04:54:50,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2021-11-23 04:54:50,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2021-11-23 04:54:50,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2021-11-23 04:54:50,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2021-11-23 04:54:50,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2021-11-23 04:54:50,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2021-11-23 04:54:50,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2021-11-23 04:54:50,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2021-11-23 04:54:50,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2021-11-23 04:54:50,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2021-11-23 04:54:50,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2021-11-23 04:54:50,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2021-11-23 04:54:50,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2021-11-23 04:54:51,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2021-11-23 04:54:51,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2021-11-23 04:54:51,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2021-11-23 04:54:51,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2021-11-23 04:54:51,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2021-11-23 04:54:51,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2021-11-23 04:54:51,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2021-11-23 04:54:51,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2021-11-23 04:54:51,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2021-11-23 04:54:51,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2021-11-23 04:54:51,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2021-11-23 04:54:51,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2021-11-23 04:54:51,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2021-11-23 04:54:51,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2021-11-23 04:54:51,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2021-11-23 04:54:51,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2021-11-23 04:54:51,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2021-11-23 04:54:51,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2021-11-23 04:54:51,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2021-11-23 04:54:51,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2021-11-23 04:54:51,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2021-11-23 04:54:51,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2021-11-23 04:54:51,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2021-11-23 04:54:51,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2021-11-23 04:54:51,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2021-11-23 04:54:51,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2021-11-23 04:54:51,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2021-11-23 04:54:51,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2021-11-23 04:54:51,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2021-11-23 04:54:51,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2021-11-23 04:54:51,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2021-11-23 04:54:51,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2021-11-23 04:54:51,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2021-11-23 04:54:51,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2021-11-23 04:54:51,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2021-11-23 04:54:51,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2021-11-23 04:54:51,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2021-11-23 04:54:51,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2021-11-23 04:54:51,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2021-11-23 04:54:51,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2021-11-23 04:54:51,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2021-11-23 04:54:51,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2021-11-23 04:54:51,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2021-11-23 04:54:51,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2021-11-23 04:54:51,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2021-11-23 04:54:51,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2021-11-23 04:54:51,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2021-11-23 04:54:51,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2021-11-23 04:54:51,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2021-11-23 04:54:51,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2021-11-23 04:54:51,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2021-11-23 04:54:51,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2021-11-23 04:54:51,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2021-11-23 04:54:51,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2021-11-23 04:54:51,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2021-11-23 04:54:51,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2021-11-23 04:54:51,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2021-11-23 04:54:51,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2021-11-23 04:54:51,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 04:54:51,103 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 04:54:51,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2021-11-23 04:54:51,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2021-11-23 04:54:51,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2021-11-23 04:54:51,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2021-11-23 04:54:51,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2021-11-23 04:54:51,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2021-11-23 04:54:51,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2021-11-23 04:54:51,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2021-11-23 04:54:51,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2021-11-23 04:54:51,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2021-11-23 04:54:51,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2021-11-23 04:54:51,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2021-11-23 04:54:51,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2021-11-23 04:54:51,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2021-11-23 04:54:51,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2021-11-23 04:54:51,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2021-11-23 04:54:51,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2021-11-23 04:54:51,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2021-11-23 04:54:51,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2021-11-23 04:54:51,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2021-11-23 04:54:51,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2021-11-23 04:54:51,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2021-11-23 04:54:51,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2021-11-23 04:54:51,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2021-11-23 04:54:51,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2021-11-23 04:54:51,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2021-11-23 04:54:51,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2021-11-23 04:54:51,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2021-11-23 04:54:51,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2021-11-23 04:54:51,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2021-11-23 04:54:51,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2021-11-23 04:54:51,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2021-11-23 04:54:51,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2021-11-23 04:54:51,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2021-11-23 04:54:51,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2021-11-23 04:54:51,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2021-11-23 04:54:51,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2021-11-23 04:54:51,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2021-11-23 04:54:51,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2021-11-23 04:54:51,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2021-11-23 04:54:51,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2021-11-23 04:54:51,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2021-11-23 04:54:51,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2021-11-23 04:54:51,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2021-11-23 04:54:51,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2021-11-23 04:54:51,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2021-11-23 04:54:51,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2021-11-23 04:54:51,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2021-11-23 04:54:51,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2021-11-23 04:54:51,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2021-11-23 04:54:51,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2021-11-23 04:54:51,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2021-11-23 04:54:51,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2021-11-23 04:54:51,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2021-11-23 04:54:51,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2021-11-23 04:54:51,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2021-11-23 04:54:51,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2021-11-23 04:54:51,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2021-11-23 04:54:51,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2021-11-23 04:54:51,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2021-11-23 04:54:51,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2021-11-23 04:54:51,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2021-11-23 04:54:51,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2021-11-23 04:54:51,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2021-11-23 04:54:51,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2021-11-23 04:54:51,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2021-11-23 04:54:51,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2021-11-23 04:54:51,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2021-11-23 04:54:51,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2021-11-23 04:54:51,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2021-11-23 04:54:51,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2021-11-23 04:54:51,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2021-11-23 04:54:51,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2021-11-23 04:54:51,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2021-11-23 04:54:51,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2021-11-23 04:54:51,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2021-11-23 04:54:51,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2021-11-23 04:54:51,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2021-11-23 04:54:51,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2021-11-23 04:54:51,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2021-11-23 04:54:51,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2021-11-23 04:54:51,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2021-11-23 04:54:51,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2021-11-23 04:54:51,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2021-11-23 04:54:51,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2021-11-23 04:54:51,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2021-11-23 04:54:51,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2021-11-23 04:54:51,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2021-11-23 04:54:51,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 04:54:51,555 INFO L208 MainTranslator]: Completed translation [2021-11-23 04:54:51,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51 WrapperNode [2021-11-23 04:54:51,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 04:54:51,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 04:54:51,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 04:54:51,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 04:54:51,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,799 INFO L137 Inliner]: procedures = 571, calls = 1721, calls flagged for inlining = 854, calls inlined = 613, statements flattened = 4989 [2021-11-23 04:54:51,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 04:54:51,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 04:54:51,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 04:54:51,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 04:54:51,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 04:54:51,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 04:54:51,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 04:54:51,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 04:54:51,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (1/1) ... [2021-11-23 04:54:51,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 04:54:52,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:54:52,020 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-23 04:54:52,049 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-23 04:54:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 04:54:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-23 04:54:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 04:54:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 04:54:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 04:54:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 04:54:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 04:54:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 04:54:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 04:54:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 04:54:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 04:54:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 04:54:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 04:54:52,606 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 04:54:52,607 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 04:54:55,506 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L7254: #t~ret831#1 := main_#res#1;assume { :end_inline_main } true; [2021-11-23 04:54:55,507 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_pci_pci_instance_1_switch_break#1: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2021-11-23 04:54:55,507 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_6_returnLabel#1: assume { :end_inline_ldv_entry_EMGentry_6 } true;main_#res#1 := 0; [2021-11-23 04:54:55,507 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-23 04:54:55,508 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 04:54:55,526 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 04:54:55,527 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 04:54:55,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:54:55 BoogieIcfgContainer [2021-11-23 04:54:55,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 04:54:55,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 04:54:55,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 04:54:55,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 04:54:55,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:54:48" (1/3) ... [2021-11-23 04:54:55,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4265bcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:54:55, skipping insertion in model container [2021-11-23 04:54:55,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:54:51" (2/3) ... [2021-11-23 04:54:55,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4265bcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:54:55, skipping insertion in model container [2021-11-23 04:54:55,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:54:55" (3/3) ... [2021-11-23 04:54:55,537 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2021-11-23 04:54:55,541 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 04:54:55,541 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-11-23 04:54:55,588 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 04:54:55,596 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-23 04:54:55,596 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-11-23 04:54:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 1120 states, 1049 states have (on average 1.3021925643469972) internal successors, (1366), 1119 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 04:54:55,632 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:55,633 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-23 04:54:55,633 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash -38765563, now seen corresponding path program 1 times [2021-11-23 04:54:55,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:55,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25097411] [2021-11-23 04:54:55,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:55,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:56,166 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-23 04:54:56,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:56,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25097411] [2021-11-23 04:54:56,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25097411] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:56,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:56,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:56,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100551061] [2021-11-23 04:54:56,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:56,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:56,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:56,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:56,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:56,202 INFO L87 Difference]: Start difference. First operand has 1120 states, 1049 states have (on average 1.3021925643469972) internal successors, (1366), 1119 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.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-23 04:54:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:56,396 INFO L93 Difference]: Finished difference Result 3253 states and 3969 transitions. [2021-11-23 04:54:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 04:54:56,399 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-23 04:54:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:56,424 INFO L225 Difference]: With dead ends: 3253 [2021-11-23 04:54:56,425 INFO L226 Difference]: Without dead ends: 2087 [2021-11-23 04:54:56,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:56,439 INFO L933 BasicCegarLoop]: 1722 mSDtfsCounter, 1655 mSDsluCounter, 2742 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 4464 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:56,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1655 Valid, 4464 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2021-11-23 04:54:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1466. [2021-11-23 04:54:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1395 states have (on average 1.207168458781362) internal successors, (1684), 1465 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1684 transitions. [2021-11-23 04:54:56,555 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1684 transitions. Word has length 28 [2021-11-23 04:54:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:56,556 INFO L470 AbstractCegarLoop]: Abstraction has 1466 states and 1684 transitions. [2021-11-23 04:54:56,556 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-23 04:54:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1684 transitions. [2021-11-23 04:54:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 04:54:56,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:56,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:54:56,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 04:54:56,559 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:56,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash 487566453, now seen corresponding path program 1 times [2021-11-23 04:54:56,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980005237] [2021-11-23 04:54:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:56,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:56,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-23 04:54:56,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:56,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980005237] [2021-11-23 04:54:56,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980005237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:56,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:56,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:56,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461499482] [2021-11-23 04:54:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:56,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:56,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:56,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:56,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:56,745 INFO L87 Difference]: Start difference. First operand 1466 states and 1684 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:56,798 INFO L93 Difference]: Finished difference Result 1466 states and 1684 transitions. [2021-11-23 04:54:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:54:56,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-23 04:54:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:56,803 INFO L225 Difference]: With dead ends: 1466 [2021-11-23 04:54:56,804 INFO L226 Difference]: Without dead ends: 1462 [2021-11-23 04:54:56,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:56,805 INFO L933 BasicCegarLoop]: 1192 mSDtfsCounter, 1356 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:56,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1356 Valid, 2198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2021-11-23 04:54:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1462. [2021-11-23 04:54:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1393 states have (on average 1.2060301507537687) internal successors, (1680), 1461 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1680 transitions. [2021-11-23 04:54:56,844 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1680 transitions. Word has length 31 [2021-11-23 04:54:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:56,845 INFO L470 AbstractCegarLoop]: Abstraction has 1462 states and 1680 transitions. [2021-11-23 04:54:56,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1680 transitions. [2021-11-23 04:54:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 04:54:56,847 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:56,847 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-23 04:54:56,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 04:54:56,847 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash -480930671, now seen corresponding path program 1 times [2021-11-23 04:54:56,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:56,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168064734] [2021-11-23 04:54:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:56,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:56,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-23 04:54:56,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:56,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168064734] [2021-11-23 04:54:56,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168064734] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:56,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:56,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:56,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031528874] [2021-11-23 04:54:56,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:56,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:56,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:56,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:56,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:56,998 INFO L87 Difference]: Start difference. First operand 1462 states and 1680 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-23 04:54:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:57,055 INFO L93 Difference]: Finished difference Result 1462 states and 1680 transitions. [2021-11-23 04:54:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:54:57,056 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-23 04:54:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:57,061 INFO L225 Difference]: With dead ends: 1462 [2021-11-23 04:54:57,061 INFO L226 Difference]: Without dead ends: 1458 [2021-11-23 04:54:57,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:57,064 INFO L933 BasicCegarLoop]: 1188 mSDtfsCounter, 1339 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:57,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1339 Valid, 2200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2021-11-23 04:54:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2021-11-23 04:54:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1391 states have (on average 1.2048885693745506) internal successors, (1676), 1457 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1676 transitions. [2021-11-23 04:54:57,117 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1676 transitions. Word has length 34 [2021-11-23 04:54:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:57,118 INFO L470 AbstractCegarLoop]: Abstraction has 1458 states and 1676 transitions. [2021-11-23 04:54:57,118 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-23 04:54:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1676 transitions. [2021-11-23 04:54:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 04:54:57,124 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:57,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:54:57,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 04:54:57,125 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash 611554689, now seen corresponding path program 1 times [2021-11-23 04:54:57,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:57,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939437449] [2021-11-23 04:54:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:57,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 04:54:57,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939437449] [2021-11-23 04:54:57,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939437449] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:57,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:57,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:57,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179288008] [2021-11-23 04:54:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:57,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:57,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:57,268 INFO L87 Difference]: Start difference. First operand 1458 states and 1676 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:57,336 INFO L93 Difference]: Finished difference Result 1458 states and 1676 transitions. [2021-11-23 04:54:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:54:57,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-23 04:54:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:57,342 INFO L225 Difference]: With dead ends: 1458 [2021-11-23 04:54:57,342 INFO L226 Difference]: Without dead ends: 1454 [2021-11-23 04:54:57,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:57,344 INFO L933 BasicCegarLoop]: 1184 mSDtfsCounter, 1322 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:57,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1322 Valid, 2202 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2021-11-23 04:54:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2021-11-23 04:54:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1389 states have (on average 1.2037437005039597) internal successors, (1672), 1453 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1672 transitions. [2021-11-23 04:54:57,408 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1672 transitions. Word has length 37 [2021-11-23 04:54:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:57,411 INFO L470 AbstractCegarLoop]: Abstraction has 1454 states and 1672 transitions. [2021-11-23 04:54:57,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1672 transitions. [2021-11-23 04:54:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 04:54:57,413 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:57,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] [2021-11-23 04:54:57,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 04:54:57,413 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash -419242723, now seen corresponding path program 1 times [2021-11-23 04:54:57,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:57,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948608261] [2021-11-23 04:54:57,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:57,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:57,552 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-23 04:54:57,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:57,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948608261] [2021-11-23 04:54:57,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948608261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:57,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:57,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:57,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728849405] [2021-11-23 04:54:57,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:57,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:57,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:57,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:57,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:57,555 INFO L87 Difference]: Start difference. First operand 1454 states and 1672 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-23 04:54:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:57,623 INFO L93 Difference]: Finished difference Result 1454 states and 1672 transitions. [2021-11-23 04:54:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:54:57,624 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-23 04:54:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:57,629 INFO L225 Difference]: With dead ends: 1454 [2021-11-23 04:54:57,629 INFO L226 Difference]: Without dead ends: 1450 [2021-11-23 04:54:57,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:57,630 INFO L933 BasicCegarLoop]: 1180 mSDtfsCounter, 1305 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:57,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1305 Valid, 2204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2021-11-23 04:54:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2021-11-23 04:54:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1387 states have (on average 1.202595529920692) internal successors, (1668), 1449 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1668 transitions. [2021-11-23 04:54:57,689 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1668 transitions. Word has length 40 [2021-11-23 04:54:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:57,689 INFO L470 AbstractCegarLoop]: Abstraction has 1450 states and 1668 transitions. [2021-11-23 04:54:57,689 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-23 04:54:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1668 transitions. [2021-11-23 04:54:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 04:54:57,690 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:57,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:54:57,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 04:54:57,691 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 111234701, now seen corresponding path program 1 times [2021-11-23 04:54:57,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:57,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545045981] [2021-11-23 04:54:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:57,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:57,783 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-23 04:54:57,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:57,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545045981] [2021-11-23 04:54:57,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545045981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:57,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:57,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:57,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467718856] [2021-11-23 04:54:57,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:57,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:57,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:57,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:57,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:57,786 INFO L87 Difference]: Start difference. First operand 1450 states and 1668 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:57,862 INFO L93 Difference]: Finished difference Result 1450 states and 1668 transitions. [2021-11-23 04:54:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:54:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-23 04:54:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:57,867 INFO L225 Difference]: With dead ends: 1450 [2021-11-23 04:54:57,867 INFO L226 Difference]: Without dead ends: 1446 [2021-11-23 04:54:57,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:57,868 INFO L933 BasicCegarLoop]: 1176 mSDtfsCounter, 1288 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:57,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1288 Valid, 2206 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-11-23 04:54:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1446. [2021-11-23 04:54:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1385 states have (on average 1.2014440433212996) internal successors, (1664), 1445 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1664 transitions. [2021-11-23 04:54:57,933 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1664 transitions. Word has length 43 [2021-11-23 04:54:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:57,933 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 1664 transitions. [2021-11-23 04:54:57,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1664 transitions. [2021-11-23 04:54:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 04:54:57,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:57,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:54:57,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 04:54:57,935 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:57,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash -183223525, now seen corresponding path program 1 times [2021-11-23 04:54:57,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:57,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34152637] [2021-11-23 04:54:57,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:57,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:58,083 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-23 04:54:58,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:58,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34152637] [2021-11-23 04:54:58,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34152637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:58,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:58,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:54:58,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586763533] [2021-11-23 04:54:58,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:58,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 04:54:58,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:58,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 04:54:58,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:58,087 INFO L87 Difference]: Start difference. First operand 1446 states and 1664 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:58,272 INFO L93 Difference]: Finished difference Result 3072 states and 3506 transitions. [2021-11-23 04:54:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 04:54:58,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-23 04:54:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:58,279 INFO L225 Difference]: With dead ends: 3072 [2021-11-23 04:54:58,279 INFO L226 Difference]: Without dead ends: 1660 [2021-11-23 04:54:58,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 04:54:58,283 INFO L933 BasicCegarLoop]: 1365 mSDtfsCounter, 3326 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3326 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:58,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3326 Valid, 1918 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:54:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2021-11-23 04:54:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1446. [2021-11-23 04:54:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1385 states have (on average 1.1913357400722022) internal successors, (1650), 1445 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1650 transitions. [2021-11-23 04:54:58,365 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1650 transitions. Word has length 43 [2021-11-23 04:54:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:58,366 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 1650 transitions. [2021-11-23 04:54:58,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1650 transitions. [2021-11-23 04:54:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 04:54:58,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:58,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:54:58,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 04:54:58,368 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:58,369 INFO L85 PathProgramCache]: Analyzing trace with hash -183163943, now seen corresponding path program 1 times [2021-11-23 04:54:58,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:58,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622192862] [2021-11-23 04:54:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:58,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:58,476 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-23 04:54:58,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:58,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622192862] [2021-11-23 04:54:58,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622192862] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:58,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:58,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:54:58,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610114908] [2021-11-23 04:54:58,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:58,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:58,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:58,478 INFO L87 Difference]: Start difference. First operand 1446 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:58,670 INFO L93 Difference]: Finished difference Result 1663 states and 1867 transitions. [2021-11-23 04:54:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 04:54:58,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-23 04:54:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:58,676 INFO L225 Difference]: With dead ends: 1663 [2021-11-23 04:54:58,676 INFO L226 Difference]: Without dead ends: 1649 [2021-11-23 04:54:58,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:58,677 INFO L933 BasicCegarLoop]: 1361 mSDtfsCounter, 2212 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:58,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2212 Valid, 1870 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2021-11-23 04:54:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1432. [2021-11-23 04:54:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1378 states have (on average 1.1821480406386067) internal successors, (1629), 1431 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1629 transitions. [2021-11-23 04:54:58,783 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1629 transitions. Word has length 43 [2021-11-23 04:54:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:58,783 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 1629 transitions. [2021-11-23 04:54:58,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1629 transitions. [2021-11-23 04:54:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 04:54:58,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:58,784 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-23 04:54:58,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 04:54:58,785 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1915464279, now seen corresponding path program 1 times [2021-11-23 04:54:58,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:58,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387229383] [2021-11-23 04:54:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:58,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:58,874 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-23 04:54:58,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:58,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387229383] [2021-11-23 04:54:58,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387229383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:58,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:58,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:58,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662994628] [2021-11-23 04:54:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:58,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:58,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:58,877 INFO L87 Difference]: Start difference. First operand 1432 states and 1629 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-23 04:54:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:58,974 INFO L93 Difference]: Finished difference Result 1432 states and 1629 transitions. [2021-11-23 04:54:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:54:58,974 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-23 04:54:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:58,979 INFO L225 Difference]: With dead ends: 1432 [2021-11-23 04:54:58,979 INFO L226 Difference]: Without dead ends: 1428 [2021-11-23 04:54:58,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:58,980 INFO L933 BasicCegarLoop]: 1151 mSDtfsCounter, 1250 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:58,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 2166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2021-11-23 04:54:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2021-11-23 04:54:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1376 states have (on average 1.1809593023255813) internal successors, (1625), 1427 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1625 transitions. [2021-11-23 04:54:59,093 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1625 transitions. Word has length 46 [2021-11-23 04:54:59,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:59,093 INFO L470 AbstractCegarLoop]: Abstraction has 1428 states and 1625 transitions. [2021-11-23 04:54:59,094 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-23 04:54:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1625 transitions. [2021-11-23 04:54:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-23 04:54:59,094 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:59,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:54:59,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 04:54:59,095 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:59,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1663335519, now seen corresponding path program 1 times [2021-11-23 04:54:59,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:59,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999927101] [2021-11-23 04:54:59,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:59,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:59,192 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-23 04:54:59,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999927101] [2021-11-23 04:54:59,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999927101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:59,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:59,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 04:54:59,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127859755] [2021-11-23 04:54:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:59,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:54:59,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:54:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:54:59,194 INFO L87 Difference]: Start difference. First operand 1428 states and 1625 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:59,298 INFO L93 Difference]: Finished difference Result 2780 states and 3165 transitions. [2021-11-23 04:54:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:54:59,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-23 04:54:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:59,303 INFO L225 Difference]: With dead ends: 2780 [2021-11-23 04:54:59,303 INFO L226 Difference]: Without dead ends: 1386 [2021-11-23 04:54:59,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:54:59,306 INFO L933 BasicCegarLoop]: 1113 mSDtfsCounter, 1076 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:59,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1076 Valid, 1113 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2021-11-23 04:54:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2021-11-23 04:54:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1341 states have (on average 1.1648023862788963) internal successors, (1562), 1385 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1562 transitions. [2021-11-23 04:54:59,386 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1562 transitions. Word has length 47 [2021-11-23 04:54:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:59,386 INFO L470 AbstractCegarLoop]: Abstraction has 1386 states and 1562 transitions. [2021-11-23 04:54:59,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1562 transitions. [2021-11-23 04:54:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-23 04:54:59,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:59,387 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-23 04:54:59,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 04:54:59,388 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash -654518375, now seen corresponding path program 1 times [2021-11-23 04:54:59,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:59,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391019303] [2021-11-23 04:54:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:59,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:59,473 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-23 04:54:59,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:59,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391019303] [2021-11-23 04:54:59,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391019303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:59,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:59,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:59,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007321862] [2021-11-23 04:54:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:59,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:59,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:59,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:59,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:59,476 INFO L87 Difference]: Start difference. First operand 1386 states and 1562 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:59,586 INFO L93 Difference]: Finished difference Result 1386 states and 1562 transitions. [2021-11-23 04:54:59,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:54:59,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-23 04:54:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:59,592 INFO L225 Difference]: With dead ends: 1386 [2021-11-23 04:54:59,592 INFO L226 Difference]: Without dead ends: 1382 [2021-11-23 04:54:59,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:59,593 INFO L933 BasicCegarLoop]: 1112 mSDtfsCounter, 1198 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:59,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 2098 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2021-11-23 04:54:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2021-11-23 04:54:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1339 states have (on average 1.1635548917102314) internal successors, (1558), 1381 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1558 transitions. [2021-11-23 04:54:59,687 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1558 transitions. Word has length 49 [2021-11-23 04:54:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:54:59,693 INFO L470 AbstractCegarLoop]: Abstraction has 1382 states and 1558 transitions. [2021-11-23 04:54:59,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1558 transitions. [2021-11-23 04:54:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-23 04:54:59,694 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:54:59,694 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-23 04:54:59,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 04:54:59,694 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:54:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:54:59,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1926728868, now seen corresponding path program 1 times [2021-11-23 04:54:59,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:54:59,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779687659] [2021-11-23 04:54:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:54:59,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:54:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:54:59,785 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-23 04:54:59,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:54:59,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779687659] [2021-11-23 04:54:59,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779687659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:54:59,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:54:59,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:54:59,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212151763] [2021-11-23 04:54:59,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:54:59,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:54:59,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:54:59,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:54:59,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:54:59,788 INFO L87 Difference]: Start difference. First operand 1382 states and 1558 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:54:59,885 INFO L93 Difference]: Finished difference Result 1382 states and 1558 transitions. [2021-11-23 04:54:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:54:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-23 04:54:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:54:59,890 INFO L225 Difference]: With dead ends: 1382 [2021-11-23 04:54:59,890 INFO L226 Difference]: Without dead ends: 1378 [2021-11-23 04:54:59,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:54:59,891 INFO L933 BasicCegarLoop]: 1108 mSDtfsCounter, 1184 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:54:59,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1184 Valid, 2098 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:54:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2021-11-23 04:54:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2021-11-23 04:54:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1337 states have (on average 1.162303664921466) internal successors, (1554), 1377 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:54:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1554 transitions. [2021-11-23 04:55:00,000 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1554 transitions. Word has length 51 [2021-11-23 04:55:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:00,000 INFO L470 AbstractCegarLoop]: Abstraction has 1378 states and 1554 transitions. [2021-11-23 04:55:00,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1554 transitions. [2021-11-23 04:55:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 04:55:00,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:00,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:00,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 04:55:00,002 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1230418340, now seen corresponding path program 1 times [2021-11-23 04:55:00,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:00,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428146753] [2021-11-23 04:55:00,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:00,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:00,088 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-23 04:55:00,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:00,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428146753] [2021-11-23 04:55:00,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428146753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:00,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:00,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:00,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967445866] [2021-11-23 04:55:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:00,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:00,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:00,090 INFO L87 Difference]: Start difference. First operand 1378 states and 1554 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-23 04:55:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:00,188 INFO L93 Difference]: Finished difference Result 1378 states and 1554 transitions. [2021-11-23 04:55:00,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:00,189 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-23 04:55:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:00,193 INFO L225 Difference]: With dead ends: 1378 [2021-11-23 04:55:00,193 INFO L226 Difference]: Without dead ends: 1374 [2021-11-23 04:55:00,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:00,194 INFO L933 BasicCegarLoop]: 1104 mSDtfsCounter, 1167 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:00,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1167 Valid, 2100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2021-11-23 04:55:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2021-11-23 04:55:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1335 states have (on average 1.1610486891385767) internal successors, (1550), 1373 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1550 transitions. [2021-11-23 04:55:00,286 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1550 transitions. Word has length 54 [2021-11-23 04:55:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:00,286 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 1550 transitions. [2021-11-23 04:55:00,286 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-23 04:55:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1550 transitions. [2021-11-23 04:55:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-23 04:55:00,287 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:00,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:00,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 04:55:00,288 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2135506456, now seen corresponding path program 1 times [2021-11-23 04:55:00,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:00,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503475041] [2021-11-23 04:55:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:00,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:00,376 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-23 04:55:00,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:00,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503475041] [2021-11-23 04:55:00,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503475041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:00,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:00,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:00,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089797767] [2021-11-23 04:55:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:00,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:00,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:00,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:00,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:00,379 INFO L87 Difference]: Start difference. First operand 1374 states and 1550 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:00,524 INFO L93 Difference]: Finished difference Result 1374 states and 1550 transitions. [2021-11-23 04:55:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:00,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-23 04:55:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:00,530 INFO L225 Difference]: With dead ends: 1374 [2021-11-23 04:55:00,530 INFO L226 Difference]: Without dead ends: 1370 [2021-11-23 04:55:00,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:00,531 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 1150 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:00,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1150 Valid, 2102 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2021-11-23 04:55:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1370. [2021-11-23 04:55:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1333 states have (on average 1.1597899474868718) internal successors, (1546), 1369 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1546 transitions. [2021-11-23 04:55:00,642 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1546 transitions. Word has length 57 [2021-11-23 04:55:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:00,642 INFO L470 AbstractCegarLoop]: Abstraction has 1370 states and 1546 transitions. [2021-11-23 04:55:00,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1546 transitions. [2021-11-23 04:55:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-23 04:55:00,643 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:00,643 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-23 04:55:00,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 04:55:00,644 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1810874008, now seen corresponding path program 1 times [2021-11-23 04:55:00,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:00,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764388426] [2021-11-23 04:55:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:00,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:00,729 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-23 04:55:00,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764388426] [2021-11-23 04:55:00,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764388426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:00,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:00,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:00,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772746273] [2021-11-23 04:55:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:00,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:00,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:00,732 INFO L87 Difference]: Start difference. First operand 1370 states and 1546 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-23 04:55:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:00,836 INFO L93 Difference]: Finished difference Result 1370 states and 1546 transitions. [2021-11-23 04:55:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:00,837 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-23 04:55:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:00,841 INFO L225 Difference]: With dead ends: 1370 [2021-11-23 04:55:00,841 INFO L226 Difference]: Without dead ends: 1366 [2021-11-23 04:55:00,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:00,842 INFO L933 BasicCegarLoop]: 1096 mSDtfsCounter, 1133 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:00,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1133 Valid, 2104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2021-11-23 04:55:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1366. [2021-11-23 04:55:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1331 states have (on average 1.158527422990233) internal successors, (1542), 1365 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1542 transitions. [2021-11-23 04:55:00,965 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1542 transitions. Word has length 60 [2021-11-23 04:55:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:00,966 INFO L470 AbstractCegarLoop]: Abstraction has 1366 states and 1542 transitions. [2021-11-23 04:55:00,966 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-23 04:55:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1542 transitions. [2021-11-23 04:55:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-23 04:55:00,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:00,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:00,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 04:55:00,967 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash -960846606, now seen corresponding path program 1 times [2021-11-23 04:55:00,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395605809] [2021-11-23 04:55:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:00,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:01,058 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-23 04:55:01,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:01,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395605809] [2021-11-23 04:55:01,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395605809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:01,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:01,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:01,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596337800] [2021-11-23 04:55:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:01,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:55:01,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:55:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:55:01,061 INFO L87 Difference]: Start difference. First operand 1366 states and 1542 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:01,186 INFO L93 Difference]: Finished difference Result 2692 states and 3041 transitions. [2021-11-23 04:55:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:55:01,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-23 04:55:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:01,191 INFO L225 Difference]: With dead ends: 2692 [2021-11-23 04:55:01,191 INFO L226 Difference]: Without dead ends: 1360 [2021-11-23 04:55:01,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:55:01,193 INFO L933 BasicCegarLoop]: 1094 mSDtfsCounter, 1067 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:01,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1067 Valid, 1094 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2021-11-23 04:55:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2021-11-23 04:55:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1326 states have (on average 1.1561085972850678) internal successors, (1533), 1359 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1533 transitions. [2021-11-23 04:55:01,292 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1533 transitions. Word has length 61 [2021-11-23 04:55:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:01,292 INFO L470 AbstractCegarLoop]: Abstraction has 1360 states and 1533 transitions. [2021-11-23 04:55:01,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1533 transitions. [2021-11-23 04:55:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-23 04:55:01,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:01,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:01,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 04:55:01,295 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1343012980, now seen corresponding path program 1 times [2021-11-23 04:55:01,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:01,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984614495] [2021-11-23 04:55:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:01,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:01,384 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-23 04:55:01,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:01,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984614495] [2021-11-23 04:55:01,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984614495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:01,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:01,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:01,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825429397] [2021-11-23 04:55:01,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:01,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:01,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:01,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:01,387 INFO L87 Difference]: Start difference. First operand 1360 states and 1533 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:01,499 INFO L93 Difference]: Finished difference Result 1360 states and 1533 transitions. [2021-11-23 04:55:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:01,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-23 04:55:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:01,504 INFO L225 Difference]: With dead ends: 1360 [2021-11-23 04:55:01,504 INFO L226 Difference]: Without dead ends: 1356 [2021-11-23 04:55:01,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:01,505 INFO L933 BasicCegarLoop]: 1087 mSDtfsCounter, 1111 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:01,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1111 Valid, 2096 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2021-11-23 04:55:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2021-11-23 04:55:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1324 states have (on average 1.154833836858006) internal successors, (1529), 1355 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1529 transitions. [2021-11-23 04:55:01,594 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1529 transitions. Word has length 63 [2021-11-23 04:55:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:01,595 INFO L470 AbstractCegarLoop]: Abstraction has 1356 states and 1529 transitions. [2021-11-23 04:55:01,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1529 transitions. [2021-11-23 04:55:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-23 04:55:01,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:01,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:01,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 04:55:01,596 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2128152355, now seen corresponding path program 1 times [2021-11-23 04:55:01,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:01,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165573329] [2021-11-23 04:55:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:01,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:01,698 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-23 04:55:01,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:01,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165573329] [2021-11-23 04:55:01,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165573329] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:01,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:01,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 04:55:01,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666820381] [2021-11-23 04:55:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:01,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 04:55:01,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:01,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 04:55:01,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:01,701 INFO L87 Difference]: Start difference. First operand 1356 states and 1529 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:01,856 INFO L93 Difference]: Finished difference Result 2672 states and 3015 transitions. [2021-11-23 04:55:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:55:01,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-23 04:55:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:01,861 INFO L225 Difference]: With dead ends: 2672 [2021-11-23 04:55:01,862 INFO L226 Difference]: Without dead ends: 1350 [2021-11-23 04:55:01,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:55:01,864 INFO L933 BasicCegarLoop]: 1084 mSDtfsCounter, 3216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3216 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:01,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3216 Valid, 1084 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2021-11-23 04:55:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2021-11-23 04:55:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1319 states have (on average 1.152388172858226) internal successors, (1520), 1349 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1520 transitions. [2021-11-23 04:55:01,987 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1520 transitions. Word has length 65 [2021-11-23 04:55:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:01,988 INFO L470 AbstractCegarLoop]: Abstraction has 1350 states and 1520 transitions. [2021-11-23 04:55:01,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1520 transitions. [2021-11-23 04:55:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 04:55:01,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:01,989 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-23 04:55:01,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 04:55:01,990 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2085717108, now seen corresponding path program 1 times [2021-11-23 04:55:01,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:01,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104681943] [2021-11-23 04:55:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:01,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:02,085 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-23 04:55:02,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:02,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104681943] [2021-11-23 04:55:02,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104681943] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:02,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:02,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:02,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588907373] [2021-11-23 04:55:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:02,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:02,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:02,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:02,088 INFO L87 Difference]: Start difference. First operand 1350 states and 1520 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-23 04:55:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:02,193 INFO L93 Difference]: Finished difference Result 1350 states and 1520 transitions. [2021-11-23 04:55:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-23 04:55:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:02,197 INFO L225 Difference]: With dead ends: 1350 [2021-11-23 04:55:02,198 INFO L226 Difference]: Without dead ends: 1346 [2021-11-23 04:55:02,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:02,199 INFO L933 BasicCegarLoop]: 1078 mSDtfsCounter, 1089 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:02,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1089 Valid, 2088 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2021-11-23 04:55:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2021-11-23 04:55:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1317 states have (on average 1.1511009870918756) internal successors, (1516), 1345 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1516 transitions. [2021-11-23 04:55:02,300 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1516 transitions. Word has length 66 [2021-11-23 04:55:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:02,300 INFO L470 AbstractCegarLoop]: Abstraction has 1346 states and 1516 transitions. [2021-11-23 04:55:02,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1516 transitions. [2021-11-23 04:55:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 04:55:02,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:02,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:02,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 04:55:02,302 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash 312897280, now seen corresponding path program 1 times [2021-11-23 04:55:02,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:02,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083838498] [2021-11-23 04:55:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:02,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:02,404 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-23 04:55:02,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:02,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083838498] [2021-11-23 04:55:02,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083838498] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:02,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:02,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:02,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204448964] [2021-11-23 04:55:02,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:02,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:02,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:02,406 INFO L87 Difference]: Start difference. First operand 1346 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:02,579 INFO L93 Difference]: Finished difference Result 1346 states and 1516 transitions. [2021-11-23 04:55:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:02,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-11-23 04:55:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:02,594 INFO L225 Difference]: With dead ends: 1346 [2021-11-23 04:55:02,599 INFO L226 Difference]: Without dead ends: 1342 [2021-11-23 04:55:02,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:02,600 INFO L933 BasicCegarLoop]: 1074 mSDtfsCounter, 1072 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:02,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1072 Valid, 2090 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-11-23 04:55:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2021-11-23 04:55:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1315 states have (on average 1.1498098859315589) internal successors, (1512), 1341 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1512 transitions. [2021-11-23 04:55:02,732 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1512 transitions. Word has length 69 [2021-11-23 04:55:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:02,732 INFO L470 AbstractCegarLoop]: Abstraction has 1342 states and 1512 transitions. [2021-11-23 04:55:02,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1512 transitions. [2021-11-23 04:55:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-23 04:55:02,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:02,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:02,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 04:55:02,734 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:02,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1450252160, now seen corresponding path program 1 times [2021-11-23 04:55:02,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:02,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712733495] [2021-11-23 04:55:02,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:02,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:02,824 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-23 04:55:02,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:02,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712733495] [2021-11-23 04:55:02,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712733495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:02,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:02,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:02,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554163792] [2021-11-23 04:55:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:02,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:02,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:02,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:02,828 INFO L87 Difference]: Start difference. First operand 1342 states and 1512 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:02,945 INFO L93 Difference]: Finished difference Result 1342 states and 1512 transitions. [2021-11-23 04:55:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:02,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-11-23 04:55:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:02,949 INFO L225 Difference]: With dead ends: 1342 [2021-11-23 04:55:02,949 INFO L226 Difference]: Without dead ends: 1338 [2021-11-23 04:55:02,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:02,950 INFO L933 BasicCegarLoop]: 1070 mSDtfsCounter, 1055 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:02,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 2092 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2021-11-23 04:55:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2021-11-23 04:55:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1313 states have (on average 1.1485148514851484) internal successors, (1508), 1337 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1508 transitions. [2021-11-23 04:55:03,088 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1508 transitions. Word has length 72 [2021-11-23 04:55:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:03,089 INFO L470 AbstractCegarLoop]: Abstraction has 1338 states and 1508 transitions. [2021-11-23 04:55:03,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1508 transitions. [2021-11-23 04:55:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-23 04:55:03,090 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:03,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:03,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 04:55:03,090 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1392496012, now seen corresponding path program 1 times [2021-11-23 04:55:03,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:03,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853462824] [2021-11-23 04:55:03,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:03,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:03,186 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-23 04:55:03,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:03,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853462824] [2021-11-23 04:55:03,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853462824] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:03,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:03,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:03,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251244510] [2021-11-23 04:55:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:03,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:03,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:03,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:03,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:03,189 INFO L87 Difference]: Start difference. First operand 1338 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:03,307 INFO L93 Difference]: Finished difference Result 1338 states and 1508 transitions. [2021-11-23 04:55:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-23 04:55:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:03,310 INFO L225 Difference]: With dead ends: 1338 [2021-11-23 04:55:03,310 INFO L226 Difference]: Without dead ends: 1334 [2021-11-23 04:55:03,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:03,312 INFO L933 BasicCegarLoop]: 1066 mSDtfsCounter, 1038 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:03,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 2094 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2021-11-23 04:55:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2021-11-23 04:55:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1311 states have (on average 1.147215865751335) internal successors, (1504), 1333 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1504 transitions. [2021-11-23 04:55:03,423 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1504 transitions. Word has length 75 [2021-11-23 04:55:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:03,424 INFO L470 AbstractCegarLoop]: Abstraction has 1334 states and 1504 transitions. [2021-11-23 04:55:03,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1504 transitions. [2021-11-23 04:55:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-23 04:55:03,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:03,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:03,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 04:55:03,429 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1233978740, now seen corresponding path program 1 times [2021-11-23 04:55:03,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:03,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819735071] [2021-11-23 04:55:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:03,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:03,518 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-23 04:55:03,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:03,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819735071] [2021-11-23 04:55:03,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819735071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:03,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:03,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:03,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051256905] [2021-11-23 04:55:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:03,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:03,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:03,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:03,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:03,521 INFO L87 Difference]: Start difference. First operand 1334 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:03,673 INFO L93 Difference]: Finished difference Result 1334 states and 1504 transitions. [2021-11-23 04:55:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-11-23 04:55:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:03,676 INFO L225 Difference]: With dead ends: 1334 [2021-11-23 04:55:03,677 INFO L226 Difference]: Without dead ends: 1330 [2021-11-23 04:55:03,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:03,677 INFO L933 BasicCegarLoop]: 1062 mSDtfsCounter, 1021 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:03,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1021 Valid, 2096 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2021-11-23 04:55:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2021-11-23 04:55:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1309 states have (on average 1.145912910618793) internal successors, (1500), 1329 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1500 transitions. [2021-11-23 04:55:03,793 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1500 transitions. Word has length 78 [2021-11-23 04:55:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:03,793 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1500 transitions. [2021-11-23 04:55:03,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1500 transitions. [2021-11-23 04:55:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-23 04:55:03,794 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:03,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:03,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 04:55:03,796 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash -829105128, now seen corresponding path program 1 times [2021-11-23 04:55:03,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:03,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559924489] [2021-11-23 04:55:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:03,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:03,895 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-23 04:55:03,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:03,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559924489] [2021-11-23 04:55:03,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559924489] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:03,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:03,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:03,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485341258] [2021-11-23 04:55:03,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:03,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:03,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:03,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:03,898 INFO L87 Difference]: Start difference. First operand 1330 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:04,023 INFO L93 Difference]: Finished difference Result 1330 states and 1500 transitions. [2021-11-23 04:55:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:04,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-23 04:55:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:04,027 INFO L225 Difference]: With dead ends: 1330 [2021-11-23 04:55:04,027 INFO L226 Difference]: Without dead ends: 1326 [2021-11-23 04:55:04,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:04,028 INFO L933 BasicCegarLoop]: 1058 mSDtfsCounter, 1004 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:04,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1004 Valid, 2098 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-11-23 04:55:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2021-11-23 04:55:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1307 states have (on average 1.1446059678653404) internal successors, (1496), 1325 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1496 transitions. [2021-11-23 04:55:04,169 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1496 transitions. Word has length 81 [2021-11-23 04:55:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:04,169 INFO L470 AbstractCegarLoop]: Abstraction has 1326 states and 1496 transitions. [2021-11-23 04:55:04,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1496 transitions. [2021-11-23 04:55:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 04:55:04,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:04,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:04,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 04:55:04,171 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:04,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash 492514712, now seen corresponding path program 1 times [2021-11-23 04:55:04,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:04,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124547210] [2021-11-23 04:55:04,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:04,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:04,262 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-23 04:55:04,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:04,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124547210] [2021-11-23 04:55:04,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124547210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:04,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:04,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:04,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902530472] [2021-11-23 04:55:04,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:04,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:04,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:04,264 INFO L87 Difference]: Start difference. First operand 1326 states and 1496 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:04,392 INFO L93 Difference]: Finished difference Result 1326 states and 1496 transitions. [2021-11-23 04:55:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-23 04:55:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:04,395 INFO L225 Difference]: With dead ends: 1326 [2021-11-23 04:55:04,395 INFO L226 Difference]: Without dead ends: 1322 [2021-11-23 04:55:04,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:04,396 INFO L933 BasicCegarLoop]: 1054 mSDtfsCounter, 987 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:04,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [987 Valid, 2100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2021-11-23 04:55:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2021-11-23 04:55:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1305 states have (on average 1.143295019157088) internal successors, (1492), 1321 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1492 transitions. [2021-11-23 04:55:04,504 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1492 transitions. Word has length 84 [2021-11-23 04:55:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:04,505 INFO L470 AbstractCegarLoop]: Abstraction has 1322 states and 1492 transitions. [2021-11-23 04:55:04,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1492 transitions. [2021-11-23 04:55:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 04:55:04,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:04,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:04,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 04:55:04,507 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash 903977636, now seen corresponding path program 1 times [2021-11-23 04:55:04,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:04,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289905789] [2021-11-23 04:55:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:04,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:04,599 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-23 04:55:04,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:04,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289905789] [2021-11-23 04:55:04,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289905789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:04,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:04,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:04,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994897285] [2021-11-23 04:55:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:04,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:04,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:04,602 INFO L87 Difference]: Start difference. First operand 1322 states and 1492 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:04,772 INFO L93 Difference]: Finished difference Result 1322 states and 1492 transitions. [2021-11-23 04:55:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:55:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-11-23 04:55:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:04,775 INFO L225 Difference]: With dead ends: 1322 [2021-11-23 04:55:04,775 INFO L226 Difference]: Without dead ends: 1169 [2021-11-23 04:55:04,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:04,777 INFO L933 BasicCegarLoop]: 1052 mSDtfsCounter, 970 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:04,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [970 Valid, 2104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-11-23 04:55:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2021-11-23 04:55:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1154 states have (on average 1.1577123050259965) internal successors, (1336), 1168 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1336 transitions. [2021-11-23 04:55:04,909 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1336 transitions. Word has length 87 [2021-11-23 04:55:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:04,910 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 1336 transitions. [2021-11-23 04:55:04,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1336 transitions. [2021-11-23 04:55:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 04:55:04,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:04,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:04,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 04:55:04,911 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash 584492010, now seen corresponding path program 1 times [2021-11-23 04:55:04,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:04,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766869314] [2021-11-23 04:55:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:04,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:05,050 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-23 04:55:05,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:05,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766869314] [2021-11-23 04:55:05,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766869314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:05,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:05,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:55:05,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120627633] [2021-11-23 04:55:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:05,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 04:55:05,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 04:55:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:05,053 INFO L87 Difference]: Start difference. First operand 1169 states and 1336 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:05,461 INFO L93 Difference]: Finished difference Result 2332 states and 2666 transitions. [2021-11-23 04:55:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 04:55:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-11-23 04:55:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:05,466 INFO L225 Difference]: With dead ends: 2332 [2021-11-23 04:55:05,466 INFO L226 Difference]: Without dead ends: 2326 [2021-11-23 04:55:05,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 04:55:05,468 INFO L933 BasicCegarLoop]: 2629 mSDtfsCounter, 2559 mSDsluCounter, 5245 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 7874 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:05,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2559 Valid, 7874 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2021-11-23 04:55:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 1879. [2021-11-23 04:55:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1864 states have (on average 1.1630901287553648) internal successors, (2168), 1878 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2168 transitions. [2021-11-23 04:55:05,669 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2168 transitions. Word has length 88 [2021-11-23 04:55:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:05,669 INFO L470 AbstractCegarLoop]: Abstraction has 1879 states and 2168 transitions. [2021-11-23 04:55:05,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2168 transitions. [2021-11-23 04:55:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 04:55:05,671 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:05,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:05,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-23 04:55:05,671 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:05,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1264550380, now seen corresponding path program 1 times [2021-11-23 04:55:05,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:05,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422699500] [2021-11-23 04:55:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:05,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:05,901 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-23 04:55:05,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:05,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422699500] [2021-11-23 04:55:05,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422699500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:05,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:05,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 04:55:05,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319815600] [2021-11-23 04:55:05,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:05,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 04:55:05,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:05,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 04:55:05,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 04:55:05,904 INFO L87 Difference]: Start difference. First operand 1879 states and 2168 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:07,603 INFO L93 Difference]: Finished difference Result 8135 states and 9372 transitions. [2021-11-23 04:55:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 04:55:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-11-23 04:55:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:07,615 INFO L225 Difference]: With dead ends: 8135 [2021-11-23 04:55:07,615 INFO L226 Difference]: Without dead ends: 6288 [2021-11-23 04:55:07,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-11-23 04:55:07,618 INFO L933 BasicCegarLoop]: 969 mSDtfsCounter, 9600 mSDsluCounter, 8656 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9600 SdHoareTripleChecker+Valid, 9625 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:07,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9600 Valid, 9625 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 04:55:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6288 states. [2021-11-23 04:55:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6288 to 1897. [2021-11-23 04:55:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1882 states have (on average 1.1615302869287991) internal successors, (2186), 1896 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2186 transitions. [2021-11-23 04:55:07,950 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2186 transitions. Word has length 88 [2021-11-23 04:55:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:07,951 INFO L470 AbstractCegarLoop]: Abstraction has 1897 states and 2186 transitions. [2021-11-23 04:55:07,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2186 transitions. [2021-11-23 04:55:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-23 04:55:07,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:07,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:07,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-23 04:55:07,952 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -120662312, now seen corresponding path program 1 times [2021-11-23 04:55:07,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:07,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704076781] [2021-11-23 04:55:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:07,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:07,999 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:07,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931187138] [2021-11-23 04:55:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:08,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:08,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:08,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 04:55:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:08,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-23 04:55:08,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:09,022 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-23 04:55:09,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:09,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704076781] [2021-11-23 04:55:09,023 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931187138] [2021-11-23 04:55:09,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931187138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:09,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:09,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 04:55:09,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603471703] [2021-11-23 04:55:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:09,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 04:55:09,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:09,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 04:55:09,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 04:55:09,025 INFO L87 Difference]: Start difference. First operand 1897 states and 2186 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:10,570 INFO L93 Difference]: Finished difference Result 6282 states and 7213 transitions. [2021-11-23 04:55:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 04:55:10,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-11-23 04:55:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:10,578 INFO L225 Difference]: With dead ends: 6282 [2021-11-23 04:55:10,578 INFO L226 Difference]: Without dead ends: 4417 [2021-11-23 04:55:10,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-23 04:55:10,583 INFO L933 BasicCegarLoop]: 1509 mSDtfsCounter, 3896 mSDsluCounter, 7298 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3896 SdHoareTripleChecker+Valid, 8807 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:10,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3896 Valid, 8807 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 04:55:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2021-11-23 04:55:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 1915. [2021-11-23 04:55:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1900 states have (on average 1.16) internal successors, (2204), 1914 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2204 transitions. [2021-11-23 04:55:10,992 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2204 transitions. Word has length 94 [2021-11-23 04:55:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:10,993 INFO L470 AbstractCegarLoop]: Abstraction has 1915 states and 2204 transitions. [2021-11-23 04:55:10,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2204 transitions. [2021-11-23 04:55:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-23 04:55:10,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:10,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:11,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:11,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-23 04:55:11,220 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:11,220 INFO L85 PathProgramCache]: Analyzing trace with hash 500266205, now seen corresponding path program 1 times [2021-11-23 04:55:11,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:11,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171699305] [2021-11-23 04:55:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:11,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:11,417 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-23 04:55:11,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:11,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171699305] [2021-11-23 04:55:11,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171699305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:11,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:11,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:11,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103400791] [2021-11-23 04:55:11,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:11,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:11,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:11,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:11,420 INFO L87 Difference]: Start difference. First operand 1915 states and 2204 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:11,912 INFO L93 Difference]: Finished difference Result 2784 states and 3203 transitions. [2021-11-23 04:55:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 04:55:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-11-23 04:55:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:11,918 INFO L225 Difference]: With dead ends: 2784 [2021-11-23 04:55:11,918 INFO L226 Difference]: Without dead ends: 2776 [2021-11-23 04:55:11,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:11,919 INFO L933 BasicCegarLoop]: 1673 mSDtfsCounter, 1665 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:11,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1665 Valid, 2498 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2021-11-23 04:55:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1907. [2021-11-23 04:55:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1896 states have (on average 1.1561181434599157) internal successors, (2192), 1906 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2192 transitions. [2021-11-23 04:55:12,221 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2192 transitions. Word has length 97 [2021-11-23 04:55:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:12,221 INFO L470 AbstractCegarLoop]: Abstraction has 1907 states and 2192 transitions. [2021-11-23 04:55:12,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2192 transitions. [2021-11-23 04:55:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 04:55:12,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:12,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:12,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-23 04:55:12,223 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1084997900, now seen corresponding path program 1 times [2021-11-23 04:55:12,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:12,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434930751] [2021-11-23 04:55:12,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:12,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:12,267 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:12,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553058479] [2021-11-23 04:55:12,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:12,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:12,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:12,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:12,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 04:55:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:13,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 1970 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-23 04:55:13,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:13,369 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-23 04:55:13,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:13,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:13,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434930751] [2021-11-23 04:55:13,369 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:13,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553058479] [2021-11-23 04:55:13,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553058479] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:13,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:13,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 04:55:13,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632709954] [2021-11-23 04:55:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:13,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 04:55:13,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 04:55:13,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-23 04:55:13,371 INFO L87 Difference]: Start difference. First operand 1907 states and 2192 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:14,066 INFO L93 Difference]: Finished difference Result 6232 states and 7126 transitions. [2021-11-23 04:55:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 04:55:14,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-11-23 04:55:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:14,074 INFO L225 Difference]: With dead ends: 6232 [2021-11-23 04:55:14,074 INFO L226 Difference]: Without dead ends: 4357 [2021-11-23 04:55:14,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-23 04:55:14,078 INFO L933 BasicCegarLoop]: 1513 mSDtfsCounter, 2740 mSDsluCounter, 6859 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2740 SdHoareTripleChecker+Valid, 8372 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:14,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2740 Valid, 8372 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2021-11-23 04:55:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 1922. [2021-11-23 04:55:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1911 states have (on average 1.1548927263212978) internal successors, (2207), 1921 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2207 transitions. [2021-11-23 04:55:14,343 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2207 transitions. Word has length 100 [2021-11-23 04:55:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:14,343 INFO L470 AbstractCegarLoop]: Abstraction has 1922 states and 2207 transitions. [2021-11-23 04:55:14,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2207 transitions. [2021-11-23 04:55:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 04:55:14,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:14,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:14,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:14,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-23 04:55:14,547 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1302777157, now seen corresponding path program 1 times [2021-11-23 04:55:14,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:14,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033401703] [2021-11-23 04:55:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:14,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:14,713 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-23 04:55:14,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:14,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033401703] [2021-11-23 04:55:14,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033401703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:14,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:14,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:55:14,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497529901] [2021-11-23 04:55:14,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:14,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:14,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:14,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:14,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:14,716 INFO L87 Difference]: Start difference. First operand 1922 states and 2207 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:15,271 INFO L93 Difference]: Finished difference Result 2836 states and 3255 transitions. [2021-11-23 04:55:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 04:55:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2021-11-23 04:55:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:15,278 INFO L225 Difference]: With dead ends: 2836 [2021-11-23 04:55:15,278 INFO L226 Difference]: Without dead ends: 2824 [2021-11-23 04:55:15,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:15,279 INFO L933 BasicCegarLoop]: 1677 mSDtfsCounter, 899 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:15,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [899 Valid, 4112 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2021-11-23 04:55:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1910. [2021-11-23 04:55:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1905 states have (on average 1.1490813648293963) internal successors, (2189), 1909 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2189 transitions. [2021-11-23 04:55:15,617 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2189 transitions. Word has length 103 [2021-11-23 04:55:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:15,617 INFO L470 AbstractCegarLoop]: Abstraction has 1910 states and 2189 transitions. [2021-11-23 04:55:15,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2189 transitions. [2021-11-23 04:55:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-23 04:55:15,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:15,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:15,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-23 04:55:15,619 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2067809618, now seen corresponding path program 1 times [2021-11-23 04:55:15,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:15,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771030036] [2021-11-23 04:55:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:15,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:15,667 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:15,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494013403] [2021-11-23 04:55:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:15,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:15,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:15,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:15,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 04:55:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:16,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 04:55:16,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 04:55:16,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:16,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:16,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771030036] [2021-11-23 04:55:16,598 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:16,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494013403] [2021-11-23 04:55:16,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494013403] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:16,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:16,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 04:55:16,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669086888] [2021-11-23 04:55:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:16,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 04:55:16,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 04:55:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:55:16,600 INFO L87 Difference]: Start difference. First operand 1910 states and 2189 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:17,729 INFO L93 Difference]: Finished difference Result 5625 states and 6410 transitions. [2021-11-23 04:55:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 04:55:17,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2021-11-23 04:55:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:17,736 INFO L225 Difference]: With dead ends: 5625 [2021-11-23 04:55:17,736 INFO L226 Difference]: Without dead ends: 3747 [2021-11-23 04:55:17,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-23 04:55:17,740 INFO L933 BasicCegarLoop]: 1524 mSDtfsCounter, 3117 mSDsluCounter, 4483 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3117 SdHoareTripleChecker+Valid, 6007 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:17,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3117 Valid, 6007 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 04:55:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2021-11-23 04:55:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 1649. [2021-11-23 04:55:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1644 states have (on average 1.1429440389294403) internal successors, (1879), 1648 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 1879 transitions. [2021-11-23 04:55:18,037 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 1879 transitions. Word has length 105 [2021-11-23 04:55:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:18,037 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 1879 transitions. [2021-11-23 04:55:18,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1879 transitions. [2021-11-23 04:55:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 04:55:18,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:18,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:18,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:18,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:18,268 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1000312658, now seen corresponding path program 1 times [2021-11-23 04:55:18,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:18,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117315502] [2021-11-23 04:55:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:18,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:18,669 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-23 04:55:18,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117315502] [2021-11-23 04:55:18,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117315502] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:18,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:18,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 04:55:18,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833374666] [2021-11-23 04:55:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:18,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 04:55:18,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 04:55:18,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:55:18,672 INFO L87 Difference]: Start difference. First operand 1649 states and 1879 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:19,207 INFO L93 Difference]: Finished difference Result 3279 states and 3738 transitions. [2021-11-23 04:55:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 04:55:19,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2021-11-23 04:55:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:19,213 INFO L225 Difference]: With dead ends: 3279 [2021-11-23 04:55:19,213 INFO L226 Difference]: Without dead ends: 1649 [2021-11-23 04:55:19,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-23 04:55:19,216 INFO L933 BasicCegarLoop]: 895 mSDtfsCounter, 3561 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3561 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:19,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3561 Valid, 932 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2021-11-23 04:55:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2021-11-23 04:55:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1644 states have (on average 1.1423357664233578) internal successors, (1878), 1648 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 1878 transitions. [2021-11-23 04:55:19,695 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 1878 transitions. Word has length 139 [2021-11-23 04:55:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:19,695 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 1878 transitions. [2021-11-23 04:55:19,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1878 transitions. [2021-11-23 04:55:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-23 04:55:19,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:19,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:19,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-23 04:55:19,698 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash -204229068, now seen corresponding path program 1 times [2021-11-23 04:55:19,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:19,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557439611] [2021-11-23 04:55:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:19,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:20,033 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-23 04:55:20,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:20,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557439611] [2021-11-23 04:55:20,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557439611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:20,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:20,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-23 04:55:20,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604179863] [2021-11-23 04:55:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:20,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-23 04:55:20,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:20,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-23 04:55:20,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-23 04:55:20,035 INFO L87 Difference]: Start difference. First operand 1649 states and 1878 transitions. Second operand has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:21,365 INFO L93 Difference]: Finished difference Result 4424 states and 5027 transitions. [2021-11-23 04:55:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 04:55:21,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2021-11-23 04:55:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:21,370 INFO L225 Difference]: With dead ends: 4424 [2021-11-23 04:55:21,371 INFO L226 Difference]: Without dead ends: 3331 [2021-11-23 04:55:21,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2021-11-23 04:55:21,373 INFO L933 BasicCegarLoop]: 1418 mSDtfsCounter, 3473 mSDsluCounter, 10927 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3473 SdHoareTripleChecker+Valid, 12345 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:21,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3473 Valid, 12345 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 04:55:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2021-11-23 04:55:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 1778. [2021-11-23 04:55:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1773 states have (on average 1.1370558375634519) internal successors, (2016), 1777 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2016 transitions. [2021-11-23 04:55:21,776 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2016 transitions. Word has length 140 [2021-11-23 04:55:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:21,776 INFO L470 AbstractCegarLoop]: Abstraction has 1778 states and 2016 transitions. [2021-11-23 04:55:21,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2016 transitions. [2021-11-23 04:55:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-23 04:55:21,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:21,779 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:21,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-23 04:55:21,779 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash -28582990, now seen corresponding path program 1 times [2021-11-23 04:55:21,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:21,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415643907] [2021-11-23 04:55:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:21,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:21,826 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:21,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170499069] [2021-11-23 04:55:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:21,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:21,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:21,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:21,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 04:55:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:22,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 2250 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-23 04:55:22,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 04:55:22,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:22,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:22,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415643907] [2021-11-23 04:55:22,893 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:22,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170499069] [2021-11-23 04:55:22,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170499069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:22,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:22,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-23 04:55:22,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277003643] [2021-11-23 04:55:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:22,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 04:55:22,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 04:55:22,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-11-23 04:55:22,895 INFO L87 Difference]: Start difference. First operand 1778 states and 2016 transitions. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:23,609 INFO L93 Difference]: Finished difference Result 1778 states and 2016 transitions. [2021-11-23 04:55:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 04:55:23,609 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 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 153 [2021-11-23 04:55:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:23,612 INFO L225 Difference]: With dead ends: 1778 [2021-11-23 04:55:23,612 INFO L226 Difference]: Without dead ends: 1773 [2021-11-23 04:55:23,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2021-11-23 04:55:23,613 INFO L933 BasicCegarLoop]: 893 mSDtfsCounter, 948 mSDsluCounter, 10448 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 11341 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:23,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [948 Valid, 11341 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2021-11-23 04:55:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2021-11-23 04:55:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1769 states have (on average 1.1368004522329) internal successors, (2011), 1772 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2011 transitions. [2021-11-23 04:55:23,973 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2011 transitions. Word has length 153 [2021-11-23 04:55:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:23,974 INFO L470 AbstractCegarLoop]: Abstraction has 1773 states and 2011 transitions. [2021-11-23 04:55:23,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2011 transitions. [2021-11-23 04:55:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 04:55:23,976 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:23,977 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:24,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-23 04:55:24,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:24,187 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash -991176193, now seen corresponding path program 1 times [2021-11-23 04:55:24,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:24,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356833923] [2021-11-23 04:55:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:24,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:24,233 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:24,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477957396] [2021-11-23 04:55:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:24,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:24,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:24,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:24,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 04:55:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 2307 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-23 04:55:25,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 04:55:25,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:25,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:25,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356833923] [2021-11-23 04:55:25,353 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:25,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477957396] [2021-11-23 04:55:25,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477957396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:25,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:25,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 04:55:25,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8284219] [2021-11-23 04:55:25,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:25,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 04:55:25,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:25,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 04:55:25,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 04:55:25,357 INFO L87 Difference]: Start difference. First operand 1773 states and 2011 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:26,541 INFO L93 Difference]: Finished difference Result 6203 states and 7015 transitions. [2021-11-23 04:55:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 04:55:26,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2021-11-23 04:55:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:26,545 INFO L225 Difference]: With dead ends: 6203 [2021-11-23 04:55:26,545 INFO L226 Difference]: Without dead ends: 4586 [2021-11-23 04:55:26,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-23 04:55:26,549 INFO L933 BasicCegarLoop]: 1977 mSDtfsCounter, 5576 mSDsluCounter, 6799 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5576 SdHoareTripleChecker+Valid, 8776 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:26,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5576 Valid, 8776 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2021-11-23 04:55:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 1773. [2021-11-23 04:55:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1769 states have (on average 1.1356698699830412) internal successors, (2009), 1772 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2009 transitions. [2021-11-23 04:55:27,098 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2009 transitions. Word has length 159 [2021-11-23 04:55:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:27,099 INFO L470 AbstractCegarLoop]: Abstraction has 1773 states and 2009 transitions. [2021-11-23 04:55:27,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2009 transitions. [2021-11-23 04:55:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-11-23 04:55:27,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:27,101 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:27,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:27,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-23 04:55:27,301 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1339662223, now seen corresponding path program 1 times [2021-11-23 04:55:27,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:27,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007547726] [2021-11-23 04:55:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:27,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:27,348 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:27,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997915716] [2021-11-23 04:55:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:27,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:27,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:27,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:27,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 04:55:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:27,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 2342 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 04:55:27,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 04:55:28,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:28,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:28,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007547726] [2021-11-23 04:55:28,274 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:28,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997915716] [2021-11-23 04:55:28,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997915716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:28,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:28,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:55:28,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65253050] [2021-11-23 04:55:28,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:28,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 04:55:28,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 04:55:28,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:28,275 INFO L87 Difference]: Start difference. First operand 1773 states and 2009 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:29,235 INFO L93 Difference]: Finished difference Result 3868 states and 4387 transitions. [2021-11-23 04:55:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 04:55:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 166 [2021-11-23 04:55:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:29,240 INFO L225 Difference]: With dead ends: 3868 [2021-11-23 04:55:29,240 INFO L226 Difference]: Without dead ends: 3840 [2021-11-23 04:55:29,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:55:29,242 INFO L933 BasicCegarLoop]: 1401 mSDtfsCounter, 1232 mSDsluCounter, 3372 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 4773 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:29,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1232 Valid, 4773 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2021-11-23 04:55:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3331. [2021-11-23 04:55:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 3327 states have (on average 1.1385632702134054) internal successors, (3788), 3330 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 3788 transitions. [2021-11-23 04:55:30,006 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 3788 transitions. Word has length 166 [2021-11-23 04:55:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:30,006 INFO L470 AbstractCegarLoop]: Abstraction has 3331 states and 3788 transitions. [2021-11-23 04:55:30,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 3788 transitions. [2021-11-23 04:55:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-23 04:55:30,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:30,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:30,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:30,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-11-23 04:55:30,209 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash -201534957, now seen corresponding path program 1 times [2021-11-23 04:55:30,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:30,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051840258] [2021-11-23 04:55:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:30,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:30,258 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:30,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882263258] [2021-11-23 04:55:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:30,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:30,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:30,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:30,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 04:55:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:30,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-23 04:55:30,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:31,252 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-23 04:55:31,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:31,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:31,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051840258] [2021-11-23 04:55:31,252 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:31,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882263258] [2021-11-23 04:55:31,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882263258] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:31,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:31,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-23 04:55:31,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618951721] [2021-11-23 04:55:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:31,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-23 04:55:31,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-23 04:55:31,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-23 04:55:31,254 INFO L87 Difference]: Start difference. First operand 3331 states and 3788 transitions. Second operand has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:32,784 INFO L93 Difference]: Finished difference Result 7800 states and 8856 transitions. [2021-11-23 04:55:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 04:55:32,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2021-11-23 04:55:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:32,789 INFO L225 Difference]: With dead ends: 7800 [2021-11-23 04:55:32,789 INFO L226 Difference]: Without dead ends: 5565 [2021-11-23 04:55:32,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2021-11-23 04:55:32,793 INFO L933 BasicCegarLoop]: 1380 mSDtfsCounter, 3284 mSDsluCounter, 10548 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3284 SdHoareTripleChecker+Valid, 11928 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:32,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3284 Valid, 11928 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 04:55:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2021-11-23 04:55:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 2933. [2021-11-23 04:55:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2929 states have (on average 1.1451007169682486) internal successors, (3354), 2932 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 3354 transitions. [2021-11-23 04:55:33,496 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 3354 transitions. Word has length 175 [2021-11-23 04:55:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:33,496 INFO L470 AbstractCegarLoop]: Abstraction has 2933 states and 3354 transitions. [2021-11-23 04:55:33,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 3354 transitions. [2021-11-23 04:55:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-23 04:55:33,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:33,498 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 04:55:33,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:33,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:33,699 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash 405599041, now seen corresponding path program 1 times [2021-11-23 04:55:33,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:33,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759477240] [2021-11-23 04:55:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:33,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:33,755 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:33,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133934103] [2021-11-23 04:55:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:33,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:33,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:33,757 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:33,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 04:55:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:34,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 2897 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-23 04:55:34,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-23 04:55:34,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 04:55:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-23 04:55:35,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:35,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759477240] [2021-11-23 04:55:35,210 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:35,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133934103] [2021-11-23 04:55:35,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133934103] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 04:55:35,211 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 04:55:35,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-11-23 04:55:35,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928761907] [2021-11-23 04:55:35,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 04:55:35,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 04:55:35,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:35,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 04:55:35,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:35,213 INFO L87 Difference]: Start difference. First operand 2933 states and 3354 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:36,157 INFO L93 Difference]: Finished difference Result 3972 states and 4517 transitions. [2021-11-23 04:55:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 04:55:36,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2021-11-23 04:55:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:36,162 INFO L225 Difference]: With dead ends: 3972 [2021-11-23 04:55:36,162 INFO L226 Difference]: Without dead ends: 3966 [2021-11-23 04:55:36,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 413 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-23 04:55:36,164 INFO L933 BasicCegarLoop]: 2023 mSDtfsCounter, 2610 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:36,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2610 Valid, 4253 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2021-11-23 04:55:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 2270. [2021-11-23 04:55:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2266 states have (on average 1.142541924095322) internal successors, (2589), 2269 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 2589 transitions. [2021-11-23 04:55:36,791 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 2589 transitions. Word has length 210 [2021-11-23 04:55:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:36,791 INFO L470 AbstractCegarLoop]: Abstraction has 2270 states and 2589 transitions. [2021-11-23 04:55:36,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2589 transitions. [2021-11-23 04:55:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-23 04:55:36,793 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:36,793 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:36,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:37,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-23 04:55:37,012 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1196245437, now seen corresponding path program 1 times [2021-11-23 04:55:37,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:37,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868782358] [2021-11-23 04:55:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:37,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:37,070 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:37,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75761461] [2021-11-23 04:55:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:37,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:37,072 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:37,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 04:55:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:37,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 3369 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 04:55:37,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 04:55:38,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:38,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:38,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868782358] [2021-11-23 04:55:38,118 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:38,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75761461] [2021-11-23 04:55:38,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75761461] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:38,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:38,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:55:38,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653311176] [2021-11-23 04:55:38,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:38,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:55:38,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:38,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:55:38,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:55:38,120 INFO L87 Difference]: Start difference. First operand 2270 states and 2589 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:38,926 INFO L93 Difference]: Finished difference Result 4895 states and 5570 transitions. [2021-11-23 04:55:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:55:38,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2021-11-23 04:55:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:38,929 INFO L225 Difference]: With dead ends: 4895 [2021-11-23 04:55:38,929 INFO L226 Difference]: Without dead ends: 2657 [2021-11-23 04:55:38,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:55:38,932 INFO L933 BasicCegarLoop]: 966 mSDtfsCounter, 182 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:38,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 1829 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2021-11-23 04:55:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2279. [2021-11-23 04:55:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2275 states have (on average 1.141978021978022) internal successors, (2598), 2278 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2598 transitions. [2021-11-23 04:55:39,550 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2598 transitions. Word has length 218 [2021-11-23 04:55:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:39,550 INFO L470 AbstractCegarLoop]: Abstraction has 2279 states and 2598 transitions. [2021-11-23 04:55:39,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2598 transitions. [2021-11-23 04:55:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2021-11-23 04:55:39,552 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:39,553 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:39,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:39,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:39,767 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:39,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash -376439774, now seen corresponding path program 1 times [2021-11-23 04:55:39,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:39,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243454398] [2021-11-23 04:55:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:39,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:39,845 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:39,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993834563] [2021-11-23 04:55:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:39,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:39,847 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:39,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 04:55:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:40,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 4100 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 04:55:40,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 04:55:41,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:41,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:41,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243454398] [2021-11-23 04:55:41,312 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:41,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993834563] [2021-11-23 04:55:41,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993834563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:41,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:41,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 04:55:41,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338523141] [2021-11-23 04:55:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:41,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:55:41,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:55:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:55:41,314 INFO L87 Difference]: Start difference. First operand 2279 states and 2598 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:41,943 INFO L93 Difference]: Finished difference Result 4523 states and 5161 transitions. [2021-11-23 04:55:41,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:55:41,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2021-11-23 04:55:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:41,946 INFO L225 Difference]: With dead ends: 4523 [2021-11-23 04:55:41,946 INFO L226 Difference]: Without dead ends: 2276 [2021-11-23 04:55:41,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:55:41,949 INFO L933 BasicCegarLoop]: 896 mSDtfsCounter, 680 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:41,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 896 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2021-11-23 04:55:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 2276. [2021-11-23 04:55:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 2272 states have (on average 1.1355633802816902) internal successors, (2580), 2275 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 2580 transitions. [2021-11-23 04:55:42,533 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 2580 transitions. Word has length 285 [2021-11-23 04:55:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:42,534 INFO L470 AbstractCegarLoop]: Abstraction has 2276 states and 2580 transitions. [2021-11-23 04:55:42,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2580 transitions. [2021-11-23 04:55:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-11-23 04:55:42,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:42,536 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:42,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:42,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-11-23 04:55:42,736 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:42,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash -491293953, now seen corresponding path program 1 times [2021-11-23 04:55:42,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:42,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654328346] [2021-11-23 04:55:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:42,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:42,806 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:42,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122688665] [2021-11-23 04:55:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:42,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:42,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:42,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:42,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 04:55:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:43,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 4126 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 04:55:43,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 04:55:44,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 04:55:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 04:55:44,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:44,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654328346] [2021-11-23 04:55:44,520 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:44,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122688665] [2021-11-23 04:55:44,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122688665] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 04:55:44,521 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 04:55:44,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-23 04:55:44,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618174325] [2021-11-23 04:55:44,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 04:55:44,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 04:55:44,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 04:55:44,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:55:44,522 INFO L87 Difference]: Start difference. First operand 2276 states and 2580 transitions. Second operand has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:45,688 INFO L93 Difference]: Finished difference Result 5792 states and 6497 transitions. [2021-11-23 04:55:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 04:55:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 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 287 [2021-11-23 04:55:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:45,693 INFO L225 Difference]: With dead ends: 5792 [2021-11-23 04:55:45,693 INFO L226 Difference]: Without dead ends: 3548 [2021-11-23 04:55:45,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:55:45,696 INFO L933 BasicCegarLoop]: 959 mSDtfsCounter, 1248 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:45,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1248 Valid, 2717 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:55:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2021-11-23 04:55:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 2771. [2021-11-23 04:55:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2767 states have (on average 1.130827611131189) internal successors, (3129), 2770 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3129 transitions. [2021-11-23 04:55:46,401 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3129 transitions. Word has length 287 [2021-11-23 04:55:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:46,401 INFO L470 AbstractCegarLoop]: Abstraction has 2771 states and 3129 transitions. [2021-11-23 04:55:46,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3129 transitions. [2021-11-23 04:55:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2021-11-23 04:55:46,404 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:46,405 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:46,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-11-23 04:55:46,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-11-23 04:55:46,607 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:46,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1789462914, now seen corresponding path program 1 times [2021-11-23 04:55:46,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:46,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199162746] [2021-11-23 04:55:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:46,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:46,708 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:46,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733929954] [2021-11-23 04:55:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:46,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:46,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:46,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:46,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 04:55:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:48,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 5526 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 04:55:48,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-11-23 04:55:48,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 04:55:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-11-23 04:55:49,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:49,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199162746] [2021-11-23 04:55:49,150 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:49,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733929954] [2021-11-23 04:55:49,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733929954] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 04:55:49,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 04:55:49,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-11-23 04:55:49,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562755243] [2021-11-23 04:55:49,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 04:55:49,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 04:55:49,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 04:55:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-11-23 04:55:49,152 INFO L87 Difference]: Start difference. First operand 2771 states and 3129 transitions. Second operand has 10 states, 10 states have (on average 42.8) internal successors, (428), 10 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:50,917 INFO L93 Difference]: Finished difference Result 7937 states and 8823 transitions. [2021-11-23 04:55:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 04:55:50,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 42.8) internal successors, (428), 10 states have internal predecessors, (428), 0 states have call successors, (0), 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 422 [2021-11-23 04:55:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:50,924 INFO L225 Difference]: With dead ends: 7937 [2021-11-23 04:55:50,924 INFO L226 Difference]: Without dead ends: 5198 [2021-11-23 04:55:50,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-11-23 04:55:50,927 INFO L933 BasicCegarLoop]: 959 mSDtfsCounter, 3852 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3852 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:50,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3852 Valid, 3025 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 04:55:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5198 states. [2021-11-23 04:55:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 3431. [2021-11-23 04:55:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3431 states, 3427 states have (on average 1.1266413772979282) internal successors, (3861), 3430 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 3861 transitions. [2021-11-23 04:55:51,832 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 3861 transitions. Word has length 422 [2021-11-23 04:55:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:51,833 INFO L470 AbstractCegarLoop]: Abstraction has 3431 states and 3861 transitions. [2021-11-23 04:55:51,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 42.8) internal successors, (428), 10 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 3861 transitions. [2021-11-23 04:55:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2021-11-23 04:55:51,837 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:51,838 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:51,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 04:55:52,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-11-23 04:55:52,052 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1171782402, now seen corresponding path program 2 times [2021-11-23 04:55:52,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:52,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781075900] [2021-11-23 04:55:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:52,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:52,162 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:52,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219607554] [2021-11-23 04:55:52,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 04:55:52,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:52,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:52,164 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:52,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 04:55:53,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 04:55:53,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 04:55:53,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 7378 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-23 04:55:53,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2021-11-23 04:55:54,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:54,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:54,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781075900] [2021-11-23 04:55:54,525 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:54,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219607554] [2021-11-23 04:55:54,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219607554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:54,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:54,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:55:54,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517481305] [2021-11-23 04:55:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:54,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:55:54,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:54,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:55:54,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:55:54,527 INFO L87 Difference]: Start difference. First operand 3431 states and 3861 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:55:55,632 INFO L93 Difference]: Finished difference Result 7303 states and 8195 transitions. [2021-11-23 04:55:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 04:55:55,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 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 602 [2021-11-23 04:55:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:55:55,637 INFO L225 Difference]: With dead ends: 7303 [2021-11-23 04:55:55,637 INFO L226 Difference]: Without dead ends: 3904 [2021-11-23 04:55:55,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:55:55,640 INFO L933 BasicCegarLoop]: 1084 mSDtfsCounter, 286 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:55:55,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 2888 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:55:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2021-11-23 04:55:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3437. [2021-11-23 04:55:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 3433 states have (on average 1.1264200407806584) internal successors, (3867), 3436 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 3867 transitions. [2021-11-23 04:55:56,528 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 3867 transitions. Word has length 602 [2021-11-23 04:55:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:55:56,529 INFO L470 AbstractCegarLoop]: Abstraction has 3437 states and 3867 transitions. [2021-11-23 04:55:56,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:55:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 3867 transitions. [2021-11-23 04:55:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2021-11-23 04:55:56,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:55:56,533 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:55:56,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-23 04:55:56,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-11-23 04:55:56,747 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:55:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:55:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1360223608, now seen corresponding path program 1 times [2021-11-23 04:55:56,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:55:56,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504650464] [2021-11-23 04:55:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:56,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:55:56,855 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:55:56,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788379381] [2021-11-23 04:55:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:55:56,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:55:56,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:55:56,857 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:55:56,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 04:55:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:55:58,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 7445 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-23 04:55:58,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:55:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2021-11-23 04:55:59,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:55:59,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:55:59,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504650464] [2021-11-23 04:55:59,166 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:55:59,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788379381] [2021-11-23 04:55:59,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788379381] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:55:59,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:55:59,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 04:55:59,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558257680] [2021-11-23 04:55:59,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:55:59,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 04:55:59,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:55:59,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 04:55:59,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-23 04:55:59,168 INFO L87 Difference]: Start difference. First operand 3437 states and 3867 transitions. Second operand has 7 states, 7 states have (on average 41.714285714285715) internal successors, (292), 7 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:56:00,635 INFO L93 Difference]: Finished difference Result 7780 states and 8699 transitions. [2021-11-23 04:56:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 04:56:00,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 41.714285714285715) internal successors, (292), 7 states have internal predecessors, (292), 0 states have call successors, (0), 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 606 [2021-11-23 04:56:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:56:00,640 INFO L225 Difference]: With dead ends: 7780 [2021-11-23 04:56:00,640 INFO L226 Difference]: Without dead ends: 4375 [2021-11-23 04:56:00,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-23 04:56:00,644 INFO L933 BasicCegarLoop]: 1055 mSDtfsCounter, 904 mSDsluCounter, 5033 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 6088 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:56:00,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [904 Valid, 6088 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:56:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2021-11-23 04:56:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 3446. [2021-11-23 04:56:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 3442 states have (on average 1.126089482858803) internal successors, (3876), 3445 states have internal predecessors, (3876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 3876 transitions. [2021-11-23 04:56:01,549 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 3876 transitions. Word has length 606 [2021-11-23 04:56:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:56:01,550 INFO L470 AbstractCegarLoop]: Abstraction has 3446 states and 3876 transitions. [2021-11-23 04:56:01,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.714285714285715) internal successors, (292), 7 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 3876 transitions. [2021-11-23 04:56:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2021-11-23 04:56:01,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:56:01,555 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:56:01,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 04:56:01,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:56:01,784 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:56:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:56:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2142841801, now seen corresponding path program 1 times [2021-11-23 04:56:01,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:56:01,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912536172] [2021-11-23 04:56:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:56:01,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:56:01,918 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:56:01,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585617855] [2021-11-23 04:56:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:56:01,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:56:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:56:01,920 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:56:01,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 04:56:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:56:03,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 7710 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 04:56:03,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:56:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2021-11-23 04:56:04,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:56:04,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:56:04,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912536172] [2021-11-23 04:56:04,401 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:56:04,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585617855] [2021-11-23 04:56:04,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585617855] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:56:04,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:56:04,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-23 04:56:04,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233780408] [2021-11-23 04:56:04,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:56:04,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 04:56:04,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:56:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 04:56:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-11-23 04:56:04,403 INFO L87 Difference]: Start difference. First operand 3446 states and 3876 transitions. Second operand has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:56:06,258 INFO L93 Difference]: Finished difference Result 8389 states and 9420 transitions. [2021-11-23 04:56:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-23 04:56:06,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 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 628 [2021-11-23 04:56:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:56:06,264 INFO L225 Difference]: With dead ends: 8389 [2021-11-23 04:56:06,264 INFO L226 Difference]: Without dead ends: 6050 [2021-11-23 04:56:06,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2021-11-23 04:56:06,268 INFO L933 BasicCegarLoop]: 1368 mSDtfsCounter, 7999 mSDsluCounter, 8860 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7999 SdHoareTripleChecker+Valid, 10228 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 04:56:06,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7999 Valid, 10228 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 04:56:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2021-11-23 04:56:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 2369. [2021-11-23 04:56:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2365 states have (on average 1.1243128964059197) internal successors, (2659), 2368 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 2659 transitions. [2021-11-23 04:56:06,929 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 2659 transitions. Word has length 628 [2021-11-23 04:56:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:56:06,929 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 2659 transitions. [2021-11-23 04:56:06,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 2659 transitions. [2021-11-23 04:56:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2021-11-23 04:56:06,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:56:06,934 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:56:06,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-11-23 04:56:07,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:56:07,135 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:56:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:56:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash 523176906, now seen corresponding path program 1 times [2021-11-23 04:56:07,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:56:07,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207518287] [2021-11-23 04:56:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:56:07,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:56:07,253 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:56:07,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895033671] [2021-11-23 04:56:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:56:07,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:56:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:56:07,255 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:56:07,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 04:56:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:56:09,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 9201 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 04:56:09,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:56:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2021-11-23 04:56:10,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:56:10,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:56:10,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207518287] [2021-11-23 04:56:10,086 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:56:10,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895033671] [2021-11-23 04:56:10,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895033671] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:56:10,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:56:10,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:56:10,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568534378] [2021-11-23 04:56:10,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:56:10,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:56:10,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:56:10,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:56:10,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:56:10,088 INFO L87 Difference]: Start difference. First operand 2369 states and 2659 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:56:10,750 INFO L93 Difference]: Finished difference Result 4712 states and 5298 transitions. [2021-11-23 04:56:10,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:56:10,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 728 [2021-11-23 04:56:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:56:10,753 INFO L225 Difference]: With dead ends: 4712 [2021-11-23 04:56:10,753 INFO L226 Difference]: Without dead ends: 2375 [2021-11-23 04:56:10,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:56:10,756 INFO L933 BasicCegarLoop]: 898 mSDtfsCounter, 0 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:56:10,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1781 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:56:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2021-11-23 04:56:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2375. [2021-11-23 04:56:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2371 states have (on average 1.1239983129481232) internal successors, (2665), 2374 states have internal predecessors, (2665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2665 transitions. [2021-11-23 04:56:11,396 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2665 transitions. Word has length 728 [2021-11-23 04:56:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:56:11,397 INFO L470 AbstractCegarLoop]: Abstraction has 2375 states and 2665 transitions. [2021-11-23 04:56:11,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2665 transitions. [2021-11-23 04:56:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2021-11-23 04:56:11,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:56:11,402 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:56:11,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-23 04:56:11,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-11-23 04:56:11,609 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:56:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:56:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash 500544652, now seen corresponding path program 1 times [2021-11-23 04:56:11,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:56:11,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708439865] [2021-11-23 04:56:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:56:11,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:56:11,745 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:56:11,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171333135] [2021-11-23 04:56:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:56:11,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:56:11,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:56:11,748 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:56:11,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 04:56:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:56:14,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 9201 conjuncts, 217 conjunts are in the unsatisfiable core [2021-11-23 04:56:15,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:56:15,044 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:56:15,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2021-11-23 04:56:15,195 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:56:15,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 04:56:15,308 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:56:15,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 24 [2021-11-23 04:56:15,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-23 04:56:15,360 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:56:15,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 04:56:15,404 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:56:15,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 04:56:15,542 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:56:15,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 04:56:16,048 INFO L354 Elim1Store]: treesize reduction 745, result has 8.8 percent of original size [2021-11-23 04:56:16,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 87 treesize of output 128 [2021-11-23 04:56:16,723 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-23 04:56:16,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 36 [2021-11-23 04:56:16,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-23 04:56:18,080 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 04:56:18,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-11-23 04:56:18,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-23 04:56:18,129 INFO L354 Elim1Store]: treesize reduction 32, result has 22.0 percent of original size [2021-11-23 04:56:18,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 35 [2021-11-23 04:56:18,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-23 04:56:19,340 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:56:19,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-11-23 04:56:19,658 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:56:19,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2021-11-23 04:56:19,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-23 04:56:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2021-11-23 04:56:20,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:56:20,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:56:20,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708439865] [2021-11-23 04:56:20,515 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:56:20,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171333135] [2021-11-23 04:56:20,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171333135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:56:20,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:56:20,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-11-23 04:56:20,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224791022] [2021-11-23 04:56:20,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:56:20,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 04:56:20,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:56:20,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 04:56:20,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2021-11-23 04:56:20,517 INFO L87 Difference]: Start difference. First operand 2375 states and 2665 transitions. Second operand has 31 states, 31 states have (on average 13.35483870967742) internal successors, (414), 30 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:56:29,319 INFO L93 Difference]: Finished difference Result 4918 states and 5507 transitions. [2021-11-23 04:56:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-23 04:56:29,320 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 13.35483870967742) internal successors, (414), 30 states have internal predecessors, (414), 0 states have call successors, (0), 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 728 [2021-11-23 04:56:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:56:29,324 INFO L225 Difference]: With dead ends: 4918 [2021-11-23 04:56:29,324 INFO L226 Difference]: Without dead ends: 2575 [2021-11-23 04:56:29,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=294, Invalid=2058, Unknown=0, NotChecked=0, Total=2352 [2021-11-23 04:56:29,329 INFO L933 BasicCegarLoop]: 911 mSDtfsCounter, 751 mSDsluCounter, 13483 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 14394 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2021-11-23 04:56:29,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 14394 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1606 Invalid, 0 Unknown, 315 Unchecked, 7.4s Time] [2021-11-23 04:56:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2021-11-23 04:56:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2452. [2021-11-23 04:56:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2448 states have (on average 1.1233660130718954) internal successors, (2750), 2451 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 2750 transitions. [2021-11-23 04:56:30,019 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 2750 transitions. Word has length 728 [2021-11-23 04:56:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:56:30,019 INFO L470 AbstractCegarLoop]: Abstraction has 2452 states and 2750 transitions. [2021-11-23 04:56:30,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 13.35483870967742) internal successors, (414), 30 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:56:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 2750 transitions. [2021-11-23 04:56:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2021-11-23 04:56:30,023 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:56:30,024 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:56:30,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-11-23 04:56:30,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-23 04:56:30,225 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:56:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:56:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash 450982343, now seen corresponding path program 1 times [2021-11-23 04:56:30,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:56:30,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158355922] [2021-11-23 04:56:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:56:30,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:56:30,354 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:56:30,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881862895] [2021-11-23 04:56:30,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:56:30,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:56:30,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:56:30,356 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:56:30,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-23 04:56:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:56:33,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 9218 conjuncts, 182 conjunts are in the unsatisfiable core [2021-11-23 04:56:33,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:56:33,406 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:56:33,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2021-11-23 04:56:33,535 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:56:33,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 04:56:33,656 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:56:33,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 04:56:33,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 04:56:33,706 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:56:33,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 04:56:33,753 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:56:33,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 04:56:33,857 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:56:33,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 04:56:34,312 INFO L354 Elim1Store]: treesize reduction 662, result has 14.8 percent of original size [2021-11-23 04:56:34,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 138 [2021-11-23 04:56:35,693 INFO L354 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2021-11-23 04:56:35,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2021-11-23 04:56:35,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-23 04:56:35,735 INFO L354 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-11-23 04:56:35,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2021-11-23 04:56:36,700 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-11-23 04:56:36,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2021-11-23 04:56:36,725 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 04:56:36,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2021-11-23 04:56:37,335 INFO L354 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2021-11-23 04:56:37,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2021-11-23 04:56:38,762 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 04:56:38,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 04:56:39,598 INFO L354 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2021-11-23 04:56:39,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2021-11-23 04:56:40,310 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-11-23 04:56:40,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2021-11-23 04:56:40,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 04:56:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2021-11-23 04:56:41,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 04:56:42,758 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base| v_ArrVal_18235))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:56:43,024 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_18234)) |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base| v_ArrVal_18235))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:56:43,047 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_18234)) |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_18235))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:56:43,066 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_18234)) |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| v_ArrVal_18235))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:56:43,084 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_18234)) |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| v_ArrVal_18235))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:56:43,109 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_18234)) |c_ULTIMATE.start_ldv_zalloc_#res#1.base| v_ArrVal_18235))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))) (= 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:56:43,128 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~ldv_linux_net_register_probe_state~0 1) (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_18234)) |c_ULTIMATE.start_ldv_calloc_#res#1.base| v_ArrVal_18235))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))))))) is different from false [2021-11-23 04:56:43,149 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_18234)) |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| v_ArrVal_18235))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:56:43,252 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_18234)) |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| v_ArrVal_18235))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:56:45,508 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_18238 (Array Int Int)) (v_ArrVal_18234 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18| Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18237 Int) (v_ArrVal_18232 (Array Int Int))) (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| ((as const (Array Int Int)) 0)) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18| v_ArrVal_18232))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20|) 124 v_ArrVal_18234))) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18| v_ArrVal_18235))) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18|) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20|) 116 v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (not (= (select (store |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| 1) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18|) 0))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:57:08,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_18221 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_14| Int) (v_ArrVal_18234 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_14| Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_14| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_14| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_14| Int) (v_ArrVal_18214 Int) (v_ArrVal_18215 Int) (v_ArrVal_18226 Int) (v_ArrVal_18237 Int) (v_ArrVal_18216 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_14| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_14| Int) (v_ArrVal_18228 Int) (v_ArrVal_18238 (Array Int Int)) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_14| Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| Int) (|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_17| Int) (|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_18| Int) (v_ArrVal_18235 (Array Int Int)) (v_ArrVal_18232 (Array Int Int))) (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_ldv_pci_pci_instance_1_~data~2#1.base| v_ArrVal_18214))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_18| v_ArrVal_18215))) (let ((.cse2 (store (let ((.cse5 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| ((as const (Array Int Int)) 0)) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18| v_ArrVal_18232))) (store .cse5 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| (store (select .cse5 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20|) 124 v_ArrVal_18234))) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18| v_ArrVal_18235)) (.cse0 (store .cse4 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_17| v_ArrVal_18216)) (.cse3 (+ |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_14|) 0)) (not (= (select .cse1 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_18|) 0)) (< 0 (select (select (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| v_ArrVal_18238) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))) (= (select (select (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20|) 116 v_ArrVal_18237)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_14| .cse3) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_14| .cse3) (not (= (select (store (store (store (store (store (store (store (store (store .cse0 |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_14| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_14| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_14| v_ArrVal_18221) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_14| v_ArrVal_18226) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_14| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_14| v_ArrVal_18228) |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_14| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_14| 1) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_20| 1) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_18|) 0)) (not (= (select .cse4 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_17|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_14| .cse3) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_14| .cse3)))))) is different from false [2021-11-23 04:58:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2021-11-23 04:58:08,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:58:08,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158355922] [2021-11-23 04:58:08,366 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:58:08,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881862895] [2021-11-23 04:58:08,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881862895] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 04:58:08,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 04:58:08,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 62 [2021-11-23 04:58:08,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303079275] [2021-11-23 04:58:08,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 04:58:08,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-11-23 04:58:08,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:58:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-11-23 04:58:08,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2282, Unknown=207, NotChecked=1210, Total=3906 [2021-11-23 04:58:08,369 INFO L87 Difference]: Start difference. First operand 2452 states and 2750 transitions. Second operand has 63 states, 63 states have (on average 10.88888888888889) internal successors, (686), 62 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:58:24,295 INFO L93 Difference]: Finished difference Result 4858 states and 5447 transitions. [2021-11-23 04:58:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-23 04:58:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 10.88888888888889) internal successors, (686), 62 states have internal predecessors, (686), 0 states have call successors, (0), 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 730 [2021-11-23 04:58:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:58:24,298 INFO L225 Difference]: With dead ends: 4858 [2021-11-23 04:58:24,299 INFO L226 Difference]: Without dead ends: 2515 [2021-11-23 04:58:24,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1500 GetRequests, 1403 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=768, Invalid=5045, Unknown=237, NotChecked=1782, Total=7832 [2021-11-23 04:58:24,304 INFO L933 BasicCegarLoop]: 897 mSDtfsCounter, 603 mSDsluCounter, 34288 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 35185 SdHoareTripleChecker+Invalid, 6006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4635 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-23 04:58:24,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 35185 Invalid, 6006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1317 Invalid, 0 Unknown, 4635 Unchecked, 6.4s Time] [2021-11-23 04:58:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2021-11-23 04:58:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2454. [2021-11-23 04:58:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2450 states have (on average 1.123265306122449) internal successors, (2752), 2453 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 2752 transitions. [2021-11-23 04:58:24,946 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 2752 transitions. Word has length 730 [2021-11-23 04:58:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:58:24,946 INFO L470 AbstractCegarLoop]: Abstraction has 2454 states and 2752 transitions. [2021-11-23 04:58:24,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 10.88888888888889) internal successors, (686), 62 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 2752 transitions. [2021-11-23 04:58:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2021-11-23 04:58:24,951 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:58:24,951 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:58:24,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-11-23 04:58:25,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-23 04:58:25,153 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:58:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:58:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash 66243650, now seen corresponding path program 2 times [2021-11-23 04:58:25,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:58:25,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390729592] [2021-11-23 04:58:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:58:25,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:58:25,279 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:58:25,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695966703] [2021-11-23 04:58:25,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 04:58:25,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:58:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:58:25,281 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:58:25,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-23 04:58:27,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-23 04:58:27,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 04:58:27,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 5218 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 04:58:27,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:58:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2021-11-23 04:58:28,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:58:28,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:58:28,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390729592] [2021-11-23 04:58:28,796 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:58:28,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695966703] [2021-11-23 04:58:28,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695966703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:58:28,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:58:28,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 04:58:28,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797952082] [2021-11-23 04:58:28,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:58:28,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 04:58:28,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:58:28,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 04:58:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:58:28,799 INFO L87 Difference]: Start difference. First operand 2454 states and 2752 transitions. Second operand has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:58:30,176 INFO L93 Difference]: Finished difference Result 6653 states and 7413 transitions. [2021-11-23 04:58:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 04:58:30,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 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 732 [2021-11-23 04:58:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:58:30,186 INFO L225 Difference]: With dead ends: 6653 [2021-11-23 04:58:30,187 INFO L226 Difference]: Without dead ends: 4310 [2021-11-23 04:58:30,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-23 04:58:30,189 INFO L933 BasicCegarLoop]: 1368 mSDtfsCounter, 1269 mSDsluCounter, 4422 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 5790 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:58:30,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1269 Valid, 5790 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:58:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2021-11-23 04:58:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 2462. [2021-11-23 04:58:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2458 states have (on average 1.1228641171684297) internal successors, (2760), 2461 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2760 transitions. [2021-11-23 04:58:30,835 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2760 transitions. Word has length 732 [2021-11-23 04:58:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:58:30,836 INFO L470 AbstractCegarLoop]: Abstraction has 2462 states and 2760 transitions. [2021-11-23 04:58:30,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2760 transitions. [2021-11-23 04:58:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2021-11-23 04:58:30,840 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:58:30,841 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:58:30,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-11-23 04:58:31,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:58:31,041 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:58:31,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:58:31,042 INFO L85 PathProgramCache]: Analyzing trace with hash -783641065, now seen corresponding path program 1 times [2021-11-23 04:58:31,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:58:31,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321369535] [2021-11-23 04:58:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:58:31,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:58:31,182 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:58:31,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223597889] [2021-11-23 04:58:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:58:31,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:58:31,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:58:31,183 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:58:31,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-23 04:58:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:58:34,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 9274 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 04:58:34,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:58:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-11-23 04:58:35,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:58:35,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:58:35,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321369535] [2021-11-23 04:58:35,165 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:58:35,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223597889] [2021-11-23 04:58:35,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223597889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:58:35,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:58:35,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 04:58:35,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898004027] [2021-11-23 04:58:35,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:58:35,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 04:58:35,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:58:35,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 04:58:35,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-23 04:58:35,167 INFO L87 Difference]: Start difference. First operand 2462 states and 2760 transitions. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:58:36,520 INFO L93 Difference]: Finished difference Result 6403 states and 7139 transitions. [2021-11-23 04:58:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 04:58:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 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 737 [2021-11-23 04:58:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:58:36,524 INFO L225 Difference]: With dead ends: 6403 [2021-11-23 04:58:36,524 INFO L226 Difference]: Without dead ends: 4052 [2021-11-23 04:58:36,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-23 04:58:36,528 INFO L933 BasicCegarLoop]: 1367 mSDtfsCounter, 2141 mSDsluCounter, 5583 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2141 SdHoareTripleChecker+Valid, 6950 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:58:36,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2141 Valid, 6950 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:58:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2021-11-23 04:58:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 2470. [2021-11-23 04:58:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2466 states have (on average 1.1224655312246554) internal successors, (2768), 2469 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 2768 transitions. [2021-11-23 04:58:37,236 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 2768 transitions. Word has length 737 [2021-11-23 04:58:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:58:37,236 INFO L470 AbstractCegarLoop]: Abstraction has 2470 states and 2768 transitions. [2021-11-23 04:58:37,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:58:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2768 transitions. [2021-11-23 04:58:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2021-11-23 04:58:37,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:58:37,241 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:58:37,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-11-23 04:58:37,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-11-23 04:58:37,442 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:58:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:58:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1835584791, now seen corresponding path program 1 times [2021-11-23 04:58:37,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:58:37,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841933434] [2021-11-23 04:58:37,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:58:37,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:58:37,568 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:58:37,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795221528] [2021-11-23 04:58:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:58:37,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:58:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:58:37,570 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:58:37,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-23 04:58:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:58:40,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 9586 conjuncts, 161 conjunts are in the unsatisfiable core [2021-11-23 04:58:40,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:58:40,545 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:58:40,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2021-11-23 04:58:40,654 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 04:58:40,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-23 04:58:40,730 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:58:40,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2021-11-23 04:58:41,045 INFO L354 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2021-11-23 04:58:41,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2021-11-23 04:58:41,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-23 04:58:41,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 04:58:41,727 INFO L354 Elim1Store]: treesize reduction 26, result has 46.9 percent of original size [2021-11-23 04:58:41,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 44 [2021-11-23 04:58:41,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-23 04:58:41,777 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 04:58:41,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-23 04:58:42,426 INFO L354 Elim1Store]: treesize reduction 23, result has 43.9 percent of original size [2021-11-23 04:58:42,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 55 [2021-11-23 04:58:43,941 INFO L354 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2021-11-23 04:58:43,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 62 [2021-11-23 04:58:52,537 INFO L354 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2021-11-23 04:58:52,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 63 [2021-11-23 04:58:53,833 INFO L354 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2021-11-23 04:58:53,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 70 [2021-11-23 04:58:54,811 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 04:58:54,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 55 [2021-11-23 04:58:55,013 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 04:58:55,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2021-11-23 04:58:55,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-11-23 04:58:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1417 trivial. 0 not checked. [2021-11-23 04:58:55,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 04:58:57,478 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base|) |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.offset| v_ArrVal_23771)))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:57,875 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~ldv_linux_net_register_probe_state~0 1) (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769)))) (store .cse1 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base| (store (select .cse1 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base|) |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.offset| v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0))))) is different from false [2021-11-23 04:58:57,923 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769)))) (store .cse1 |c_ULTIMATE.start_kzalloc_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_kzalloc_#res#1.base|) |c_ULTIMATE.start_kzalloc_#res#1.offset| v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:57,964 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769)))) (store .cse1 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base|) |c_ULTIMATE.start_ldv_kzalloc_#res#1.offset| v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:58,008 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769)))) (store .cse1 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base|) |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.offset| v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:58,051 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769)))) (store .cse1 |c_ULTIMATE.start_ldv_zalloc_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_zalloc_#res#1.base|) |c_ULTIMATE.start_ldv_zalloc_#res#1.offset| v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:58,088 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769)))) (store .cse1 |c_ULTIMATE.start_ldv_calloc_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_calloc_#res#1.base|) |c_ULTIMATE.start_ldv_calloc_#res#1.offset| v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:58,127 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769)))) (store .cse1 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base|) |c_ULTIMATE.start_ldv_calloc_~res~4#1.offset| v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:58,290 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769)))) (store .cse1 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base|) |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.offset| v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:58,374 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| ((as const (Array Int Int)) 0)))) (store .cse2 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse2 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset| 124) v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| (store (select .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base|) (+ 116 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0)) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:59,468 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| ((as const (Array Int Int)) 0)))) (store .cse2 |c_ULTIMATE.start_kzalloc_#res#1.base| (store (select .cse2 |c_ULTIMATE.start_kzalloc_#res#1.base|) (+ |c_ULTIMATE.start_kzalloc_#res#1.offset| 124) v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_kzalloc_#res#1.base| (store (select .cse0 |c_ULTIMATE.start_kzalloc_#res#1.base|) (+ 116 |c_ULTIMATE.start_kzalloc_#res#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:59,598 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| ((as const (Array Int Int)) 0)))) (store .cse2 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| (store (select .cse2 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base|) (+ |c_ULTIMATE.start_ldv_kzalloc_#res#1.offset| 124) v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| (store (select .cse0 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base|) (+ 116 |c_ULTIMATE.start_ldv_kzalloc_#res#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0)) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:59,707 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| ((as const (Array Int Int)) 0)))) (store .cse2 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| (store (select .cse2 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base|) (+ 124 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.offset|) v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0)) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| (store (select .cse0 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base|) (+ 116 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:59,831 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| ((as const (Array Int Int)) 0)))) (store .cse2 |c_ULTIMATE.start_ldv_zalloc_#res#1.base| (store (select .cse2 |c_ULTIMATE.start_ldv_zalloc_#res#1.base|) (+ |c_ULTIMATE.start_ldv_zalloc_#res#1.offset| 124) v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_zalloc_#res#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_zalloc_#res#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0)) (= 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_zalloc_#res#1.base| (store (select .cse0 |c_ULTIMATE.start_ldv_zalloc_#res#1.base|) (+ 116 |c_ULTIMATE.start_ldv_zalloc_#res#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:58:59,947 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| ((as const (Array Int Int)) 0)))) (store .cse2 |c_ULTIMATE.start_ldv_calloc_#res#1.base| (store (select .cse2 |c_ULTIMATE.start_ldv_calloc_#res#1.base|) (+ |c_ULTIMATE.start_ldv_calloc_#res#1.offset| 124) v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#res#1.base| (store (select .cse0 |c_ULTIMATE.start_ldv_calloc_#res#1.base|) (+ 116 |c_ULTIMATE.start_ldv_calloc_#res#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0)) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#res#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#res#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:59:00,039 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| ((as const (Array Int Int)) 0)))) (store .cse2 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| (store (select .cse2 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base|) (+ 124 |c_ULTIMATE.start_ldv_calloc_~res~4#1.offset|) v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| (store (select .cse0 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base|) (+ 116 |c_ULTIMATE.start_ldv_calloc_~res~4#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0)) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:59:00,546 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| ((as const (Array Int Int)) 0)))) (store .cse2 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| (store (select .cse2 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base|) (+ 124 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.offset|) v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| (store (select .cse0 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base|) (+ 116 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.offset|) v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0)) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:59:00,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 271 [2021-11-23 04:59:00,630 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 04:59:01,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|)))) is different from false [2021-11-23 04:59:03,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23764 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res#1.base| v_ArrVal_23764) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0)))) is different from false [2021-11-23 04:59:03,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23764 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_~res~5#1.base| v_ArrVal_23764) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|)))) is different from false [2021-11-23 04:59:03,652 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_23| Int) (v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23764 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_23| v_ArrVal_23764) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_23|) 0))))) is different from false [2021-11-23 04:59:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1417 trivial. 0 not checked. [2021-11-23 04:59:06,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:59:06,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841933434] [2021-11-23 04:59:06,290 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:59:06,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795221528] [2021-11-23 04:59:06,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795221528] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 04:59:06,291 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 04:59:06,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2021-11-23 04:59:06,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417331207] [2021-11-23 04:59:06,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 04:59:06,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-11-23 04:59:06,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:59:06,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-23 04:59:06,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1438, Unknown=50, NotChecked=2134, Total=3782 [2021-11-23 04:59:06,293 INFO L87 Difference]: Start difference. First operand 2470 states and 2768 transitions. Second operand has 62 states, 62 states have (on average 11.451612903225806) internal successors, (710), 61 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:06,910 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~ldv_linux_arch_io_iomem~0 0) (= c_~ldv_linux_net_register_probe_state~0 0) (= |c_~#driver_name~0.base| 79) (= (select |c_#valid| 79) 1) (not (= 79 |c_ULTIMATE.start_ldv_xmalloc_~res~5#1.base|)) (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23764 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_~res~5#1.base| v_ArrVal_23764) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|)))) (= |c_~#driver_name~0.offset| 0) (<= 101 (select (select |c_#memory_int| |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2)))) is different from false [2021-11-23 04:59:06,919 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~ldv_linux_arch_io_iomem~0 0) (= |c_~#driver_name~0.base| 79) (not (= 79 |c_ULTIMATE.start_ldv_xmalloc_~res~5#1.base|)) (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23764 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_~res~5#1.base| v_ArrVal_23764) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|)))) (= |c_~#driver_name~0.offset| 0) (<= 101 (select (select |c_#memory_int| |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2)))) is different from false [2021-11-23 04:59:06,927 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~ldv_linux_arch_io_iomem~0 0) (= |c_~#driver_name~0.base| 79) (not (= |c_ULTIMATE.start_ldv_xmalloc_#res#1.base| 79)) (= |c_~#driver_name~0.offset| 0) (<= 101 (select (select |c_#memory_int| |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (v_ArrVal_23764 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res#1.base| v_ArrVal_23764) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0))))) is different from false [2021-11-23 04:59:06,934 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~ldv_linux_arch_io_iomem~0 0) (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|)))) (= |c_~#driver_name~0.base| 79) (= |c_~#driver_name~0.offset| 0) (<= 101 (select (select |c_#memory_int| |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2)))) is different from false [2021-11-23 04:59:06,945 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~ldv_linux_arch_io_iomem~0 0) (= c_~ldv_linux_net_register_probe_state~0 0) (= |c_~#driver_name~0.base| 79) (or (forall ((v_ArrVal_23771 Int) (v_ArrVal_23772 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| Int) (v_ArrVal_23775 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| Int) (v_ArrVal_23769 Int) (v_ArrVal_23774 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| .cse3) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| .cse3)))) (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 124 v_ArrVal_23769))))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|) 0 v_ArrVal_23771))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| (store (select .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24|) 116 v_ArrVal_23772)) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|) 0) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23775) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2))) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| v_ArrVal_23774) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (= |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_24| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_22|)))) (= c_~ldv_linux_net_register_probe_state~0 1)) (= |c_~#driver_name~0.offset| 0) (<= 101 (select (select |c_#memory_int| |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 2)))) is different from false [2021-11-23 04:59:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:59:29,814 INFO L93 Difference]: Finished difference Result 4984 states and 5583 transitions. [2021-11-23 04:59:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-23 04:59:29,815 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 11.451612903225806) internal successors, (710), 61 states have internal predecessors, (710), 0 states have call successors, (0), 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 777 [2021-11-23 04:59:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:59:29,818 INFO L225 Difference]: With dead ends: 4984 [2021-11-23 04:59:29,819 INFO L226 Difference]: Without dead ends: 2625 [2021-11-23 04:59:29,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1584 GetRequests, 1495 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 27 IntricatePredicates, 2 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=409, Invalid=3299, Unknown=60, NotChecked=3888, Total=7656 [2021-11-23 04:59:29,822 INFO L933 BasicCegarLoop]: 884 mSDtfsCounter, 373 mSDsluCounter, 37650 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 38534 SdHoareTripleChecker+Invalid, 7026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5643 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2021-11-23 04:59:29,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 38534 Invalid, 7026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1364 Invalid, 0 Unknown, 5643 Unchecked, 7.7s Time] [2021-11-23 04:59:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2021-11-23 04:59:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2571. [2021-11-23 04:59:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2567 states have (on average 1.1215426567978184) internal successors, (2879), 2570 states have internal predecessors, (2879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 2879 transitions. [2021-11-23 04:59:30,593 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 2879 transitions. Word has length 777 [2021-11-23 04:59:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:59:30,593 INFO L470 AbstractCegarLoop]: Abstraction has 2571 states and 2879 transitions. [2021-11-23 04:59:30,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 11.451612903225806) internal successors, (710), 61 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 2879 transitions. [2021-11-23 04:59:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2021-11-23 04:59:30,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:59:30,599 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:59:30,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-23 04:59:30,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:59:30,800 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:59:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:59:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash 628881724, now seen corresponding path program 2 times [2021-11-23 04:59:30,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:59:30,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816591166] [2021-11-23 04:59:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:59:30,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:59:30,947 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:59:30,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172571505] [2021-11-23 04:59:30,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 04:59:30,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:59:30,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:59:30,953 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:59:30,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-23 04:59:36,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-23 04:59:36,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 04:59:36,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 5257 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-23 04:59:36,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:59:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2021-11-23 04:59:37,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:59:37,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:59:37,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816591166] [2021-11-23 04:59:37,141 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:59:37,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172571505] [2021-11-23 04:59:37,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172571505] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:59:37,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:59:37,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 04:59:37,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870313378] [2021-11-23 04:59:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:59:37,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 04:59:37,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:59:37,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 04:59:37,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:59:37,143 INFO L87 Difference]: Start difference. First operand 2571 states and 2879 transitions. Second operand has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:59:38,297 INFO L93 Difference]: Finished difference Result 5082 states and 5690 transitions. [2021-11-23 04:59:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 04:59:38,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 0 states have call successors, (0), 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 779 [2021-11-23 04:59:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:59:38,300 INFO L225 Difference]: With dead ends: 5082 [2021-11-23 04:59:38,300 INFO L226 Difference]: Without dead ends: 2723 [2021-11-23 04:59:38,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-23 04:59:38,303 INFO L933 BasicCegarLoop]: 1026 mSDtfsCounter, 2620 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2620 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 04:59:38,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2620 Valid, 2153 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 04:59:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2021-11-23 04:59:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2571. [2021-11-23 04:59:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2567 states have (on average 1.1207635372029607) internal successors, (2877), 2570 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 2877 transitions. [2021-11-23 04:59:39,033 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 2877 transitions. Word has length 779 [2021-11-23 04:59:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:59:39,033 INFO L470 AbstractCegarLoop]: Abstraction has 2571 states and 2877 transitions. [2021-11-23 04:59:39,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 2877 transitions. [2021-11-23 04:59:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2021-11-23 04:59:39,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:59:39,038 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:59:39,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-11-23 04:59:39,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:59:39,239 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:59:39,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:59:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash -382451234, now seen corresponding path program 1 times [2021-11-23 04:59:39,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:59:39,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642725589] [2021-11-23 04:59:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:59:39,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:59:39,368 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:59:39,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1511798264] [2021-11-23 04:59:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:59:39,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:59:39,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:59:39,369 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:59:39,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-23 04:59:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:59:45,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 9628 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 04:59:45,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:59:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 1309 trivial. 0 not checked. [2021-11-23 04:59:46,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 04:59:46,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:59:46,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642725589] [2021-11-23 04:59:46,408 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 04:59:46,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511798264] [2021-11-23 04:59:46,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511798264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:59:46,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:59:46,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 04:59:46,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636732171] [2021-11-23 04:59:46,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:59:46,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 04:59:46,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:59:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 04:59:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 04:59:46,410 INFO L87 Difference]: Start difference. First operand 2571 states and 2877 transitions. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:59:47,798 INFO L93 Difference]: Finished difference Result 6170 states and 6874 transitions. [2021-11-23 04:59:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 04:59:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 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 780 [2021-11-23 04:59:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:59:47,803 INFO L225 Difference]: With dead ends: 6170 [2021-11-23 04:59:47,803 INFO L226 Difference]: Without dead ends: 3811 [2021-11-23 04:59:47,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-23 04:59:47,806 INFO L933 BasicCegarLoop]: 1272 mSDtfsCounter, 1342 mSDsluCounter, 4417 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 5689 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 04:59:47,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1342 Valid, 5689 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 04:59:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2021-11-23 04:59:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 2579. [2021-11-23 04:59:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 2575 states have (on average 1.120388349514563) internal successors, (2885), 2578 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 2885 transitions. [2021-11-23 04:59:48,560 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 2885 transitions. Word has length 780 [2021-11-23 04:59:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:59:48,560 INFO L470 AbstractCegarLoop]: Abstraction has 2579 states and 2885 transitions. [2021-11-23 04:59:48,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 04:59:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 2885 transitions. [2021-11-23 04:59:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2021-11-23 04:59:48,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:59:48,565 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:59:48,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-23 04:59:48,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:59:48,766 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 04:59:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:59:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash -91484634, now seen corresponding path program 1 times [2021-11-23 04:59:48,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:59:48,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964455757] [2021-11-23 04:59:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:59:48,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:59:48,904 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 04:59:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1693204181] [2021-11-23 04:59:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:59:48,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 04:59:48,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:59:48,907 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 04:59:48,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-23 04:59:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:59:52,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 9940 conjuncts, 193 conjunts are in the unsatisfiable core [2021-11-23 04:59:52,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 04:59:52,647 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:59:52,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2021-11-23 04:59:52,763 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 04:59:52,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 04:59:52,868 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 04:59:52,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2021-11-23 04:59:52,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 04:59:52,917 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 04:59:52,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2021-11-23 04:59:52,971 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-11-23 04:59:52,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2021-11-23 04:59:53,081 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-11-23 04:59:53,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2021-11-23 04:59:54,204 INFO L354 Elim1Store]: treesize reduction 853, result has 18.2 percent of original size [2021-11-23 04:59:54,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 22 case distinctions, treesize of input 117 treesize of output 274 [2021-11-23 05:00:11,466 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-23 05:00:11,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 40 [2021-11-23 05:00:11,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 05:00:12,948 INFO L354 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2021-11-23 05:00:12,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2021-11-23 05:00:12,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-23 05:00:13,068 INFO L354 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2021-11-23 05:00:13,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 45 [2021-11-23 05:00:14,196 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 05:00:14,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2021-11-23 05:00:15,053 INFO L354 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2021-11-23 05:00:15,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2021-11-23 05:00:35,995 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-23 05:00:35,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 46 [2021-11-23 05:00:36,156 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-23 05:00:36,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 46 [2021-11-23 05:00:36,414 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-23 05:00:36,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 53 [2021-11-23 05:00:36,851 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 05:00:36,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 46 [2021-11-23 05:00:41,084 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 05:00:41,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2021-11-23 05:00:41,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2021-11-23 05:00:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2021-11-23 05:00:41,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 05:00:43,142 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29473 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_29473) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset837#1| |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| 1)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,358 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29473 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_29473) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset837#1| 3 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset|)))) (forall ((v_ArrVal_29471 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_29471) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset837#1| |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| 1)) 0)) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,367 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29471 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)) (forall ((v_ArrVal_29473 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,420 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base|) |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.offset| v_ArrVal_29469)))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,616 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29467))) (store .cse1 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base| (store (select .cse1 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.base|) |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_device~0#1.offset| v_ArrVal_29469))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,634 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29467))) (store .cse1 |c_ULTIMATE.start_kzalloc_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_kzalloc_#res#1.base|) |c_ULTIMATE.start_kzalloc_#res#1.offset| v_ArrVal_29469))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,651 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29467))) (store .cse1 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base|) |c_ULTIMATE.start_ldv_kzalloc_#res#1.offset| v_ArrVal_29469))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,668 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29467))) (store .cse1 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base|) |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.offset| v_ArrVal_29469))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,686 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29467))) (store .cse1 |c_ULTIMATE.start_ldv_zalloc_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_zalloc_#res#1.base|) |c_ULTIMATE.start_ldv_zalloc_#res#1.offset| v_ArrVal_29469))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,704 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~ldv_linux_net_register_probe_state~0 1) (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29467))) (store .cse1 |c_ULTIMATE.start_ldv_calloc_#res#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_calloc_#res#1.base|) |c_ULTIMATE.start_ldv_calloc_#res#1.offset| v_ArrVal_29469))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0))))) is different from false [2021-11-23 05:00:43,722 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29467))) (store .cse1 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base|) |c_ULTIMATE.start_ldv_calloc_~res~4#1.offset| v_ArrVal_29469))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:43,793 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29467))) (store .cse1 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| (store (select .cse1 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base|) |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.offset| v_ArrVal_29469))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:44,316 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_29467))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (= (select (select (store .cse0 |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:44,350 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| v_ArrVal_29467))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_#res#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:44,381 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| v_ArrVal_29467))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_kzalloc_~res~2#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:44,412 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |c_ULTIMATE.start_ldv_zalloc_#res#1.base| v_ArrVal_29467))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_zalloc_#res#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_zalloc_#res#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:44,444 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |c_ULTIMATE.start_ldv_calloc_#res#1.base| v_ArrVal_29467))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (= 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#res#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#res#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:44,475 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| v_ArrVal_29467))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_~res~4#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3)))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:44,615 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (v_ArrVal_29469 Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| v_ArrVal_29467))) (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (< 0 (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (not (= (select |c_#valid| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (= (select (select (store .cse0 |c_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0)))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:00:47,697 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_29467 (Array Int Int)) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| Int) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| Int) (v_ArrVal_29465 (Array Int Int)) (v_ArrVal_29452 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| Int) (v_ArrVal_29451 Int) (v_ArrVal_29462 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| Int) (v_ArrVal_29448 Int) (v_ArrVal_29447 Int) (v_ArrVal_29469 Int)) (let ((.cse1 (store (store |c_#valid| |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| 1))) (let ((.cse2 (store (store (store (store (store (store .cse1 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| v_ArrVal_29451) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| v_ArrVal_29452) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| v_ArrVal_29447) |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| v_ArrVal_29448) |v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| 1)) (.cse0 (let ((.cse3 (store (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29465) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29467))) (store .cse3 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse3 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| |c_#StackHeapBarrier|) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| |c_#StackHeapBarrier|) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (not (= (select .cse1 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18|) 0)) (< 0 (select (store (store .cse1 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18|)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| |c_#StackHeapBarrier|) (not (= (select (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| 1) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| v_ArrVal_29462) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| |c_#StackHeapBarrier|) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28|) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| |c_#StackHeapBarrier|) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| |c_#StackHeapBarrier|))))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2021-11-23 05:01:01,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_29467 (Array Int Int)) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| Int) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| Int) (v_ArrVal_29465 (Array Int Int)) (v_ArrVal_29452 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| Int) (v_ArrVal_29451 Int) (v_ArrVal_29462 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| Int) (v_ArrVal_29448 Int) (v_ArrVal_29447 Int) (v_ArrVal_29469 Int)) (let ((.cse1 (store (store |c_#valid| |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| 1))) (let ((.cse2 (store (store (store (store (store (store .cse1 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| v_ArrVal_29451) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| v_ArrVal_29452) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| v_ArrVal_29447) |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| v_ArrVal_29448) |v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| 1)) (.cse0 (let ((.cse3 (store (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29465) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29467))) (store .cse3 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse3 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| |c_#StackHeapBarrier|) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| |c_#StackHeapBarrier|) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (not (= (select .cse1 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18|) 0)) (< 0 (select (store (store .cse1 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18|)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| |c_#StackHeapBarrier|) (not (= (select (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| 1) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| v_ArrVal_29462) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| |c_#StackHeapBarrier|) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28|) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| |c_#StackHeapBarrier|) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| |c_#StackHeapBarrier|))))) is different from false [2021-11-23 05:02:42,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_29467 (Array Int Int)) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| Int) (v_ArrVal_29465 (Array Int Int)) (v_ArrVal_29452 Int) (v_ArrVal_29451 Int) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int) (v_ArrVal_29444 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| Int) (|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26| Int) (v_ArrVal_29462 Int) (|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| Int) (v_ArrVal_29448 Int) (v_ArrVal_29447 Int) (v_ArrVal_29469 Int) (v_ArrVal_29445 Int)) (let ((.cse5 (store |c_#valid| |c_ULTIMATE.start_ldv_pci_pci_instance_1_~data~2#1.base| v_ArrVal_29444))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26| v_ArrVal_29445))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25| 1))) (let ((.cse2 (store (store .cse3 |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| 1))) (let ((.cse1 (store (store (store (store (store (store .cse2 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| v_ArrVal_29451) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| v_ArrVal_29452) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| v_ArrVal_29447) |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| v_ArrVal_29448) |v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| 1)) (.cse0 (let ((.cse6 (store (store (store |c_#memory_int| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29465) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29467))) (store .cse6 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse6 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469))))) (or (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| |c_#StackHeapBarrier|) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| |c_#StackHeapBarrier|) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (not (= (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28|) 0)) (< 0 (select (store (store .cse2 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18|)) (not (= (select (store .cse3 |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| v_ArrVal_29462) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| |c_#StackHeapBarrier|) (not (= (select (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| 1) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| |c_#StackHeapBarrier|) (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28|) (not (= 0 (select .cse2 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18|))) (not (= (select .cse4 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| |c_#StackHeapBarrier|) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| |c_#StackHeapBarrier|) (not (= (select .cse5 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26|) 0))))))))) is different from false [2021-11-23 05:02:50,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_29467 (Array Int Int)) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| Int) (v_ArrVal_29442 (Array Int Int)) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| Int) (v_ArrVal_29465 (Array Int Int)) (v_ArrVal_29452 Int) (v_ArrVal_29451 Int) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int) (v_ArrVal_29444 Int) (v_ArrVal_29443 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| Int) (|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26| Int) (v_ArrVal_29462 Int) (|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| Int) (|v_ULTIMATE.start_ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base_14| Int) (v_ArrVal_29448 Int) (v_ArrVal_29447 Int) (v_ArrVal_29469 Int) (v_ArrVal_29445 Int)) (let ((.cse6 (store (store |c_#valid| |v_ULTIMATE.start_ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base_14| v_ArrVal_29443) |c_ULTIMATE.start_ldv_xmalloc_#res#1.base| v_ArrVal_29444))) (let ((.cse0 (store .cse6 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26| v_ArrVal_29445))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25| 1))) (let ((.cse4 (store (store .cse3 |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| 1))) (let ((.cse2 (store (store (store (store (store (store .cse4 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| v_ArrVal_29451) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| v_ArrVal_29452) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| v_ArrVal_29447) |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| v_ArrVal_29448) |v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| 1)) (.cse5 (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_#res#1.base| v_ArrVal_29442) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29465) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29467))) (store .cse7 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse7 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469)))) (.cse1 (+ |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| .cse1) (not (= (select (store .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| 1) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (not (= (select (store .cse3 |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| v_ArrVal_29462) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| .cse1) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| .cse1) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| .cse1) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| .cse1) (< 0 (select (store (store .cse4 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18|)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| .cse1) (< 0 (select (select (store .cse5 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (not (= 0 (select .cse2 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28|))) (not (= (select .cse6 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26|) 0)) (= (select (select (store .cse5 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (<= |v_ULTIMATE.start_ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base_14| .cse1) (not (= 0 (select .cse4 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18|)))))))))) is different from false [2021-11-23 05:02:58,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_29467 (Array Int Int)) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| Int) (v_ArrVal_29442 (Array Int Int)) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| Int) (v_ArrVal_29465 (Array Int Int)) (v_ArrVal_29452 Int) (v_ArrVal_29451 Int) (v_ArrVal_29471 (Array Int Int)) (v_ArrVal_29473 (Array Int Int)) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| Int) (|v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| Int) (v_ArrVal_29444 Int) (v_ArrVal_29443 Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| Int) (|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26| Int) (v_ArrVal_29462 Int) (|v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25| Int) (|v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| Int) (|v_ULTIMATE.start_ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base_14| Int) (v_ArrVal_29448 Int) (v_ArrVal_29447 Int) (v_ArrVal_29469 Int) (v_ArrVal_29445 Int)) (let ((.cse5 (store (store |c_#valid| |v_ULTIMATE.start_ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base_14| v_ArrVal_29443) |c_ULTIMATE.start_ldv_xmalloc_~res~5#1.base| v_ArrVal_29444))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26| v_ArrVal_29445))) (let ((.cse6 (store .cse4 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25| 1))) (let ((.cse3 (store (store .cse6 |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| 1))) (let ((.cse0 (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_ldv_xmalloc_~res~5#1.base| v_ArrVal_29442) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29465) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| ((as const (Array Int Int)) 0)) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29467))) (store .cse7 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26| (store (select .cse7 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0 v_ArrVal_29469)))) (.cse2 (+ |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| 1)) (.cse1 (store (store (store (store (store (store .cse3 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| v_ArrVal_29451) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| v_ArrVal_29452) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| v_ArrVal_29447) |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| v_ArrVal_29448) |v_ULTIMATE.start_ca91cx42_probe_~#__key___6~0#1.base_18| 1))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29471) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 1)) 0) (not (= (select (store .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| 1) |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_26|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| .cse2) (not (= (select .cse3 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18|) 0)) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| .cse2) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___4~0#1.base_18| .cse2) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___5~0#1.base_18| .cse2) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18| .cse2) (< 0 (select (store (store .cse3 |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___2~0#1.base_18| 1) |v_ULTIMATE.start_ca91cx42_probe_~#__key___3~0#1.base_18|)) (< 0 (select (select (store .cse0 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28| v_ArrVal_29473) |c_~#driver_name~0.base|) (+ |c_~#driver_name~0.offset| 3))) (<= |v_ULTIMATE.start_ca91cx42_probe_~#__key___1~0#1.base_18| .cse2) (not (= (select .cse4 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_25|) 0)) (<= |v_ULTIMATE.start_ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base_14| .cse2) (not (= (select .cse1 |v_ULTIMATE.start_ldv_calloc_#t~malloc728#1.base_28|) 0)) (not (= (select .cse5 |v_ULTIMATE.start_ldv_xmalloc_~tmp~88#1.base_26|) 0)) (not (= (select (store .cse6 |v_ULTIMATE.start_ca91cx42_probe_~#__key~1#1.base_18| v_ArrVal_29462) |v_ULTIMATE.start_ca91cx42_probe_~#__key___0~0#1.base_18|) 0))))))))) is different from false [2021-11-23 05:07:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1557 trivial. 5 not checked. [2021-11-23 05:07:13,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 05:07:13,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964455757] [2021-11-23 05:07:13,078 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 05:07:13,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693204181] [2021-11-23 05:07:13,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693204181] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 05:07:13,078 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 05:07:13,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37] total 70 [2021-11-23 05:07:13,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373043329] [2021-11-23 05:07:13,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 05:07:13,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2021-11-23 05:07:13,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 05:07:13,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-11-23 05:07:13,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1974, Unknown=77, NotChecked=2712, Total=4970 [2021-11-23 05:07:13,080 INFO L87 Difference]: Start difference. First operand 2579 states and 2885 transitions. Second operand has 71 states, 71 states have (on average 10.225352112676056) internal successors, (726), 70 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 05:07:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 05:07:41,383 INFO L93 Difference]: Finished difference Result 4985 states and 5580 transitions. [2021-11-23 05:07:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-23 05:07:41,383 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 10.225352112676056) internal successors, (726), 70 states have internal predecessors, (726), 0 states have call successors, (0), 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 820 [2021-11-23 05:07:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 05:07:41,386 INFO L225 Difference]: With dead ends: 4985 [2021-11-23 05:07:41,386 INFO L226 Difference]: Without dead ends: 2618 [2021-11-23 05:07:41,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1674 GetRequests, 1572 SyntacticMatches, 16 SemanticMatches, 86 ConstructedPredicates, 24 IntricatePredicates, 6 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=363, Invalid=3665, Unknown=100, NotChecked=3528, Total=7656 [2021-11-23 05:07:41,389 INFO L933 BasicCegarLoop]: 874 mSDtfsCounter, 343 mSDsluCounter, 39737 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 40611 SdHoareTripleChecker+Invalid, 7531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6782 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-11-23 05:07:41,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 40611 Invalid, 7531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 726 Invalid, 0 Unknown, 6782 Unchecked, 4.7s Time] [2021-11-23 05:07:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2021-11-23 05:07:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2581. [2021-11-23 05:07:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 2577 states have (on average 1.1202949165696547) internal successors, (2887), 2580 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 05:07:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 2887 transitions. [2021-11-23 05:07:42,125 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 2887 transitions. Word has length 820 [2021-11-23 05:07:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 05:07:42,125 INFO L470 AbstractCegarLoop]: Abstraction has 2581 states and 2887 transitions. [2021-11-23 05:07:42,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 10.225352112676056) internal successors, (726), 70 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 05:07:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 2887 transitions. [2021-11-23 05:07:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2021-11-23 05:07:42,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 05:07:42,130 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 05:07:42,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-11-23 05:07:42,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 05:07:42,331 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 05:07:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 05:07:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash -488596255, now seen corresponding path program 2 times [2021-11-23 05:07:42,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 05:07:42,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371538869] [2021-11-23 05:07:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 05:07:42,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 05:07:42,460 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 05:07:42,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218570711] [2021-11-23 05:07:42,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 05:07:42,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 05:07:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 05:07:42,462 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 05:07:42,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-23 05:07:48,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-23 05:07:48,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 05:07:48,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 5282 conjuncts, 120 conjunts are in the unsatisfiable core [2021-11-23 05:07:48,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 05:07:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2021-11-23 05:07:53,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 05:07:53,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 05:07:53,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371538869] [2021-11-23 05:07:53,935 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 05:07:53,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218570711] [2021-11-23 05:07:53,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218570711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 05:07:53,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 05:07:53,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-23 05:07:53,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565155497] [2021-11-23 05:07:53,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 05:07:53,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 05:07:53,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 05:07:53,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 05:07:53,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-23 05:07:53,937 INFO L87 Difference]: Start difference. First operand 2581 states and 2887 transitions. Second operand has 15 states, 15 states have (on average 28.733333333333334) internal successors, (431), 15 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 05:07:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 05:07:58,776 INFO L93 Difference]: Finished difference Result 8136 states and 9114 transitions. [2021-11-23 05:07:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-23 05:07:58,777 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 28.733333333333334) internal successors, (431), 15 states have internal predecessors, (431), 0 states have call successors, (0), 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 822 [2021-11-23 05:07:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 05:07:58,784 INFO L225 Difference]: With dead ends: 8136 [2021-11-23 05:07:58,784 INFO L226 Difference]: Without dead ends: 5769 [2021-11-23 05:07:58,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=541, Invalid=1265, Unknown=0, NotChecked=0, Total=1806 [2021-11-23 05:07:58,788 INFO L933 BasicCegarLoop]: 1459 mSDtfsCounter, 8538 mSDsluCounter, 7620 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8538 SdHoareTripleChecker+Valid, 9079 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-23 05:07:58,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8538 Valid, 9079 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-23 05:07:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2021-11-23 05:07:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 2593. [2021-11-23 05:07:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2589 states have (on average 1.1197373503283121) internal successors, (2899), 2592 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 05:07:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 2899 transitions. [2021-11-23 05:07:59,633 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 2899 transitions. Word has length 822 [2021-11-23 05:07:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 05:07:59,634 INFO L470 AbstractCegarLoop]: Abstraction has 2593 states and 2899 transitions. [2021-11-23 05:07:59,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.733333333333334) internal successors, (431), 15 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 05:07:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 2899 transitions. [2021-11-23 05:07:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2021-11-23 05:07:59,641 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 05:07:59,641 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 05:07:59,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-23 05:07:59,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-11-23 05:07:59,844 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 68 more)] === [2021-11-23 05:07:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 05:07:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1836706979, now seen corresponding path program 1 times [2021-11-23 05:07:59,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 05:07:59,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470061627] [2021-11-23 05:07:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 05:07:59,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 05:07:59,988 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 05:07:59,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244140562] [2021-11-23 05:07:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 05:07:59,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 05:07:59,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 05:07:59,989 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 05:07:59,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-23 05:08:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 05:08:03,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 9967 conjuncts, 211 conjunts are in the unsatisfiable core [2021-11-23 05:08:03,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 05:08:03,269 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 05:08:03,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2021-11-23 05:08:03,383 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 05:08:03,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 05:08:03,486 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 05:08:03,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 05:08:03,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 05:08:03,519 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 05:08:03,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 05:08:03,549 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 05:08:03,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-23 05:08:03,765 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-23 05:08:03,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-11-23 05:08:04,728 INFO L354 Elim1Store]: treesize reduction 1072, result has 16.1 percent of original size [2021-11-23 05:08:04,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 28 case distinctions, treesize of input 102 treesize of output 272 Killed by 15