./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 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/aws-c-common/aws_byte_buf_secure_zero_harness.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 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 12:24:53,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 12:24:53,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 12:24:53,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 12:24:53,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 12:24:53,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 12:24:53,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 12:24:53,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 12:24:53,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 12:24:53,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 12:24:53,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 12:24:53,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 12:24:53,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 12:24:53,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 12:24:53,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 12:24:53,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 12:24:53,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 12:24:53,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 12:24:53,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 12:24:53,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 12:24:53,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 12:24:53,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 12:24:53,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 12:24:53,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 12:24:53,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 12:24:53,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 12:24:53,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 12:24:53,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 12:24:53,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 12:24:53,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 12:24:53,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 12:24:53,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 12:24:53,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 12:24:53,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 12:24:53,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 12:24:53,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 12:24:53,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 12:24:53,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 12:24:53,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 12:24:53,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 12:24:53,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 12:24:53,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 12:24:54,011 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 12:24:54,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 12:24:54,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 12:24:54,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 12:24:54,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 12:24:54,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 12:24:54,018 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 12:24:54,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 12:24:54,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 12:24:54,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 12:24:54,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 12:24:54,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 12:24:54,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 12:24:54,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 12:24:54,020 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 12:24:54,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 12:24:54,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 12:24:54,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 12:24:54,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 12:24:54,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 12:24:54,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 12:24:54,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 12:24:54,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 12:24:54,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 12:24:54,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 12:24:54,030 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 12:24:54,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 12:24:54,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 12:24:54,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 12:24:54,030 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 -> 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 [2021-11-05 12:24:54,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 12:24:54,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 12:24:54,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 12:24:54,435 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 12:24:54,436 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 12:24:54,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-11-05 12:24:54,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7429476b/76b9cbc5a51a4dba8f6e204c84ee465b/FLAG4ac0c3376 [2021-11-05 12:24:55,389 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 12:24:55,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-11-05 12:24:55,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7429476b/76b9cbc5a51a4dba8f6e204c84ee465b/FLAG4ac0c3376 [2021-11-05 12:24:55,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7429476b/76b9cbc5a51a4dba8f6e204c84ee465b [2021-11-05 12:24:55,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 12:24:55,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 12:24:55,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 12:24:55,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 12:24:55,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 12:24:55,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 12:24:55" (1/1) ... [2021-11-05 12:24:55,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@affeec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:55, skipping insertion in model container [2021-11-05 12:24:55,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 12:24:55" (1/1) ... [2021-11-05 12:24:55,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 12:24:55,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 12:24:55,755 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i[4498,4511] [2021-11-05 12:24:55,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i[4558,4571] [2021-11-05 12:24:55,782 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 12:24:55,788 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 12:24:56,384 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,391 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,393 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,394 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,395 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,405 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,408 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,414 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,415 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,659 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 12:24:56,660 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 12:24:56,661 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 12:24:56,662 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 12:24:56,663 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 12:24:56,663 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 12:24:56,664 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 12:24:56,664 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 12:24:56,665 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 12:24:56,666 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 12:24:56,811 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 12:24:56,954 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:56,955 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 12:24:57,076 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 12:24:57,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i[4498,4511] [2021-11-05 12:24:57,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i[4558,4571] [2021-11-05 12:24:57,104 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 12:24:57,105 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 12:24:57,152 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,153 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,153 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,153 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,154 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,159 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,160 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,161 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,162 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,194 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 12:24:57,196 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 12:24:57,196 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 12:24:57,198 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 12:24:57,199 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 12:24:57,199 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 12:24:57,199 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 12:24:57,200 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 12:24:57,200 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 12:24:57,205 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 12:24:57,228 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 12:24:57,315 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,315 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:24:57,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 12:24:57,651 INFO L208 MainTranslator]: Completed translation [2021-11-05 12:24:57,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57 WrapperNode [2021-11-05 12:24:57,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 12:24:57,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 12:24:57,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 12:24:57,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 12:24:57,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 12:24:57,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 12:24:57,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 12:24:57,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 12:24:57,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 12:24:57,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 12:24:57,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 12:24:57,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 12:24:57,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (1/1) ... [2021-11-05 12:24:57,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 12:24:58,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:24:58,025 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-05 12:24:58,038 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-05 12:24:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 12:24:58,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 12:24:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 12:24:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 12:24:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 12:24:58,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 12:24:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 12:24:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 12:24:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 12:24:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 12:24:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 12:25:06,292 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 12:25:06,292 INFO L299 CfgBuilder]: Removed 59 assume(true) statements. [2021-11-05 12:25:06,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:25:06 BoogieIcfgContainer [2021-11-05 12:25:06,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 12:25:06,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 12:25:06,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 12:25:06,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 12:25:06,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 12:24:55" (1/3) ... [2021-11-05 12:25:06,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35699d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 12:25:06, skipping insertion in model container [2021-11-05 12:25:06,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:24:57" (2/3) ... [2021-11-05 12:25:06,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35699d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 12:25:06, skipping insertion in model container [2021-11-05 12:25:06,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:25:06" (3/3) ... [2021-11-05 12:25:06,301 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_secure_zero_harness.i [2021-11-05 12:25:06,304 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 12:25:06,304 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-05 12:25:06,345 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 12:25:06,358 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-05 12:25:06,358 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-05 12:25:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 112 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-05 12:25:06,393 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:06,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:25:06,395 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -158234594, now seen corresponding path program 1 times [2021-11-05 12:25:06,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:06,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270790434] [2021-11-05 12:25:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:06,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:25:07,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:07,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270790434] [2021-11-05 12:25:07,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270790434] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:07,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:07,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 12:25:07,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129679942] [2021-11-05 12:25:07,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:07,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-05 12:25:07,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-05 12:25:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 12:25:07,109 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 112 states have internal predecessors, (156), 0 states have call successors, (0), 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 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:07,152 INFO L93 Difference]: Finished difference Result 222 states and 307 transitions. [2021-11-05 12:25:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 12:25:07,155 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-05 12:25:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:07,165 INFO L225 Difference]: With dead ends: 222 [2021-11-05 12:25:07,166 INFO L226 Difference]: Without dead ends: 108 [2021-11-05 12:25:07,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 12:25:07,174 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.77ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:07,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 5.77ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 12:25:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-05 12:25:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-05 12:25:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 107 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-05 12:25:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 140 transitions. [2021-11-05 12:25:07,212 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 140 transitions. Word has length 29 [2021-11-05 12:25:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:07,212 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 140 transitions. [2021-11-05 12:25:07,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 140 transitions. [2021-11-05 12:25:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-05 12:25:07,214 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:07,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:25:07,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 12:25:07,215 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash -4552034, now seen corresponding path program 1 times [2021-11-05 12:25:07,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:07,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043911539] [2021-11-05 12:25:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:07,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:07,603 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-05 12:25:07,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:07,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043911539] [2021-11-05 12:25:07,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043911539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:07,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:07,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:25:07,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963959243] [2021-11-05 12:25:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:07,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:25:07,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:25:07,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:25:07,606 INFO L87 Difference]: Start difference. First operand 108 states and 140 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:07,755 INFO L93 Difference]: Finished difference Result 190 states and 246 transitions. [2021-11-05 12:25:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 12:25:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-05 12:25:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:07,759 INFO L225 Difference]: With dead ends: 190 [2021-11-05 12:25:07,759 INFO L226 Difference]: Without dead ends: 108 [2021-11-05 12:25:07,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.65ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:25:07,760 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 123 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.05ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 129.25ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:07,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 177 Invalid, 28 Unknown, 0 Unchecked, 3.05ms Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 129.25ms Time] [2021-11-05 12:25:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-05 12:25:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-05 12:25:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 107 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2021-11-05 12:25:07,772 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 29 [2021-11-05 12:25:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:07,773 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2021-11-05 12:25:07,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2021-11-05 12:25:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-05 12:25:07,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:07,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:25:07,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 12:25:07,776 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:07,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1058096316, now seen corresponding path program 1 times [2021-11-05 12:25:07,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:07,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929694304] [2021-11-05 12:25:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:07,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:08,102 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-05 12:25:08,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:08,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929694304] [2021-11-05 12:25:08,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929694304] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:08,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:08,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:25:08,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738222277] [2021-11-05 12:25:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:08,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:25:08,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:25:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:25:08,105 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:08,444 INFO L93 Difference]: Finished difference Result 231 states and 298 transitions. [2021-11-05 12:25:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:25:08,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-05 12:25:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:08,446 INFO L225 Difference]: With dead ends: 231 [2021-11-05 12:25:08,446 INFO L226 Difference]: Without dead ends: 148 [2021-11-05 12:25:08,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.47ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:25:08,448 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 89 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 255.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.46ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 294.84ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:08,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 360 Invalid, 80 Unknown, 0 Unchecked, 4.46ms Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 294.84ms Time] [2021-11-05 12:25:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-05 12:25:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2021-11-05 12:25:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 115 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2021-11-05 12:25:08,457 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 41 [2021-11-05 12:25:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:08,457 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2021-11-05 12:25:08,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2021-11-05 12:25:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-05 12:25:08,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:08,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:25:08,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 12:25:08,459 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash 996056702, now seen corresponding path program 1 times [2021-11-05 12:25:08,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:08,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885188172] [2021-11-05 12:25:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:08,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:08,944 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-05 12:25:08,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:08,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885188172] [2021-11-05 12:25:08,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885188172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:08,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:08,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:25:08,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229137055] [2021-11-05 12:25:08,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:08,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:25:08,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:08,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:25:08,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:25:08,946 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:09,234 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2021-11-05 12:25:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 12:25:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-05 12:25:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:09,236 INFO L225 Difference]: With dead ends: 156 [2021-11-05 12:25:09,236 INFO L226 Difference]: Without dead ends: 116 [2021-11-05 12:25:09,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 291.22ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:25:09,237 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 537 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 112.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.49ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.58ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:09,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 205 Invalid, 38 Unknown, 0 Unchecked, 2.49ms Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 121.58ms Time] [2021-11-05 12:25:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-05 12:25:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-11-05 12:25:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 115 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2021-11-05 12:25:09,245 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 41 [2021-11-05 12:25:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:09,245 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2021-11-05 12:25:09,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2021-11-05 12:25:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-05 12:25:09,247 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:09,247 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-05 12:25:09,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 12:25:09,248 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1931250963, now seen corresponding path program 1 times [2021-11-05 12:25:09,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:09,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430306162] [2021-11-05 12:25:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:09,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:09,908 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-05 12:25:09,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:09,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430306162] [2021-11-05 12:25:09,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430306162] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:09,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:09,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:25:09,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327748042] [2021-11-05 12:25:09,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:09,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:25:09,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:25:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:25:09,910 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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-05 12:25:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:10,585 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2021-11-05 12:25:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 12:25:10,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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-05 12:25:10,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:10,587 INFO L225 Difference]: With dead ends: 184 [2021-11-05 12:25:10,588 INFO L226 Difference]: Without dead ends: 180 [2021-11-05 12:25:10,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 285.48ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:25:10,589 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 150 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 423.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.62ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 489.95ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:10,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 505 Invalid, 127 Unknown, 0 Unchecked, 4.62ms Time], IncrementalHoareTripleChecker [28 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 489.95ms Time] [2021-11-05 12:25:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-05 12:25:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 124. [2021-11-05 12:25:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 120 states have (on average 1.2666666666666666) internal successors, (152), 123 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2021-11-05 12:25:10,602 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 47 [2021-11-05 12:25:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:10,602 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2021-11-05 12:25:10,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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-05 12:25:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2021-11-05 12:25:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-05 12:25:10,607 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:10,608 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-05 12:25:10,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 12:25:10,608 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1524322635, now seen corresponding path program 1 times [2021-11-05 12:25:10,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:10,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806785767] [2021-11-05 12:25:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:10,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:25:11,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:11,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806785767] [2021-11-05 12:25:11,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806785767] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:11,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:11,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:25:11,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671899314] [2021-11-05 12:25:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:11,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:25:11,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:25:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:25:11,115 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-05 12:25:13,207 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:13,737 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2021-11-05 12:25:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 12:25:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-05 12:25:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:13,738 INFO L225 Difference]: With dead ends: 177 [2021-11-05 12:25:13,738 INFO L226 Difference]: Without dead ends: 131 [2021-11-05 12:25:13,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 146.02ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:25:13,740 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 42 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2421.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.01ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2511.74ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:13,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 411 Invalid, 105 Unknown, 0 Unchecked, 3.01ms Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 1 Unknown, 0 Unchecked, 2511.74ms Time] [2021-11-05 12:25:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-05 12:25:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2021-11-05 12:25:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 125 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2021-11-05 12:25:13,749 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 51 [2021-11-05 12:25:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:13,750 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2021-11-05 12:25:13,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-05 12:25:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2021-11-05 12:25:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-05 12:25:13,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:13,751 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-05 12:25:13,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 12:25:13,751 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2090586291, now seen corresponding path program 1 times [2021-11-05 12:25:13,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:13,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932683805] [2021-11-05 12:25:13,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:13,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:16,321 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-05 12:25:16,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:16,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932683805] [2021-11-05 12:25:16,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932683805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:16,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:16,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:25:16,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126802458] [2021-11-05 12:25:16,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:16,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:25:16,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:25:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:25:16,323 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 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-05 12:25:18,379 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:19,429 INFO L93 Difference]: Finished difference Result 249 states and 305 transitions. [2021-11-05 12:25:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-05 12:25:19,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 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-05 12:25:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:19,430 INFO L225 Difference]: With dead ends: 249 [2021-11-05 12:25:19,430 INFO L226 Difference]: Without dead ends: 150 [2021-11-05 12:25:19,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 665.43ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-05 12:25:19,432 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 575 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2557.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.22ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2658.24ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:19,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 441 Invalid, 178 Unknown, 0 Unchecked, 5.22ms Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 1 Unknown, 0 Unchecked, 2658.24ms Time] [2021-11-05 12:25:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-05 12:25:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2021-11-05 12:25:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2021-11-05 12:25:19,455 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 51 [2021-11-05 12:25:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:19,455 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2021-11-05 12:25:19,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 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-05 12:25:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2021-11-05 12:25:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-05 12:25:19,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:19,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:25:19,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 12:25:19,460 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:19,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:19,462 INFO L85 PathProgramCache]: Analyzing trace with hash -122386677, now seen corresponding path program 1 times [2021-11-05 12:25:19,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:19,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413051861] [2021-11-05 12:25:19,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:19,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:20,270 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-05 12:25:20,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:20,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413051861] [2021-11-05 12:25:20,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413051861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:20,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:20,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-05 12:25:20,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640134030] [2021-11-05 12:25:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:20,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 12:25:20,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:20,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 12:25:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:25:20,272 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:22,333 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:24,454 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:26,386 INFO L93 Difference]: Finished difference Result 361 states and 446 transitions. [2021-11-05 12:25:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-05 12:25:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-05 12:25:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:26,388 INFO L225 Difference]: With dead ends: 361 [2021-11-05 12:25:26,388 INFO L226 Difference]: Without dead ends: 256 [2021-11-05 12:25:26,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 670.62ms TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-05 12:25:26,390 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 632 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5415.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.94ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5739.11ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:26,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [632 Valid, 816 Invalid, 493 Unknown, 0 Unchecked, 9.94ms Time], IncrementalHoareTripleChecker [44 Valid, 447 Invalid, 2 Unknown, 0 Unchecked, 5739.11ms Time] [2021-11-05 12:25:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-05 12:25:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 145. [2021-11-05 12:25:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 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-05 12:25:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 175 transitions. [2021-11-05 12:25:26,397 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 175 transitions. Word has length 59 [2021-11-05 12:25:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:26,398 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 175 transitions. [2021-11-05 12:25:26,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 175 transitions. [2021-11-05 12:25:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-05 12:25:26,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:26,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:25:26,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 12:25:26,399 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:26,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1263816717, now seen corresponding path program 1 times [2021-11-05 12:25:26,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:26,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514433504] [2021-11-05 12:25:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:26,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:26,945 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-05 12:25:26,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:26,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514433504] [2021-11-05 12:25:26,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514433504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:26,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:26,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:25:26,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712510821] [2021-11-05 12:25:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:26,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:25:26,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:25:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:25:26,947 INFO L87 Difference]: Start difference. First operand 145 states and 175 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:27,662 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2021-11-05 12:25:27,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 12:25:27,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-05 12:25:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:27,663 INFO L225 Difference]: With dead ends: 291 [2021-11-05 12:25:27,664 INFO L226 Difference]: Without dead ends: 174 [2021-11-05 12:25:27,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 271.19ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:25:27,665 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 64 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 526.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.76ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 563.76ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:27,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 724 Invalid, 174 Unknown, 0 Unchecked, 3.76ms Time], IncrementalHoareTripleChecker [22 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 563.76ms Time] [2021-11-05 12:25:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-05 12:25:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2021-11-05 12:25:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 144 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2021-11-05 12:25:27,673 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 59 [2021-11-05 12:25:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:27,674 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2021-11-05 12:25:27,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2021-11-05 12:25:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-05 12:25:27,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:27,675 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-05 12:25:27,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 12:25:27,675 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash 907824687, now seen corresponding path program 1 times [2021-11-05 12:25:27,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:27,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402934423] [2021-11-05 12:25:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:27,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:28,333 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-05 12:25:28,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:28,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402934423] [2021-11-05 12:25:28,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402934423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:28,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:28,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:25:28,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348111986] [2021-11-05 12:25:28,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:28,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:25:28,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:25:28,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:25:28,334 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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-05 12:25:30,392 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:32,509 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:34,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:37,008 INFO L93 Difference]: Finished difference Result 365 states and 429 transitions. [2021-11-05 12:25:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-05 12:25:37,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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-05 12:25:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:37,011 INFO L225 Difference]: With dead ends: 365 [2021-11-05 12:25:37,012 INFO L226 Difference]: Without dead ends: 229 [2021-11-05 12:25:37,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 911.97ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-11-05 12:25:37,013 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 292 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 52 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7437.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.06ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7949.44ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:37,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 568 Invalid, 440 Unknown, 0 Unchecked, 9.06ms Time], IncrementalHoareTripleChecker [52 Valid, 385 Invalid, 3 Unknown, 0 Unchecked, 7949.44ms Time] [2021-11-05 12:25:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-05 12:25:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 138. [2021-11-05 12:25:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 137 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2021-11-05 12:25:37,020 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 63 [2021-11-05 12:25:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:37,020 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2021-11-05 12:25:37,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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-05 12:25:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2021-11-05 12:25:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-05 12:25:37,021 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:37,022 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-05 12:25:37,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 12:25:37,022 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:37,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1732937233, now seen corresponding path program 1 times [2021-11-05 12:25:37,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:37,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086217039] [2021-11-05 12:25:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:37,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:37,412 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-05 12:25:37,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:37,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086217039] [2021-11-05 12:25:37,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086217039] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:37,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:37,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:25:37,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276078689] [2021-11-05 12:25:37,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:37,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:25:37,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:37,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:25:37,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:25:37,413 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-05 12:25:39,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:41,703 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:42,435 INFO L93 Difference]: Finished difference Result 301 states and 341 transitions. [2021-11-05 12:25:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 12:25:42,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-05 12:25:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:42,437 INFO L225 Difference]: With dead ends: 301 [2021-11-05 12:25:42,437 INFO L226 Difference]: Without dead ends: 175 [2021-11-05 12:25:42,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 133.35ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:25:42,438 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 130 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4535.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.11ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4928.72ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:42,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 309 Invalid, 156 Unknown, 0 Unchecked, 3.11ms Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 4928.72ms Time] [2021-11-05 12:25:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-05 12:25:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 134. [2021-11-05 12:25:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.1615384615384616) internal successors, (151), 133 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-05 12:25:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2021-11-05 12:25:42,443 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 63 [2021-11-05 12:25:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:42,443 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2021-11-05 12:25:42,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-05 12:25:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2021-11-05 12:25:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-05 12:25:42,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:42,444 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-05 12:25:42,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 12:25:42,445 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 354357871, now seen corresponding path program 1 times [2021-11-05 12:25:42,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:42,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137355484] [2021-11-05 12:25:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:42,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:43,277 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-05 12:25:43,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:43,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137355484] [2021-11-05 12:25:43,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137355484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:43,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:43,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-05 12:25:43,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462565588] [2021-11-05 12:25:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:43,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 12:25:43,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:43,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 12:25:43,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:25:43,278 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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-05 12:25:45,337 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:47,446 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:49,564 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:51,799 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:53,934 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:25:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:25:55,599 INFO L93 Difference]: Finished difference Result 353 states and 399 transitions. [2021-11-05 12:25:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-05 12:25:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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-05 12:25:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:25:55,600 INFO L225 Difference]: With dead ends: 353 [2021-11-05 12:25:55,601 INFO L226 Difference]: Without dead ends: 259 [2021-11-05 12:25:55,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 835.15ms TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-11-05 12:25:55,602 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 472 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 41 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11140.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.93ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11768.59ms IncrementalHoareTripleChecker+Time [2021-11-05 12:25:55,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 529 Invalid, 325 Unknown, 0 Unchecked, 4.93ms Time], IncrementalHoareTripleChecker [41 Valid, 279 Invalid, 5 Unknown, 0 Unchecked, 11768.59ms Time] [2021-11-05 12:25:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-05 12:25:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 208. [2021-11-05 12:25:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 204 states have (on average 1.1519607843137254) internal successors, (235), 207 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:25:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 235 transitions. [2021-11-05 12:25:55,610 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 235 transitions. Word has length 63 [2021-11-05 12:25:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:25:55,610 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 235 transitions. [2021-11-05 12:25:55,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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-05 12:25:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 235 transitions. [2021-11-05 12:25:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-05 12:25:55,611 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:25:55,612 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-05 12:25:55,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 12:25:55,612 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:25:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:25:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash 213809261, now seen corresponding path program 1 times [2021-11-05 12:25:55,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:25:55,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214281817] [2021-11-05 12:25:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:25:55,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:25:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:25:58,067 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-05 12:25:58,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:25:58,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214281817] [2021-11-05 12:25:58,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214281817] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:25:58,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:25:58,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:25:58,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825202834] [2021-11-05 12:25:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:25:58,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:25:58,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:25:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:25:58,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:25:58,069 INFO L87 Difference]: Start difference. First operand 208 states and 235 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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-05 12:26:00,132 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:26:02,257 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:26:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:26:02,773 INFO L93 Difference]: Finished difference Result 411 states and 467 transitions. [2021-11-05 12:26:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 12:26:02,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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-05 12:26:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:26:02,775 INFO L225 Difference]: With dead ends: 411 [2021-11-05 12:26:02,776 INFO L226 Difference]: Without dead ends: 291 [2021-11-05 12:26:02,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 377.47ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:26:02,776 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 348 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4263.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4532.60ms IncrementalHoareTripleChecker+Time [2021-11-05 12:26:02,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 383 Invalid, 70 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 2 Unknown, 0 Unchecked, 4532.60ms Time] [2021-11-05 12:26:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-05 12:26:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 208. [2021-11-05 12:26:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 204 states have (on average 1.142156862745098) internal successors, (233), 207 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:26:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 233 transitions. [2021-11-05 12:26:02,789 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 233 transitions. Word has length 63 [2021-11-05 12:26:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:26:02,789 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 233 transitions. [2021-11-05 12:26:02,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 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-05 12:26:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 233 transitions. [2021-11-05 12:26:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-05 12:26:02,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:26:02,790 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-05 12:26:02,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 12:26:02,791 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:26:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:26:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash 694910338, now seen corresponding path program 1 times [2021-11-05 12:26:02,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:26:02,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240933445] [2021-11-05 12:26:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:26:02,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:26:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:26:07,539 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-05 12:26:07,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:26:07,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240933445] [2021-11-05 12:26:07,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240933445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:26:07,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:26:07,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:26:07,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238118618] [2021-11-05 12:26:07,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:26:07,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:26:07,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:26:07,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:26:07,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:26:07,541 INFO L87 Difference]: Start difference. First operand 208 states and 233 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-05 12:26:09,602 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:26:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:26:10,925 INFO L93 Difference]: Finished difference Result 401 states and 451 transitions. [2021-11-05 12:26:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-05 12:26:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-05 12:26:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:26:10,927 INFO L225 Difference]: With dead ends: 401 [2021-11-05 12:26:10,927 INFO L226 Difference]: Without dead ends: 273 [2021-11-05 12:26:10,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 938.28ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-11-05 12:26:10,928 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 443 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2570.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.95ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2746.01ms IncrementalHoareTripleChecker+Time [2021-11-05 12:26:10,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 324 Invalid, 161 Unknown, 0 Unchecked, 2.95ms Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 1 Unknown, 0 Unchecked, 2746.01ms Time] [2021-11-05 12:26:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-05 12:26:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 208. [2021-11-05 12:26:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 204 states have (on average 1.1323529411764706) internal successors, (231), 207 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:26:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions. [2021-11-05 12:26:10,938 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 69 [2021-11-05 12:26:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:26:10,939 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions. [2021-11-05 12:26:10,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-05 12:26:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions. [2021-11-05 12:26:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-05 12:26:10,940 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:26:10,940 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] [2021-11-05 12:26:10,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 12:26:10,940 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:26:10,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:26:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash 448544190, now seen corresponding path program 1 times [2021-11-05 12:26:10,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:26:10,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911749719] [2021-11-05 12:26:10,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:26:10,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:26:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:26:11,244 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-05 12:26:11,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:26:11,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911749719] [2021-11-05 12:26:11,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911749719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:26:11,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:26:11,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 12:26:11,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011427486] [2021-11-05 12:26:11,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:26:11,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 12:26:11,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:26:11,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 12:26:11,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 12:26:11,246 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:26:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:26:11,278 INFO L93 Difference]: Finished difference Result 292 states and 326 transitions. [2021-11-05 12:26:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 12:26:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-11-05 12:26:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:26:11,280 INFO L225 Difference]: With dead ends: 292 [2021-11-05 12:26:11,280 INFO L226 Difference]: Without dead ends: 164 [2021-11-05 12:26:11,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.63ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 12:26:11,281 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.22ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.43ms IncrementalHoareTripleChecker+Time [2021-11-05 12:26:11,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 239 Invalid, 6 Unknown, 0 Unchecked, 0.22ms Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 26.43ms Time] [2021-11-05 12:26:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-05 12:26:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2021-11-05 12:26:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 151 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:26:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-11-05 12:26:11,290 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 70 [2021-11-05 12:26:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:26:11,290 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-11-05 12:26:11,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:26:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-11-05 12:26:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-05 12:26:11,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:26:11,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 12:26:11,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 12:26:11,292 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:26:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:26:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 484257116, now seen corresponding path program 1 times [2021-11-05 12:26:11,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:26:11,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158483554] [2021-11-05 12:26:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:26:11,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:26:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:26:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:26:15,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:26:15,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158483554] [2021-11-05 12:26:15,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158483554] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 12:26:15,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824137833] [2021-11-05 12:26:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:26:15,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:26:15,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:26:15,643 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-05 12:26:15,646 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-05 12:26:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:26:16,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 2906 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-05 12:26:16,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 12:26:17,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2021-11-05 12:26:18,822 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 21 treesize of output 9 [2021-11-05 12:26:19,364 INFO L354 Elim1Store]: treesize reduction 168, result has 18.0 percent of original size [2021-11-05 12:26:19,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 157 [2021-11-05 12:26:19,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:26:19,487 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 38 treesize of output 23 [2021-11-05 12:26:19,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:26:19,586 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 38 treesize of output 23 [2021-11-05 12:26:19,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:26:19,759 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 39 treesize of output 25 [2021-11-05 12:26:19,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:26:19,847 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 39 treesize of output 25 [2021-11-05 12:26:20,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:26:20,104 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 105 treesize of output 78 [2021-11-05 12:26:20,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:26:20,205 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 67 treesize of output 40 [2021-11-05 12:26:20,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:26:20,965 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 91 treesize of output 47 [2021-11-05 12:26:21,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:26:21,367 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 150 treesize of output 98 [2021-11-05 12:26:48,870 INFO L354 Elim1Store]: treesize reduction 318, result has 12.9 percent of original size [2021-11-05 12:26:48,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 381 treesize of output 243 [2021-11-05 12:26:53,395 INFO L354 Elim1Store]: treesize reduction 134, result has 43.0 percent of original size [2021-11-05 12:26:53,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 402 treesize of output 303 [2021-11-05 12:26:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:26:54,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 12:26:58,929 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base (store (select |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base (store (select |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)) 18446744073709551615))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse2 (select (store (select (store |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base (store (select |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse3 (select (store (select (store |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base (store (select |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))))))) is different from false [2021-11-05 12:27:04,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_4 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse0 (- 1)) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))))) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse2 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse3 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse3 (+ (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616)) 18446744073709551615))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0)))) (< c_ULTIMATE.start_memset_impl_~s.base v_ULTIMATE.start_memset_impl_~sp~0.base_4))) is different from false [2021-11-05 12:27:13,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_4 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse0 (- 1)) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))))) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse2 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse3 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse3 (+ (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616)) 18446744073709551615))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0)))) (< (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 8)) v_ULTIMATE.start_memset_impl_~sp~0.base_4))) is different from false [2021-11-05 12:28:20,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_4 Int)) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 8)) v_ULTIMATE.start_memset_impl_~sp~0.base_4) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse0 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse2 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse3 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0)))))) is different from false [2021-11-05 12:29:19,008 INFO L354 Elim1Store]: treesize reduction 108, result has 60.7 percent of original size [2021-11-05 12:29:19,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 306 treesize of output 342 [2021-11-05 12:29:19,083 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:29:19,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 342 treesize of output 358 [2021-11-05 12:29:19,151 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:29:19,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 358 treesize of output 374 [2021-11-05 12:29:19,225 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:29:19,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 374 treesize of output 390 [2021-11-05 12:29:19,314 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:29:19,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 390 treesize of output 406 [2021-11-05 12:29:20,104 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 21 treesize of output 15 [2021-11-05 12:29:20,409 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 12 treesize of output 8 [2021-11-05 12:29:22,467 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 12 treesize of output 8 [2021-11-05 12:29:22,873 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 12 treesize of output 8 [2021-11-05 12:29:50,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:29:50,896 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 19 treesize of output 11 [2021-11-05 12:29:51,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:29:51,293 INFO L354 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2021-11-05 12:29:51,294 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 41 treesize of output 36 [2021-11-05 12:29:51,517 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 21 treesize of output 15 [2021-11-05 12:29:52,118 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 21 treesize of output 15 [2021-11-05 12:29:52,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:29:52,979 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:29:52,980 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 1074 treesize of output 1014 [2021-11-05 12:32:29,358 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 12 treesize of output 8 [2021-11-05 12:32:29,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:32:29,610 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 19 treesize of output 11 [2021-11-05 12:32:29,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:32:29,754 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:32:29,754 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 48 treesize of output 48 [2021-11-05 12:32:31,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:32:31,361 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 19 treesize of output 11 [2021-11-05 12:32:32,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:32:32,210 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 19 treesize of output 11 [2021-11-05 12:32:36,316 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 12 treesize of output 8 [2021-11-05 12:32:46,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:32:46,139 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 19 treesize of output 11 [2021-11-05 12:32:46,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:32:46,230 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:32:46,230 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 32 treesize of output 32 [2021-11-05 12:32:46,524 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 12 treesize of output 8 [2021-11-05 12:32:47,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:32:47,320 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 19 treesize of output 11 [2021-11-05 12:32:47,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:32:47,634 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 19 treesize of output 11 [2021-11-05 12:32:48,458 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 12 treesize of output 8 [2021-11-05 12:32:49,232 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 12 treesize of output 8 [2021-11-05 12:32:57,311 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 68 treesize of output 44 [2021-11-05 12:32:57,817 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 30 treesize of output 18 [2021-11-05 12:32:59,111 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 96 treesize of output 68 [2021-11-05 12:33:03,964 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 84 treesize of output 60 [2021-11-05 12:33:04,948 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 56 treesize of output 36 [2021-11-05 12:33:06,049 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 284 treesize of output 236 [2021-11-05 12:33:07,745 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 42 treesize of output 26 [2021-11-05 12:33:09,058 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 160 treesize of output 128 [2021-11-05 12:33:42,993 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:33:42,994 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 1940 treesize of output 1648 [2021-11-05 12:34:04,517 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:34:04,518 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 1096 treesize of output 979 [2021-11-05 12:34:17,938 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:34:17,938 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 1083 treesize of output 735 [2021-11-05 12:34:26,349 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 38 treesize of output 32 [2021-11-05 12:34:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-05 12:34:26,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824137833] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 12:34:26,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 12:34:26,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2021-11-05 12:34:26,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677035524] [2021-11-05 12:34:26,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 12:34:26,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-05 12:34:26,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:34:26,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-05 12:34:26,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=947, Unknown=5, NotChecked=260, Total=1332 [2021-11-05 12:34:26,993 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 37 states, 37 states have (on average 5.0) internal successors, (185), 37 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:29,050 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:31,177 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:33,335 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:35,456 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:37,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:39,804 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:41,933 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:44,050 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:46,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:34:49,331 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)) 18446744073709551616) 0))) (let ((.cse0 (not .cse3)) (.cse2 (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short680|))) (and (= |c_ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse0 (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| c_ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base| c_ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) 8) 0) (let ((.cse1 (select (select |c_#memory_int| c_ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ 16 c_ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (< (+ |c_ULTIMATE.start_bounded_malloc_#res.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (or (and .cse0 .cse2) (and .cse3 |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short680|)) .cse2 (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_4 Int)) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 8)) v_ULTIMATE.start_memset_impl_~sp~0.base_4) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse4 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616))))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse5 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse5) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse6 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse7 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse7 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0))))))))) is different from false [2021-11-05 12:34:51,352 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)) 18446744073709551616) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) 8) 0) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_4 Int)) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 8)) v_ULTIMATE.start_memset_impl_~sp~0.base_4) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse0 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse2 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse3 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 16)))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0))))))) is different from false [2021-11-05 12:34:53,365 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 8))) (and (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) .cse0) 0) (= c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_4 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (- 1)) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse2 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616)))))))) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse3 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse4 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse4 (+ (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616)) 18446744073709551615))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0)))) (< (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 8)) v_ULTIMATE.start_memset_impl_~sp~0.base_4))) (not (= 0 (mod (select (select |c_#memory_int| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)) 18446744073709551616))) (< (+ (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) .cse0) 1) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base))) is different from false [2021-11-05 12:34:55,390 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (and (= .cse0 c_ULTIMATE.start_memset_impl_~n) (< (+ 1 c_ULTIMATE.start_memset_impl_~s.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (= c_ULTIMATE.start_memset_impl_~s.offset 0) (not (= 0 (mod .cse0 18446744073709551616))) (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_4 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (- 1)) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (let ((.cse2 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616)))))))) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse3 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse4 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_4) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse4 (+ (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616)) 18446744073709551615))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0)))) (< c_ULTIMATE.start_memset_impl_~s.base v_ULTIMATE.start_memset_impl_~sp~0.base_4))))) is different from false [2021-11-05 12:34:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:34:59,069 INFO L93 Difference]: Finished difference Result 248 states and 272 transitions. [2021-11-05 12:34:59,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-05 12:34:59,070 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.0) internal successors, (185), 37 states have internal predecessors, (185), 0 states have call successors, (0), 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-05 12:34:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:34:59,071 INFO L225 Difference]: With dead ends: 248 [2021-11-05 12:34:59,071 INFO L226 Difference]: Without dead ends: 182 [2021-11-05 12:34:59,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 28663.59ms TimeCoverageRelationStatistics Valid=217, Invalid=1365, Unknown=10, NotChecked=664, Total=2256 [2021-11-05 12:34:59,073 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 86 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 8 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18909.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.31ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 20156.31ms IncrementalHoareTripleChecker+Time [2021-11-05 12:34:59,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 1341 Invalid, 621 Unknown, 0 Unchecked, 7.31ms Time], IncrementalHoareTripleChecker [8 Valid, 229 Invalid, 9 Unknown, 375 Unchecked, 20156.31ms Time] [2021-11-05 12:34:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-05 12:34:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2021-11-05 12:34:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 168 states have (on average 1.1130952380952381) internal successors, (187), 171 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2021-11-05 12:34:59,082 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 72 [2021-11-05 12:34:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:34:59,083 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2021-11-05 12:34:59,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.0) internal successors, (185), 37 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:34:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2021-11-05 12:34:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-05 12:34:59,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:34:59,084 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-05 12:34:59,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-05 12:34:59,311 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,SelfDestructingSolverStorable15 [2021-11-05 12:34:59,312 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:34:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:34:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash -268694696, now seen corresponding path program 1 times [2021-11-05 12:34:59,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:34:59,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223217475] [2021-11-05 12:34:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:34:59,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:34:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:34:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-05 12:34:59,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:34:59,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223217475] [2021-11-05 12:34:59,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223217475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:34:59,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:34:59,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:34:59,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456327992] [2021-11-05 12:34:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:34:59,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:34:59,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:34:59,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:34:59,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:34:59,730 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05 12:35:01,823 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:03,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:35:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:35:04,619 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2021-11-05 12:35:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:35:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05 12:35:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:35:04,621 INFO L225 Difference]: With dead ends: 256 [2021-11-05 12:35:04,621 INFO L226 Difference]: Without dead ends: 201 [2021-11-05 12:35:04,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 108.90ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:35:04,622 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 79 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4536.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.77ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4837.68ms IncrementalHoareTripleChecker+Time [2021-11-05 12:35:04,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 349 Invalid, 128 Unknown, 0 Unchecked, 2.77ms Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 2 Unknown, 0 Unchecked, 4837.68ms Time] [2021-11-05 12:35:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-11-05 12:35:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 172. [2021-11-05 12:35:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:35:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2021-11-05 12:35:04,631 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 72 [2021-11-05 12:35:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:35:04,632 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2021-11-05 12:35:04,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05 12:35:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2021-11-05 12:35:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-05 12:35:04,632 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:35:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 12:35:04,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 12:35:04,633 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:35:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:35:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash 506655004, now seen corresponding path program 1 times [2021-11-05 12:35:04,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:35:04,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370074938] [2021-11-05 12:35:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:35:04,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:35:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:35:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:35:09,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:35:09,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370074938] [2021-11-05 12:35:09,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370074938] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 12:35:09,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605958748] [2021-11-05 12:35:09,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:35:09,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:35:09,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:35:09,914 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-05 12:35:09,918 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-05 12:35:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:35:10,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 2916 conjuncts, 77 conjunts are in the unsatisfiable core [2021-11-05 12:35:10,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 12:35:11,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2021-11-05 12:35:12,351 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 21 treesize of output 9 [2021-11-05 12:35:12,833 INFO L354 Elim1Store]: treesize reduction 168, result has 18.0 percent of original size [2021-11-05 12:35:12,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 157 [2021-11-05 12:35:12,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:12,890 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 38 treesize of output 24 [2021-11-05 12:35:12,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:12,973 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 38 treesize of output 24 [2021-11-05 12:35:13,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:13,168 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 40 treesize of output 26 [2021-11-05 12:35:13,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:13,250 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 40 treesize of output 26 [2021-11-05 12:35:13,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:13,473 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 106 treesize of output 79 [2021-11-05 12:35:13,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:13,555 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 66 treesize of output 39 [2021-11-05 12:35:13,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:13,856 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 153 treesize of output 90 [2021-11-05 12:35:15,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:35:15,494 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 98 treesize of output 50 [2021-11-05 12:35:45,543 INFO L354 Elim1Store]: treesize reduction 318, result has 12.9 percent of original size [2021-11-05 12:35:45,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 379 treesize of output 243 [2021-11-05 12:35:50,350 INFO L354 Elim1Store]: treesize reduction 134, result has 43.0 percent of original size [2021-11-05 12:35:50,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 400 treesize of output 303 [2021-11-05 12:35:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:35:51,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 12:36:06,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_6 Int)) (or (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0))) (< c_ULTIMATE.start_memset_impl_~s.base v_ULTIMATE.start_memset_impl_~sp~0.base_6))) is different from false [2021-11-05 12:36:10,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_6 Int) (aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 8)) v_ULTIMATE.start_memset_impl_~sp~0.base_6) (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0))) is different from false [2021-11-05 12:36:35,198 INFO L354 Elim1Store]: treesize reduction 52, result has 61.2 percent of original size [2021-11-05 12:36:35,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 175 [2021-11-05 12:36:35,304 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:36:35,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 175 treesize of output 191 [2021-11-05 12:36:35,404 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:36:35,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 191 treesize of output 207 [2021-11-05 12:36:35,943 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 12 treesize of output 8 [2021-11-05 12:36:39,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:36:39,047 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 19 treesize of output 11 [2021-11-05 12:36:45,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:36:45,311 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 19 treesize of output 11 [2021-11-05 12:36:45,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:36:45,836 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:36:45,837 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 144 treesize of output 132 [2021-11-05 12:36:50,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:36:50,968 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:36:50,968 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 76 treesize of output 76 [2021-11-05 12:36:51,490 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 58 treesize of output 42 [2021-11-05 12:36:51,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:36:51,750 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-11-05 12:36:51,750 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 101 treesize of output 76 [2021-11-05 12:36:52,054 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 58 treesize of output 42 [2021-11-05 12:36:52,492 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 42 treesize of output 26 [2021-11-05 12:36:53,048 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 30 treesize of output 18 [2021-11-05 12:36:53,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:36:53,092 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-05 12:36:53,353 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 30 treesize of output 18 [2021-11-05 12:36:53,788 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 12 treesize of output 8 [2021-11-05 12:36:53,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:36:53,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:36:53,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-11-05 12:36:53,979 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-05 12:36:59,758 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:36:59,758 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 479 treesize of output 445 [2021-11-05 12:37:02,173 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:37:02,173 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 174 treesize of output 154 [2021-11-05 12:37:03,767 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 38 treesize of output 32 [2021-11-05 12:37:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:37:04,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605958748] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 12:37:04,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 12:37:04,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2021-11-05 12:37:04,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407924540] [2021-11-05 12:37:04,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 12:37:04,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-05 12:37:04,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:37:04,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-05 12:37:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1021, Unknown=3, NotChecked=130, Total=1260 [2021-11-05 12:37:04,452 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 36 states, 36 states have (on average 5.138888888888889) internal successors, (185), 36 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:37:06,524 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:08,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:10,833 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:12,974 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:15,087 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:17,186 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:19,307 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:21,417 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:23,573 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:25,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:27,843 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:31,708 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= 0 (mod (select (select |c_#memory_int| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)) 18446744073709551616)))) (let ((.cse0 (not .cse2)) (.cse1 (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short680|))) (and (= c_ULTIMATE.start_aws_byte_buf_is_valid_~buf.base c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset c_ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (or (and .cse0 .cse1) (and |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short680| .cse2)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base| c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) .cse0 (let ((.cse3 (select (select |c_#memory_int| c_ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ 16 c_ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (+ |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 8)) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (< (+ (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 8)) 1) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.offset| 0) (< (+ |c_ULTIMATE.start_bounded_malloc_#res.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_6 Int) (aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 8)) v_ULTIMATE.start_memset_impl_~sp~0.base_6) (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse4 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse5 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse5) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0))) .cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3.base|) 0))))) is different from false [2021-11-05 12:37:33,736 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (not (= 0 (mod (select (select |c_#memory_int| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)) 18446744073709551616))) (< (+ (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 8)) 1) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_6 Int) (aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 8)) v_ULTIMATE.start_memset_impl_~sp~0.base_6) (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse0 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0)))) is different from false [2021-11-05 12:37:35,834 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (and (= .cse0 c_ULTIMATE.start_memset_impl_~n) (< (+ 1 c_ULTIMATE.start_memset_impl_~s.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) (= c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (not (= 0 (mod .cse0 18446744073709551616))) (not (= c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base c_ULTIMATE.start_memset_impl_~s.base)) (forall ((v_ULTIMATE.start_memset_impl_~sp~0.base_6 Int)) (or (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse1 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (let ((.cse2 (select (store (select (store |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6 (store (select |c_#memory_int| v_ULTIMATE.start_memset_impl_~sp~0.base_6) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0))) (< c_ULTIMATE.start_memset_impl_~s.base v_ULTIMATE.start_memset_impl_~sp~0.base_6))))) is different from false [2021-11-05 12:37:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:37:45,582 INFO L93 Difference]: Finished difference Result 264 states and 286 transitions. [2021-11-05 12:37:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-05 12:37:45,583 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.138888888888889) internal successors, (185), 36 states have internal predecessors, (185), 0 states have call successors, (0), 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-05 12:37:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:37:45,584 INFO L225 Difference]: With dead ends: 264 [2021-11-05 12:37:45,584 INFO L226 Difference]: Without dead ends: 198 [2021-11-05 12:37:45,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 36757.36ms TimeCoverageRelationStatistics Valid=260, Invalid=1731, Unknown=9, NotChecked=450, Total=2450 [2021-11-05 12:37:45,585 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 298 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 17 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23450.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.29ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 583 IncrementalHoareTripleChecker+Unchecked, 24965.23ms IncrementalHoareTripleChecker+Time [2021-11-05 12:37:45,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1867 Invalid, 975 Unknown, 0 Unchecked, 10.29ms Time], IncrementalHoareTripleChecker [17 Valid, 364 Invalid, 11 Unknown, 583 Unchecked, 24965.23ms Time] [2021-11-05 12:37:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-05 12:37:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 172. [2021-11-05 12:37:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:37:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2021-11-05 12:37:45,596 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 72 [2021-11-05 12:37:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:37:45,596 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2021-11-05 12:37:45,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.138888888888889) internal successors, (185), 36 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:37:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2021-11-05 12:37:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-05 12:37:45,597 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:37:45,597 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-05 12:37:45,625 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-05 12:37:45,815 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,SelfDestructingSolverStorable17 [2021-11-05 12:37:45,816 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:37:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:37:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1544328994, now seen corresponding path program 1 times [2021-11-05 12:37:45,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:37:45,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374236033] [2021-11-05 12:37:45,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:37:45,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:37:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:37:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-05 12:37:46,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:37:46,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374236033] [2021-11-05 12:37:46,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374236033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:37:46,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:37:46,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:37:46,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260770688] [2021-11-05 12:37:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:37:46,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:37:46,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:37:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:37:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:37:46,718 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-05 12:37:48,842 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:50,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:53,110 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:37:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:37:54,435 INFO L93 Difference]: Finished difference Result 294 states and 316 transitions. [2021-11-05 12:37:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 12:37:54,435 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-05 12:37:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:37:54,436 INFO L225 Difference]: With dead ends: 294 [2021-11-05 12:37:54,436 INFO L226 Difference]: Without dead ends: 199 [2021-11-05 12:37:54,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 719.20ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:37:54,437 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 291 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6893.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.29ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7311.80ms IncrementalHoareTripleChecker+Time [2021-11-05 12:37:54,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 554 Invalid, 288 Unknown, 0 Unchecked, 4.29ms Time], IncrementalHoareTripleChecker [29 Valid, 256 Invalid, 3 Unknown, 0 Unchecked, 7311.80ms Time] [2021-11-05 12:37:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-05 12:37:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2021-11-05 12:37:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.1019108280254777) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:37:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2021-11-05 12:37:54,449 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 72 [2021-11-05 12:37:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:37:54,449 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2021-11-05 12:37:54,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-05 12:37:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2021-11-05 12:37:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-05 12:37:54,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:37:54,450 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] [2021-11-05 12:37:54,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-05 12:37:54,451 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:37:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:37:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash -101538063, now seen corresponding path program 1 times [2021-11-05 12:37:54,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:37:54,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061917723] [2021-11-05 12:37:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:37:54,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:37:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:37:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-05 12:37:54,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:37:54,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061917723] [2021-11-05 12:37:54,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061917723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:37:54,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:37:54,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:37:54,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923455723] [2021-11-05 12:37:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:37:54,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:37:54,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:37:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:37:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:37:54,903 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:37:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:37:55,984 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2021-11-05 12:37:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-05 12:37:55,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-11-05 12:37:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:37:55,987 INFO L225 Difference]: With dead ends: 249 [2021-11-05 12:37:55,987 INFO L226 Difference]: Without dead ends: 245 [2021-11-05 12:37:55,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 589.86ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-05 12:37:55,988 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 158 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 596.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.78ms SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 635.29ms IncrementalHoareTripleChecker+Time [2021-11-05 12:37:55,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 602 Invalid, 265 Unknown, 0 Unchecked, 2.78ms Time], IncrementalHoareTripleChecker [65 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 635.29ms Time] [2021-11-05 12:37:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-05 12:37:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 164. [2021-11-05 12:37:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 160 states have (on average 1.1) internal successors, (176), 163 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:37:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 176 transitions. [2021-11-05 12:37:55,998 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 176 transitions. Word has length 74 [2021-11-05 12:37:55,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:37:55,999 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 176 transitions. [2021-11-05 12:37:55,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:37:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2021-11-05 12:37:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-05 12:37:56,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:37:56,001 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] [2021-11-05 12:37:56,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-05 12:37:56,002 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-05 12:37:56,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:37:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash 444640634, now seen corresponding path program 2 times [2021-11-05 12:37:56,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:37:56,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584247834] [2021-11-05 12:37:56,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:37:56,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:37:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:38:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:38:01,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:38:01,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584247834] [2021-11-05 12:38:01,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584247834] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 12:38:01,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599745241] [2021-11-05 12:38:01,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-05 12:38:01,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:38:01,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:38:01,314 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-05 12:38:01,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process Killed by 15