./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bfd0d9ac 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_array_eq_ignore_case_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 8de283a79f01a407383b7daa040c59e7c5c73f52f0f9c705f7021a208716cd24 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-bfd0d9a [2021-11-01 09:05:23,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-01 09:05:23,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-01 09:05:23,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-01 09:05:23,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-01 09:05:23,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-01 09:05:23,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-01 09:05:23,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-01 09:05:23,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-01 09:05:23,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-01 09:05:23,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-01 09:05:23,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-01 09:05:23,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-01 09:05:23,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-01 09:05:23,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-01 09:05:23,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-01 09:05:23,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-01 09:05:23,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-01 09:05:23,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-01 09:05:23,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-01 09:05:23,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-01 09:05:23,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-01 09:05:23,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-01 09:05:23,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-01 09:05:23,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-01 09:05:23,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-01 09:05:23,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-01 09:05:23,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-01 09:05:23,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-01 09:05:23,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-01 09:05:23,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-01 09:05:23,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-01 09:05:23,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-01 09:05:23,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-01 09:05:23,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-01 09:05:23,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-01 09:05:23,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-01 09:05:23,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-01 09:05:23,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-01 09:05:23,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-01 09:05:23,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-01 09:05:23,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-01 09:05:23,717 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-01 09:05:23,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-01 09:05:23,718 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-01 09:05:23,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-01 09:05:23,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-01 09:05:23,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-01 09:05:23,719 INFO L138 SettingsManager]: * Use SBE=true [2021-11-01 09:05:23,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-01 09:05:23,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-01 09:05:23,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-01 09:05:23,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-01 09:05:23,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-01 09:05:23,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-01 09:05:23,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-01 09:05:23,721 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-01 09:05:23,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-01 09:05:23,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-01 09:05:23,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-01 09:05:23,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-01 09:05:23,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 09:05:23,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-01 09:05:23,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-01 09:05:23,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-01 09:05:23,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-01 09:05:23,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-01 09:05:23,723 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-01 09:05:23,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-01 09:05:23,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-01 09:05:23,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-01 09:05:23,723 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 -> 8de283a79f01a407383b7daa040c59e7c5c73f52f0f9c705f7021a208716cd24 [2021-11-01 09:05:23,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-01 09:05:23,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-01 09:05:23,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-01 09:05:23,876 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-01 09:05:23,876 INFO L275 PluginConnector]: CDTParser initialized [2021-11-01 09:05:23,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i [2021-11-01 09:05:23,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c7d0817/e1cecf07d0c1487eb40db42feff5a469/FLAG34014a34a [2021-11-01 09:05:24,491 INFO L306 CDTParser]: Found 1 translation units. [2021-11-01 09:05:24,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i [2021-11-01 09:05:24,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c7d0817/e1cecf07d0c1487eb40db42feff5a469/FLAG34014a34a [2021-11-01 09:05:24,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c7d0817/e1cecf07d0c1487eb40db42feff5a469 [2021-11-01 09:05:24,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-01 09:05:24,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-01 09:05:24,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-01 09:05:24,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-01 09:05:24,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-01 09:05:24,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:05:24" (1/1) ... [2021-11-01 09:05:24,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d4082a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:24, skipping insertion in model container [2021-11-01 09:05:24,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:05:24" (1/1) ... [2021-11-01 09:05:24,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-01 09:05:24,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-01 09:05:24,968 WARN L228 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_array_eq_ignore_case_harness.i[4498,4511] [2021-11-01 09:05:24,973 WARN L228 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_array_eq_ignore_case_harness.i[4558,4571] [2021-11-01 09:05:24,990 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 09:05:24,994 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 09:05:25,561 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,562 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,562 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,563 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,564 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,575 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,577 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,807 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 09:05:25,808 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 09:05:25,809 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 09:05:25,810 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 09:05:25,811 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 09:05:25,812 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 09:05:25,812 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 09:05:25,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 09:05:25,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 09:05:25,815 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 09:05:25,916 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 09:05:25,995 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:25,996 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 09:05:26,084 INFO L203 MainTranslator]: Completed pre-run [2021-11-01 09:05:26,101 WARN L228 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_array_eq_ignore_case_harness.i[4498,4511] [2021-11-01 09:05:26,103 WARN L228 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_array_eq_ignore_case_harness.i[4558,4571] [2021-11-01 09:05:26,104 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 09:05:26,105 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 09:05:26,140 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,141 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,141 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,141 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,142 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,146 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,147 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,147 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,149 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,177 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 09:05:26,178 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 09:05:26,178 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 09:05:26,178 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 09:05:26,179 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 09:05:26,179 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 09:05:26,179 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 09:05:26,180 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 09:05:26,180 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 09:05:26,180 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 09:05:26,201 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 09:05:26,236 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,236 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 09:05:26,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 09:05:26,415 INFO L208 MainTranslator]: Completed translation [2021-11-01 09:05:26,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26 WrapperNode [2021-11-01 09:05:26,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-01 09:05:26,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-01 09:05:26,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-01 09:05:26,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-01 09:05:26,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-01 09:05:26,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-01 09:05:26,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-01 09:05:26,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-01 09:05:26,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-01 09:05:26,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-01 09:05:26,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-01 09:05:26,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-01 09:05:26,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (1/1) ... [2021-11-01 09:05:26,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 09:05:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 09:05:26,681 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-01 09:05:26,701 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-01 09:05:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-01 09:05:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-01 09:05:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-01 09:05:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-01 09:05:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-01 09:05:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-01 09:05:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-01 09:05:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-01 09:05:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-01 09:05:30,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-01 09:05:30,686 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-11-01 09:05:30,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:05:30 BoogieIcfgContainer [2021-11-01 09:05:30,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-01 09:05:30,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-01 09:05:30,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-01 09:05:30,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-01 09:05:30,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 09:05:24" (1/3) ... [2021-11-01 09:05:30,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a47f102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:05:30, skipping insertion in model container [2021-11-01 09:05:30,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:05:26" (2/3) ... [2021-11-01 09:05:30,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a47f102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:05:30, skipping insertion in model container [2021-11-01 09:05:30,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:05:30" (3/3) ... [2021-11-01 09:05:30,707 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_ignore_case_harness.i [2021-11-01 09:05:30,711 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-01 09:05:30,711 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-01 09:05:30,764 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-01 09:05:30,768 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-01 09:05:30,769 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-01 09:05:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-01 09:05:30,789 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:05:30,789 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] [2021-11-01 09:05:30,790 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:05:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:05:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1732099540, now seen corresponding path program 1 times [2021-11-01 09:05:30,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:05:30,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007762616] [2021-11-01 09:05:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:05:30,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:05:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:05:31,290 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-01 09:05:31,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:05:31,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007762616] [2021-11-01 09:05:31,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007762616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:05:31,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:05:31,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 09:05:31,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521595948] [2021-11-01 09:05:31,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-01 09:05:31,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:05:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-01 09:05:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 09:05:31,324 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:33,405 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-01 09:05:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:05:33,926 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2021-11-01 09:05:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-01 09:05:33,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-01 09:05:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:05:33,934 INFO L225 Difference]: With dead ends: 131 [2021-11-01 09:05:33,935 INFO L226 Difference]: Without dead ends: 61 [2021-11-01 09:05:33,937 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-01 09:05:33,939 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2328.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.59ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2565.83ms IncrementalHoareTripleChecker+Time [2021-11-01 09:05:33,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 1.59ms Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 2565.83ms Time] [2021-11-01 09:05:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-01 09:05:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-01 09:05:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2021-11-01 09:05:33,963 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 27 [2021-11-01 09:05:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:05:33,964 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2021-11-01 09:05:33,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2021-11-01 09:05:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-01 09:05:33,965 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:05:33,965 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] [2021-11-01 09:05:33,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-01 09:05:33,966 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:05:33,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:05:33,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1816466470, now seen corresponding path program 1 times [2021-11-01 09:05:33,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:05:33,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426669038] [2021-11-01 09:05:33,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:05:33,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:05:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:05:34,245 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-01 09:05:34,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:05:34,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426669038] [2021-11-01 09:05:34,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426669038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:05:34,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:05:34,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 09:05:34,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707851241] [2021-11-01 09:05:34,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 09:05:34,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:05:34,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 09:05:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 09:05:34,248 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:36,307 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-01 09:05:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:05:37,392 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2021-11-01 09:05:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 09:05:37,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-01 09:05:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:05:37,395 INFO L225 Difference]: With dead ends: 132 [2021-11-01 09:05:37,395 INFO L226 Difference]: Without dead ends: 116 [2021-11-01 09:05:37,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.18ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 09:05:37,396 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2734.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.45ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3079.53ms IncrementalHoareTripleChecker+Time [2021-11-01 09:05:37,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 222 Unknown, 0 Unchecked, 6.45ms Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 1 Unknown, 0 Unchecked, 3079.53ms Time] [2021-11-01 09:05:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-01 09:05:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2021-11-01 09:05:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2021-11-01 09:05:37,405 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 27 [2021-11-01 09:05:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:05:37,405 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2021-11-01 09:05:37,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2021-11-01 09:05:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-01 09:05:37,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:05:37,406 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-01 09:05:37,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-01 09:05:37,407 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:05:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:05:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1086636907, now seen corresponding path program 1 times [2021-11-01 09:05:37,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:05:37,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782998161] [2021-11-01 09:05:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:05:37,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:05:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:05:37,862 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-01 09:05:37,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:05:37,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782998161] [2021-11-01 09:05:37,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782998161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:05:37,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:05:37,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 09:05:37,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042996693] [2021-11-01 09:05:37,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 09:05:37,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:05:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 09:05:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 09:05:37,864 INFO L87 Difference]: Start difference. First operand 80 states and 92 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-01 09:05:39,923 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-01 09:05:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:05:41,068 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2021-11-01 09:05:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 09:05:41,068 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-01 09:05:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:05:41,069 INFO L225 Difference]: With dead ends: 104 [2021-11-01 09:05:41,069 INFO L226 Difference]: Without dead ends: 102 [2021-11-01 09:05:41,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 09:05:41,071 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2824.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.74ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3145.91ms IncrementalHoareTripleChecker+Time [2021-11-01 09:05:41,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 218 Unknown, 0 Unchecked, 3.74ms Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 1 Unknown, 0 Unchecked, 3145.91ms Time] [2021-11-01 09:05:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-01 09:05:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2021-11-01 09:05:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2021-11-01 09:05:41,083 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 29 [2021-11-01 09:05:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:05:41,084 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2021-11-01 09:05:41,084 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-01 09:05:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2021-11-01 09:05:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-01 09:05:41,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:05:41,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:05:41,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-01 09:05:41,086 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:05:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:05:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -571433758, now seen corresponding path program 1 times [2021-11-01 09:05:41,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:05:41,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984031672] [2021-11-01 09:05:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:05:41,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:05:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:05:41,522 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-01 09:05:41,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:05:41,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984031672] [2021-11-01 09:05:41,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984031672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:05:41,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:05:41,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-01 09:05:41,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795355119] [2021-11-01 09:05:41,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-01 09:05:41,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:05:41,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-01 09:05:41,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-01 09:05:41,523 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:43,600 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-01 09:05:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:05:45,248 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2021-11-01 09:05:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 09:05:45,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-01 09:05:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:05:45,251 INFO L225 Difference]: With dead ends: 250 [2021-11-01 09:05:45,251 INFO L226 Difference]: Without dead ends: 241 [2021-11-01 09:05:45,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 309.50ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-01 09:05:45,252 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3345.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.58ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3514.88ms IncrementalHoareTripleChecker+Time [2021-11-01 09:05:45,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 456 Unknown, 0 Unchecked, 9.58ms Time], IncrementalHoareTripleChecker [5 Valid, 450 Invalid, 1 Unknown, 0 Unchecked, 3514.88ms Time] [2021-11-01 09:05:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-01 09:05:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 154. [2021-11-01 09:05:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 1.218543046357616) internal successors, (184), 153 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 184 transitions. [2021-11-01 09:05:45,271 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 184 transitions. Word has length 31 [2021-11-01 09:05:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:05:45,274 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 184 transitions. [2021-11-01 09:05:45,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 184 transitions. [2021-11-01 09:05:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-01 09:05:45,275 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:05:45,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:05:45,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-01 09:05:45,277 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:05:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:05:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash -518323106, now seen corresponding path program 1 times [2021-11-01 09:05:45,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:05:45,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476314716] [2021-11-01 09:05:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:05:45,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:05:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:05:45,484 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-01 09:05:45,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:05:45,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476314716] [2021-11-01 09:05:45,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476314716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:05:45,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:05:45,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 09:05:45,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950268550] [2021-11-01 09:05:45,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 09:05:45,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:05:45,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 09:05:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 09:05:45,486 INFO L87 Difference]: Start difference. First operand 154 states and 184 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:47,538 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-01 09:05:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:05:48,358 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2021-11-01 09:05:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 09:05:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-01 09:05:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:05:48,360 INFO L225 Difference]: With dead ends: 172 [2021-11-01 09:05:48,360 INFO L226 Difference]: Without dead ends: 167 [2021-11-01 09:05:48,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.10ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 09:05:48,361 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2668.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.96ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2824.57ms IncrementalHoareTripleChecker+Time [2021-11-01 09:05:48,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 210 Unknown, 0 Unchecked, 2.96ms Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2824.57ms Time] [2021-11-01 09:05:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-01 09:05:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2021-11-01 09:05:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 153 states have (on average 1.2156862745098038) internal successors, (186), 155 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2021-11-01 09:05:48,369 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 32 [2021-11-01 09:05:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:05:48,374 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2021-11-01 09:05:48,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2021-11-01 09:05:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-01 09:05:48,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:05:48,378 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:05:48,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-01 09:05:48,378 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:05:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:05:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash 618600592, now seen corresponding path program 1 times [2021-11-01 09:05:48,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:05:48,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671758147] [2021-11-01 09:05:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:05:48,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:05:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:05:48,768 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-01 09:05:48,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:05:48,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671758147] [2021-11-01 09:05:48,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671758147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:05:48,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:05:48,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-01 09:05:48,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32386897] [2021-11-01 09:05:48,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-01 09:05:48,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:05:48,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-01 09:05:48,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-01 09:05:48,770 INFO L87 Difference]: Start difference. First operand 156 states and 186 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:50,813 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:05:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:05:53,027 INFO L93 Difference]: Finished difference Result 240 states and 282 transitions. [2021-11-01 09:05:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-01 09:05:53,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-01 09:05:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:05:53,028 INFO L225 Difference]: With dead ends: 240 [2021-11-01 09:05:53,028 INFO L226 Difference]: Without dead ends: 202 [2021-11-01 09:05:53,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 494.86ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-11-01 09:05:53,029 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3593.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.37ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3882.19ms IncrementalHoareTripleChecker+Time [2021-11-01 09:05:53,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 574 Unknown, 0 Unchecked, 10.37ms Time], IncrementalHoareTripleChecker [12 Valid, 561 Invalid, 1 Unknown, 0 Unchecked, 3882.19ms Time] [2021-11-01 09:05:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-01 09:05:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 188. [2021-11-01 09:05:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 185 states have (on average 1.2108108108108109) internal successors, (224), 187 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2021-11-01 09:05:53,047 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 33 [2021-11-01 09:05:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:05:53,048 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2021-11-01 09:05:53,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2021-11-01 09:05:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-01 09:05:53,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:05:53,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:05:53,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-01 09:05:53,053 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:05:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:05:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash -358402595, now seen corresponding path program 1 times [2021-11-01 09:05:53,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:05:53,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725964510] [2021-11-01 09:05:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:05:53,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:05:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:05:53,313 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-01 09:05:53,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:05:53,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725964510] [2021-11-01 09:05:53,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725964510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:05:53,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:05:53,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 09:05:53,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613348002] [2021-11-01 09:05:53,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 09:05:53,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:05:53,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 09:05:53,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 09:05:53,315 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:55,363 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-01 09:05:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:05:56,329 INFO L93 Difference]: Finished difference Result 239 states and 285 transitions. [2021-11-01 09:05:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 09:05:56,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-01 09:05:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:05:56,331 INFO L225 Difference]: With dead ends: 239 [2021-11-01 09:05:56,331 INFO L226 Difference]: Without dead ends: 213 [2021-11-01 09:05:56,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.52ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 09:05:56,332 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2759.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.44ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2964.68ms IncrementalHoareTripleChecker+Time [2021-11-01 09:05:56,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 3.44ms Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 2964.68ms Time] [2021-11-01 09:05:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-01 09:05:56,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2021-11-01 09:05:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 193 states have (on average 1.1917098445595855) internal successors, (230), 195 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 230 transitions. [2021-11-01 09:05:56,351 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 230 transitions. Word has length 33 [2021-11-01 09:05:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:05:56,352 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 230 transitions. [2021-11-01 09:05:56,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 230 transitions. [2021-11-01 09:05:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-01 09:05:56,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:05:56,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:05:56,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-01 09:05:56,353 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:05:56,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:05:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1248189667, now seen corresponding path program 1 times [2021-11-01 09:05:56,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:05:56,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965377873] [2021-11-01 09:05:56,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:05:56,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:05:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:05:56,969 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-01 09:05:56,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:05:56,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965377873] [2021-11-01 09:05:56,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965377873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:05:56,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:05:56,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-01 09:05:56,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371926754] [2021-11-01 09:05:56,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-01 09:05:56,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:05:56,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-01 09:05:56,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-01 09:05:56,970 INFO L87 Difference]: Start difference. First operand 196 states and 230 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:05:59,012 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:06:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:06:02,235 INFO L93 Difference]: Finished difference Result 308 states and 350 transitions. [2021-11-01 09:06:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-01 09:06:02,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-01 09:06:02,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:06:02,237 INFO L225 Difference]: With dead ends: 308 [2021-11-01 09:06:02,237 INFO L226 Difference]: Without dead ends: 294 [2021-11-01 09:06:02,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1219.30ms TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-11-01 09:06:02,238 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 520 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4030.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.31ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4267.84ms IncrementalHoareTripleChecker+Time [2021-11-01 09:06:02,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 0 Invalid, 742 Unknown, 0 Unchecked, 11.31ms Time], IncrementalHoareTripleChecker [6 Valid, 735 Invalid, 1 Unknown, 0 Unchecked, 4267.84ms Time] [2021-11-01 09:06:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-01 09:06:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 220. [2021-11-01 09:06:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 217 states have (on average 1.1889400921658986) internal successors, (258), 219 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 258 transitions. [2021-11-01 09:06:02,245 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 258 transitions. Word has length 34 [2021-11-01 09:06:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:06:02,245 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 258 transitions. [2021-11-01 09:06:02,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 258 transitions. [2021-11-01 09:06:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-01 09:06:02,246 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:06:02,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:06:02,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-01 09:06:02,246 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:06:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:06:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 513264780, now seen corresponding path program 1 times [2021-11-01 09:06:02,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:06:02,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198482687] [2021-11-01 09:06:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:06:02,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:06:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:06:02,577 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-01 09:06:02,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:06:02,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198482687] [2021-11-01 09:06:02,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198482687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:06:02,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:06:02,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 09:06:02,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651784050] [2021-11-01 09:06:02,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 09:06:02,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:06:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 09:06:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-01 09:06:02,579 INFO L87 Difference]: Start difference. First operand 220 states and 258 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:04,622 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:06:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:06:05,403 INFO L93 Difference]: Finished difference Result 252 states and 295 transitions. [2021-11-01 09:06:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 09:06:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-01 09:06:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:06:05,405 INFO L225 Difference]: With dead ends: 252 [2021-11-01 09:06:05,405 INFO L226 Difference]: Without dead ends: 222 [2021-11-01 09:06:05,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 82.54ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-01 09:06:05,406 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2562.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2775.71ms IncrementalHoareTripleChecker+Time [2021-11-01 09:06:05,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 205 Unknown, 0 Unchecked, 2.60ms Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 1 Unknown, 0 Unchecked, 2775.71ms Time] [2021-11-01 09:06:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-01 09:06:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2021-11-01 09:06:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 1.175531914893617) internal successors, (221), 189 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2021-11-01 09:06:05,423 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 35 [2021-11-01 09:06:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:06:05,423 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2021-11-01 09:06:05,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2021-11-01 09:06:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-01 09:06:05,425 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:06:05,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:06:05,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-01 09:06:05,426 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:06:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:06:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1203766261, now seen corresponding path program 1 times [2021-11-01 09:06:05,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:06:05,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043679445] [2021-11-01 09:06:05,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:06:05,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:06:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:06:05,891 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-01 09:06:05,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:06:05,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043679445] [2021-11-01 09:06:05,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043679445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:06:05,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:06:05,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-01 09:06:05,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517889926] [2021-11-01 09:06:05,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-01 09:06:05,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:06:05,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-01 09:06:05,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-01 09:06:05,893 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:08,344 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:06:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:06:10,032 INFO L93 Difference]: Finished difference Result 228 states and 262 transitions. [2021-11-01 09:06:10,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-01 09:06:10,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-01 09:06:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:06:10,034 INFO L225 Difference]: With dead ends: 228 [2021-11-01 09:06:10,034 INFO L226 Difference]: Without dead ends: 198 [2021-11-01 09:06:10,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 486.58ms TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-11-01 09:06:10,035 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3545.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.12ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3784.69ms IncrementalHoareTripleChecker+Time [2021-11-01 09:06:10,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 7.12ms Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 1 Unknown, 0 Unchecked, 3784.69ms Time] [2021-11-01 09:06:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-01 09:06:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2021-11-01 09:06:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 1.1702127659574468) internal successors, (220), 189 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2021-11-01 09:06:10,042 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 36 [2021-11-01 09:06:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:06:10,042 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2021-11-01 09:06:10,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2021-11-01 09:06:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-01 09:06:10,043 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:06:10,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:06:10,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-01 09:06:10,043 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:06:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:06:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1546392854, now seen corresponding path program 1 times [2021-11-01 09:06:10,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:06:10,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892374546] [2021-11-01 09:06:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:06:10,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:06:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:06:10,418 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-01 09:06:10,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:06:10,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892374546] [2021-11-01 09:06:10,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892374546] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:06:10,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:06:10,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 09:06:10,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007270629] [2021-11-01 09:06:10,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 09:06:10,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:06:10,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 09:06:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-01 09:06:10,421 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:12,827 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:06:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:06:13,729 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2021-11-01 09:06:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-01 09:06:13,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-01 09:06:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:06:13,730 INFO L225 Difference]: With dead ends: 281 [2021-11-01 09:06:13,730 INFO L226 Difference]: Without dead ends: 258 [2021-11-01 09:06:13,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 124.55ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-01 09:06:13,731 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2966.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.05ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3233.69ms IncrementalHoareTripleChecker+Time [2021-11-01 09:06:13,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 1.05ms Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 1 Unknown, 0 Unchecked, 3233.69ms Time] [2021-11-01 09:06:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-01 09:06:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 194. [2021-11-01 09:06:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.1770833333333333) internal successors, (226), 193 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2021-11-01 09:06:13,736 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 37 [2021-11-01 09:06:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:06:13,736 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2021-11-01 09:06:13,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2021-11-01 09:06:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-01 09:06:13,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:06:13,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:06:13,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-01 09:06:13,737 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:06:13,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:06:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash -865834336, now seen corresponding path program 1 times [2021-11-01 09:06:13,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:06:13,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594653056] [2021-11-01 09:06:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:06:13,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:06:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:06:14,221 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-01 09:06:14,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:06:14,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594653056] [2021-11-01 09:06:14,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594653056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:06:14,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:06:14,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-01 09:06:14,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29489780] [2021-11-01 09:06:14,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-01 09:06:14,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:06:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-01 09:06:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-01 09:06:14,222 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:16,265 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:06:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:06:18,934 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2021-11-01 09:06:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-01 09:06:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-01 09:06:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:06:18,935 INFO L225 Difference]: With dead ends: 261 [2021-11-01 09:06:18,936 INFO L226 Difference]: Without dead ends: 231 [2021-11-01 09:06:18,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 769.98ms TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-11-01 09:06:18,936 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3793.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.87ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4117.07ms IncrementalHoareTripleChecker+Time [2021-11-01 09:06:18,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 748 Unknown, 0 Unchecked, 4.87ms Time], IncrementalHoareTripleChecker [13 Valid, 734 Invalid, 1 Unknown, 0 Unchecked, 4117.07ms Time] [2021-11-01 09:06:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-01 09:06:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 194. [2021-11-01 09:06:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.171875) internal successors, (225), 193 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 225 transitions. [2021-11-01 09:06:18,968 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 225 transitions. Word has length 37 [2021-11-01 09:06:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:06:18,968 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 225 transitions. [2021-11-01 09:06:18,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 225 transitions. [2021-11-01 09:06:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-01 09:06:18,969 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:06:18,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:06:18,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-01 09:06:18,970 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:06:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:06:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1604639621, now seen corresponding path program 1 times [2021-11-01 09:06:18,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:06:18,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400292548] [2021-11-01 09:06:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:06:18,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:06:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:06:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 09:06:19,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:06:19,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400292548] [2021-11-01 09:06:19,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400292548] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:06:19,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:06:19,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-01 09:06:19,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093439275] [2021-11-01 09:06:19,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-01 09:06:19,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:06:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-01 09:06:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-01 09:06:19,478 INFO L87 Difference]: Start difference. First operand 194 states and 225 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:21,623 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-01 09:06:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:06:24,232 INFO L93 Difference]: Finished difference Result 276 states and 320 transitions. [2021-11-01 09:06:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 09:06:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-01 09:06:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:06:24,234 INFO L225 Difference]: With dead ends: 276 [2021-11-01 09:06:24,234 INFO L226 Difference]: Without dead ends: 230 [2021-11-01 09:06:24,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 733.92ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-01 09:06:24,235 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 324 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3926.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.49ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4224.04ms IncrementalHoareTripleChecker+Time [2021-11-01 09:06:24,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 0 Invalid, 668 Unknown, 0 Unchecked, 8.49ms Time], IncrementalHoareTripleChecker [4 Valid, 663 Invalid, 1 Unknown, 0 Unchecked, 4224.04ms Time] [2021-11-01 09:06:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-01 09:06:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2021-11-01 09:06:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.1614583333333333) internal successors, (223), 193 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2021-11-01 09:06:24,240 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 39 [2021-11-01 09:06:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:06:24,241 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2021-11-01 09:06:24,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2021-11-01 09:06:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-01 09:06:24,241 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:06:24,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:06:24,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-01 09:06:24,242 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:06:24,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:06:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1876182655, now seen corresponding path program 1 times [2021-11-01 09:06:24,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:06:24,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79006757] [2021-11-01 09:06:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:06:24,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:06:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:06:35,678 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-01 09:06:35,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:06:35,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79006757] [2021-11-01 09:06:35,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79006757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:06:35,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:06:35,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-01 09:06:35,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105574704] [2021-11-01 09:06:35,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-01 09:06:35,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:06:35,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-01 09:06:35,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-11-01 09:06:35,680 INFO L87 Difference]: Start difference. First operand 194 states and 223 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:37,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:06:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:06:44,161 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2021-11-01 09:06:44,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-01 09:06:44,161 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-01 09:06:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:06:44,162 INFO L225 Difference]: With dead ends: 238 [2021-11-01 09:06:44,162 INFO L226 Difference]: Without dead ends: 236 [2021-11-01 09:06:44,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3695.87ms TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2021-11-01 09:06:44,163 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 527 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5370.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.65ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5868.02ms IncrementalHoareTripleChecker+Time [2021-11-01 09:06:44,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 0 Invalid, 1271 Unknown, 0 Unchecked, 14.65ms Time], IncrementalHoareTripleChecker [46 Valid, 1224 Invalid, 1 Unknown, 0 Unchecked, 5868.02ms Time] [2021-11-01 09:06:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-01 09:06:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2021-11-01 09:06:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 194 states have (on average 1.1597938144329898) internal successors, (225), 195 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2021-11-01 09:06:44,170 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 40 [2021-11-01 09:06:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:06:44,170 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2021-11-01 09:06:44,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2021-11-01 09:06:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-01 09:06:44,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:06:44,171 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-01 09:06:44,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-01 09:06:44,171 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:06:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:06:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1569116892, now seen corresponding path program 1 times [2021-11-01 09:06:44,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:06:44,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050768312] [2021-11-01 09:06:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:06:44,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:06:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:06:47,969 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-01 09:06:47,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:06:47,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050768312] [2021-11-01 09:06:47,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050768312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:06:47,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:06:47,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-01 09:06:47,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577457687] [2021-11-01 09:06:47,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-01 09:06:47,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:06:47,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-01 09:06:47,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-01 09:06:47,971 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-01 09:06:50,220 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:06:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:06:54,499 INFO L93 Difference]: Finished difference Result 254 states and 289 transitions. [2021-11-01 09:06:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-01 09:06:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-01 09:06:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:06:54,500 INFO L225 Difference]: With dead ends: 254 [2021-11-01 09:06:54,500 INFO L226 Difference]: Without dead ends: 208 [2021-11-01 09:06:54,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1465.74ms TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-11-01 09:06:54,501 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4873.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.62ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5365.43ms IncrementalHoareTripleChecker+Time [2021-11-01 09:06:54,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 934 Unknown, 0 Unchecked, 6.62ms Time], IncrementalHoareTripleChecker [26 Valid, 907 Invalid, 1 Unknown, 0 Unchecked, 5365.43ms Time] [2021-11-01 09:06:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-01 09:06:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 196. [2021-11-01 09:06:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 194 states have (on average 1.1494845360824741) internal successors, (223), 195 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:06:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2021-11-01 09:06:54,509 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 41 [2021-11-01 09:06:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:06:54,509 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2021-11-01 09:06:54,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-01 09:06:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2021-11-01 09:06:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-01 09:06:54,510 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:06:54,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:06:54,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-01 09:06:54,510 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:06:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:06:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 664052998, now seen corresponding path program 1 times [2021-11-01 09:06:54,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:06:54,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125117877] [2021-11-01 09:06:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:06:54,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:06:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:06:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 09:06:58,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:06:58,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125117877] [2021-11-01 09:06:58,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125117877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:06:58,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:06:58,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-01 09:06:58,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552200270] [2021-11-01 09:06:58,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-01 09:06:58,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:06:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-01 09:06:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-01 09:06:58,133 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:01,201 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:07:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:07:04,350 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2021-11-01 09:07:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-01 09:07:04,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-01 09:07:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:07:04,351 INFO L225 Difference]: With dead ends: 204 [2021-11-01 09:07:04,351 INFO L226 Difference]: Without dead ends: 130 [2021-11-01 09:07:04,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 998.72ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-01 09:07:04,352 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5102.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.07ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5584.89ms IncrementalHoareTripleChecker+Time [2021-11-01 09:07:04,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 765 Unknown, 0 Unchecked, 8.07ms Time], IncrementalHoareTripleChecker [4 Valid, 760 Invalid, 1 Unknown, 0 Unchecked, 5584.89ms Time] [2021-11-01 09:07:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-01 09:07:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2021-11-01 09:07:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-11-01 09:07:04,356 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 42 [2021-11-01 09:07:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:07:04,356 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-11-01 09:07:04,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-11-01 09:07:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-01 09:07:04,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:07:04,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:07:04,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-01 09:07:04,357 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:07:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:07:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1320231428, now seen corresponding path program 1 times [2021-11-01 09:07:04,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:07:04,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498107896] [2021-11-01 09:07:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:07:04,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:07:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:07:23,225 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-01 09:07:23,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:07:23,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498107896] [2021-11-01 09:07:23,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498107896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:07:23,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:07:23,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-01 09:07:23,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862156993] [2021-11-01 09:07:23,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-01 09:07:23,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:07:23,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-01 09:07:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-01 09:07:23,227 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:25,640 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:07:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:07:30,542 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2021-11-01 09:07:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-01 09:07:30,543 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-01 09:07:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:07:30,543 INFO L225 Difference]: With dead ends: 130 [2021-11-01 09:07:30,543 INFO L226 Difference]: Without dead ends: 92 [2021-11-01 09:07:30,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3161.21ms TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2021-11-01 09:07:30,544 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 359 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4513.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.98ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4993.12ms IncrementalHoareTripleChecker+Time [2021-11-01 09:07:30,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 0 Invalid, 685 Unknown, 0 Unchecked, 9.98ms Time], IncrementalHoareTripleChecker [5 Valid, 679 Invalid, 1 Unknown, 0 Unchecked, 4993.12ms Time] [2021-11-01 09:07:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-01 09:07:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2021-11-01 09:07:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-11-01 09:07:30,547 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 44 [2021-11-01 09:07:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:07:30,547 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-11-01 09:07:30,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-11-01 09:07:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-01 09:07:30,548 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:07:30,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:07:30,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-01 09:07:30,548 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:07:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:07:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2088300975, now seen corresponding path program 1 times [2021-11-01 09:07:30,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:07:30,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386127818] [2021-11-01 09:07:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:07:30,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:07:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:07:30,830 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-01 09:07:30,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:07:30,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386127818] [2021-11-01 09:07:30,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386127818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:07:30,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:07:30,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-01 09:07:30,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574358939] [2021-11-01 09:07:30,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-01 09:07:30,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:07:30,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-01 09:07:30,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-01 09:07:30,832 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:33,129 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:07:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:07:34,341 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-11-01 09:07:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-01 09:07:34,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-01 09:07:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:07:34,342 INFO L225 Difference]: With dead ends: 92 [2021-11-01 09:07:34,342 INFO L226 Difference]: Without dead ends: 56 [2021-11-01 09:07:34,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 179.32ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-01 09:07:34,343 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3051.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.88ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3425.69ms IncrementalHoareTripleChecker+Time [2021-11-01 09:07:34,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 280 Unknown, 0 Unchecked, 0.88ms Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 1 Unknown, 0 Unchecked, 3425.69ms Time] [2021-11-01 09:07:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-01 09:07:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-01 09:07:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 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-01 09:07:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-11-01 09:07:34,346 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-11-01 09:07:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:07:34,346 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-11-01 09:07:34,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-11-01 09:07:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-01 09:07:34,346 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 09:07:34,346 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-01 09:07:34,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-01 09:07:34,346 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-01 09:07:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 09:07:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1768480620, now seen corresponding path program 1 times [2021-11-01 09:07:34,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 09:07:34,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147199289] [2021-11-01 09:07:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 09:07:34,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 09:07:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 09:07:38,795 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-01 09:07:38,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 09:07:38,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147199289] [2021-11-01 09:07:38,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147199289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 09:07:38,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 09:07:38,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-01 09:07:38,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844810818] [2021-11-01 09:07:38,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-01 09:07:38,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 09:07:38,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-01 09:07:38,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-01 09:07:38,797 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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-01 09:07:41,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 09:07:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 09:07:43,451 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-11-01 09:07:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-01 09:07:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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-01 09:07:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 09:07:43,452 INFO L225 Difference]: With dead ends: 56 [2021-11-01 09:07:43,452 INFO L226 Difference]: Without dead ends: 0 [2021-11-01 09:07:43,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1718.56ms TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2021-11-01 09:07:43,452 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3224.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.39ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3623.08ms IncrementalHoareTripleChecker+Time [2021-11-01 09:07:43,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 356 Unknown, 0 Unchecked, 4.39ms Time], IncrementalHoareTripleChecker [23 Valid, 332 Invalid, 1 Unknown, 0 Unchecked, 3623.08ms Time] [2021-11-01 09:07:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-01 09:07:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-01 09:07:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-01 09:07:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-01 09:07:43,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-11-01 09:07:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 09:07:43,453 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-01 09:07:43,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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-01 09:07:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-01 09:07:43,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-01 09:07:43,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-11-01 09:07:43,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-11-01 09:07:43,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-11-01 09:07:43,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-01 09:07:43,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-01 09:07:43,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:43,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 09:07:51,871 WARN L210 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 188 DAG size of output: 135 [2021-11-01 09:07:59,156 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,156 INFO L858 garLoopResultBuilder]: For program point L7129-2(lines 7129 7131) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L7129(lines 7129 7131) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 7686 7690) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L6900-2(lines 6900 6902) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L6900(lines 6900 6902) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L6900-6(lines 6900 6902) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,157 INFO L858 garLoopResultBuilder]: For program point L6900-4(lines 6900 6902) no Hoare annotation was computed. [2021-11-01 09:07:59,158 INFO L854 garLoopResultBuilder]: At program point L6900-3(lines 6899 6903) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 (<= |~#s_tolower_table~0.offset| 0) (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (and (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse0 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-11-01 09:07:59,158 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,158 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,158 INFO L854 garLoopResultBuilder]: At program point L6900-7(lines 6899 6903) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse1 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse12 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse2 (<= 0 |~#s_tolower_table~0.offset|)) (.cse3 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse4 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse5 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse13 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse7 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse8 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse9 (<= |~#s_tolower_table~0.offset| 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse11 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse11) (and .cse13 .cse7 .cse8 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-11-01 09:07:59,158 INFO L861 garLoopResultBuilder]: At program point L9006(line 9006) the Hoare annotation is: true [2021-11-01 09:07:59,158 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,158 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,158 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (= |~#s_tolower_table~0.offset| 0) [2021-11-01 09:07:59,158 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,158 INFO L854 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse2 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 .cse1 .cse2 (<= |~#s_tolower_table~0.offset| 0) .cse3) (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not .cse3) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse1 .cse2 (not .cse0) (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-11-01 09:07:59,158 INFO L854 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0) .cse0 (<= |~#s_tolower_table~0.offset| 0)) (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse0 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-11-01 09:07:59,158 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,158 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-01 09:07:59,159 INFO L854 garLoopResultBuilder]: At program point L7702(lines 7675 7705) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse36 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse43 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0))) (let ((.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse32 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse39 (or (and .cse36 .cse43) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse40 (not .cse2)) (.cse23 (not .cse6)) (.cse26 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse5 (= |ULTIMATE.start_aws_array_eq_ignore_case_#res| 0))) (let ((.cse14 (or (and .cse23 .cse26 .cse39 .cse40 .cse5) (and .cse23 .cse26 .cse2 .cse3 .cse5))) (.cse22 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse33 (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse37 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (.cse16 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse20 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse24 (let ((.cse45 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base|))) (= (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base) (select .cse45 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset|)) (select .cse45 8)))) (.cse27 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse28 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse30 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse41 (or (and .cse23 .cse26 .cse2 .cse3) (and .cse23 .cse26 .cse39 .cse40))) (.cse34 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse38 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse17 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse18 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse19 (<= 0 |~#s_tolower_table~0.offset|)) (.cse21 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse25 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse29 (let ((.cse44 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse44 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse44 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|))))) (.cse31 (<= |~#s_tolower_table~0.offset| 0)) (.cse35 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse4 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse7 (or (not (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) .cse32)) (.cse42 (not .cse43)) (.cse8 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse9 (or (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| 0) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0 0))) (.cse10 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse11 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse12 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse13 (not .cse1)) (.cse15 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse0 .cse22 .cse23 .cse24 .cse25 .cse26 .cse8 .cse27 .cse28 .cse3 .cse29 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse15) (and .cse0 .cse1 .cse26 .cse4 .cse39 .cse40 .cse5 .cse6) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse41 .cse13 .cse15) (and .cse16 .cse7 .cse19 .cse20 .cse21 .cse0 .cse24 .cse25 .cse8 .cse27 .cse28 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse34 .cse35 .cse14 .cse38 .cse15) (and .cse16 .cse17 .cse7 .cse18 .cse42 .cse19 .cse20 .cse21 .cse0 .cse22 .cse23 .cse24 .cse25 .cse26 .cse8 .cse27 .cse28 .cse3 .cse29 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse33 .cse5 .cse34 .cse35 .cse36 .cse37 .cse38 .cse15) (and .cse32 (or (and .cse0 .cse1 .cse26 .cse4 .cse39 .cse40 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6))) (and .cse42 .cse23 .cse26 .cse39 .cse32 .cse40) (and .cse16 .cse19 .cse20 .cse21 .cse0 .cse24 .cse25 .cse8 .cse27 .cse28 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse32 .cse41 .cse34 .cse35 .cse38 .cse15) (and .cse17 .cse18 .cse19 .cse21 .cse25 .cse3 .cse29 .cse31 (or (and .cse0 .cse1 .cse26 .cse4 .cse11 .cse32 .cse6) (and .cse23 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse15)) .cse35 .cse36) (and .cse17 .cse18 .cse19 .cse21 .cse25 .cse3 .cse29 .cse31 .cse35 .cse36 (or (and .cse7 .cse0 .cse1 .cse26 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse42 .cse23 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse15))))))) [2021-11-01 09:07:59,159 INFO L858 garLoopResultBuilder]: For program point L7694-4(lines 7694 7700) no Hoare annotation was computed. [2021-11-01 09:07:59,159 INFO L854 garLoopResultBuilder]: At program point L7694-3(lines 7694 7700) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse19 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse28 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0)) (.cse7 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse20 (not .cse7)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (or (and .cse19 .cse28) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse6 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse10 (not .cse3)) (.cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0))) (let ((.cse22 (or (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| 0) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0 0))) (.cse26 (not .cse2)) (.cse11 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse12 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse16 (let ((.cse39 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse39 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse39 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|))))) (.cse30 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse13 (<= 0 |~#s_tolower_table~0.offset|)) (.cse31 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse14 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse29 (or (and .cse20 .cse8 .cse3 .cse4 .cse6) (and .cse20 .cse8 .cse9 .cse6 .cse10))) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse32 (let ((.cse38 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base|))) (= (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base) (select .cse38 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset|)) (select .cse38 8)))) (.cse15 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse21 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse33 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse34 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse5 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse35 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse23 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse24 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse17 (<= |~#s_tolower_table~0.offset| 0)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse36 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse18 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse37 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse27 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse8 .cse5 .cse9 .cse6 .cse10 .cse7))) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 .cse17 .cse18 .cse19 (or (and .cse20 .cse8 .cse21 .cse22 .cse23 .cse24 .cse6 .cse25 .cse0 .cse26 .cse27) (and .cse1 .cse2 .cse8 .cse5 .cse24 .cse6 .cse0 .cse7))) (and (not .cse28) .cse20 .cse8 .cse9 .cse6 .cse0 .cse10) (and .cse29 .cse21 .cse22 .cse23 .cse24 .cse25 .cse0 .cse26 .cse27) (and .cse30 .cse11 .cse12 .cse13 .cse31 .cse14 .cse1 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) .cse20 .cse32 .cse15 .cse8 .cse21 .cse33 .cse34 .cse4 .cse16 .cse5 .cse35 .cse23 .cse24 .cse6 .cse25 .cse17 .cse0 (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base)) .cse36 .cse18 .cse19 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1) .cse37 .cse27) (and .cse30 .cse13 .cse31 .cse14 .cse29 .cse1 .cse32 .cse15 .cse21 .cse33 .cse34 .cse5 .cse35 .cse23 .cse24 .cse25 .cse17 .cse0 .cse36 .cse18 .cse37 .cse27))))) [2021-11-01 09:07:59,159 INFO L858 garLoopResultBuilder]: For program point L7694-2(lines 7694 7700) no Hoare annotation was computed. [2021-11-01 09:07:59,159 INFO L858 garLoopResultBuilder]: For program point L8999(lines 8967 9005) no Hoare annotation was computed. [2021-11-01 09:07:59,159 INFO L858 garLoopResultBuilder]: For program point L8975-2(lines 8975 8981) no Hoare annotation was computed. [2021-11-01 09:07:59,159 INFO L858 garLoopResultBuilder]: For program point L7695(lines 7695 7699) no Hoare annotation was computed. [2021-11-01 09:07:59,159 INFO L858 garLoopResultBuilder]: For program point L8975(lines 8975 8981) no Hoare annotation was computed. [2021-11-01 09:07:59,159 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) [2021-11-01 09:07:59,160 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse8 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse10 (not .cse3)) (.cse13 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse14 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse16 (not .cse5)) (.cse9 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse11 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (let ((.cse0 (= |~#s_tolower_table~0.offset| 0)) (.cse1 (let ((.cse17 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse18 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse19 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse20 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse21 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_save_byte_from_array_~size)) (.cse22 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse23 (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base)) (.cse24 (not (= ULTIMATE.start_save_byte_from_array_~storage.base 0))) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse26 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0))) (or (and .cse17 .cse18 .cse19 .cse8 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse7 .cse20 .cse21 .cse14 .cse15 .cse16 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse17 .cse18 .cse19 .cse9 .cse4 .cse11 .cse5 .cse12 .cse7 .cse20 .cse21 .cse3 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))))) (.cse6 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse2 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse3) (and (<= 0 |~#s_tolower_table~0.offset|) .cse8 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse7 .cse2 (<= |~#s_tolower_table~0.offset| 0) .cse14 .cse15 .cse16))))) [2021-11-01 09:07:59,160 INFO L854 garLoopResultBuilder]: At program point L263-1(line 263) the Hoare annotation is: (let ((.cse30 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse8 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse31 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0)) (.cse6 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse18 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse11 (<= 0 |~#s_tolower_table~0.offset|)) (.cse7 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse12 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse13 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse20 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse21 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse22 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse23 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse24 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse16 (<= |~#s_tolower_table~0.offset| 0)) (.cse26 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse17 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse27 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse28 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0))) (.cse19 (not .cse6)) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse4 (or (and .cse8 .cse31) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse5 (not .cse30)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse14 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base)) .cse8 (let ((.cse9 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse10 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse15 (let ((.cse29 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse29 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse29 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|)))))) (or (and .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse6 .cse17) (and .cse18 .cse9 .cse10 .cse11 .cse12 .cse0 .cse19 .cse13 .cse2 .cse20 .cse21 .cse22 .cse14 .cse15 .cse3 .cse23 .cse24 .cse25 .cse16 .cse26 .cse17 .cse27 .cse28))) (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (and .cse18 .cse11 .cse7 .cse12 .cse0 .cse13 .cse20 .cse21 .cse22 .cse3 .cse23 .cse24 .cse25 .cse16 (or (and .cse19 .cse2 .cse30 .cse14) (and .cse19 .cse2 .cse4 .cse5)) .cse26 .cse17 .cse27 .cse28) (and (not .cse31) .cse19 .cse2 .cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0) .cse5) (and .cse0 .cse1 .cse30 .cse14 .cse3 .cse6)))) [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L8967(lines 8967 9005) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L854 garLoopResultBuilder]: At program point L6886-1(lines 6882 6887) the Hoare annotation is: (let ((.cse0 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (or (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) .cse0 .cse1 (= |~#s_tolower_table~0.offset| 0) .cse2 .cse3 .cse4) (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0) .cse3 (<= |~#s_tolower_table~0.offset| 0) .cse4))) [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L7134(lines 7134 7140) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L7134-1(lines 7134 7140) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L7135(lines 7135 7139) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,160 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,161 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,161 INFO L858 garLoopResultBuilder]: For program point L7135-2(lines 7135 7139) no Hoare annotation was computed. [2021-11-01 09:07:59,161 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,161 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,161 INFO L858 garLoopResultBuilder]: For program point L9002(lines 9002 9004) no Hoare annotation was computed. [2021-11-01 09:07:59,161 INFO L858 garLoopResultBuilder]: For program point L8994(lines 8994 8996) no Hoare annotation was computed. [2021-11-01 09:07:59,161 INFO L858 garLoopResultBuilder]: For program point L8994-1(lines 8967 9005) no Hoare annotation was computed. [2021-11-01 09:07:59,161 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 09:07:59,163 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 09:07:59,164 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-01 09:07:59,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 09:07:59 BoogieIcfgContainer [2021-11-01 09:07:59,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-01 09:07:59,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-01 09:07:59,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-01 09:07:59,239 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-01 09:07:59,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:05:30" (3/4) ... [2021-11-01 09:07:59,242 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-01 09:07:59,253 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 131 nodes and edges [2021-11-01 09:07:59,254 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-11-01 09:07:59,255 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-01 09:07:59,255 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-01 09:07:59,256 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-01 09:07:59,257 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-01 09:07:59,257 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-01 09:07:59,258 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-01 09:07:59,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= s_tolower_table && \result == 0) && s_tolower_table <= 0) && \result == 0) || (((((((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) [2021-11-01 09:07:59,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \valid[\result] == 1 [2021-11-01 09:07:59,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= s_tolower_table && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) || ((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && !(lhs == 0)) && \valid[\result] == 1) && \valid[\result] == 1) [2021-11-01 09:07:59,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \result == 0) || (((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \valid[\old_byte_from_lhs] == 1)) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) [2021-11-01 09:07:59,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= s_tolower_table && lhs == 0) && lhs == 0) && s_tolower_table <= 0) || (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) [2021-11-01 09:07:59,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((\result + 1 <= unknown-#StackHeapBarrier-unknown && !(\old_byte_from_lhs == storage)) && !(lhs == storage)) && \old_byte_from_lhs == 0) && ((((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1) || ((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)))) && \valid[\old_byte_from_lhs] == 1)) || ((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) [2021-11-01 09:07:59,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1)) || (((lhs == 0 && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) [2021-11-01 09:07:59,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) || (((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && s_tolower_table <= 0) && \valid[\result] == 1) [2021-11-01 09:07:59,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) && \result == 0) || (((((((((!(len_b == len_a) || lhs_len == rhs_len) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && !(rhs == 0)) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && !(array == 0))) || ((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) && \result == 0)) || ((((((((\old_byte_from_rhs == 0 && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((array == 0 && (!(len_b == len_a) || lhs_len == rhs_len)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && storage == 0) && !(array == 0))) || ((((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && (!(len_b == len_a) || lhs_len == rhs_len)) && \valid[lhs] == 1) && !(\old_byte_from_lhs == 0)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && !(lhs == storage)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && lhs_len == rhs_len) && \result == 0) || (((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)))) && \valid[\result] == 1) && \old_byte_from_lhs == 0)) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((!(len_b == len_a) || lhs_len == rhs_len) && rhs == 0) && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && \result == 0) && \result == 0) || ((((((((((((!(len_b == len_a) || lhs_len == rhs_len) && !(\old_byte_from_lhs == 0)) && !(\result == 0)) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && \result == 0) && !(rhs == 0)) && !(array == 0)))) [2021-11-01 09:07:59,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && len_b == len_a) && \result == 0) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)) && \result == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && len_b == len_a) && lhs_len == rhs_len) && \result == 0)))) || ((((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0))) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && (((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)))) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)) [2021-11-01 09:07:59,776 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-01 09:07:59,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-01 09:07:59,777 INFO L158 Benchmark]: Toolchain (without parser) took 155116.26ms. Allocated memory was 107.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 70.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-11-01 09:07:59,777 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory was 63.1MB in the beginning and 63.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-01 09:07:59,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1751.13ms. Allocated memory was 107.0MB in the beginning and 132.1MB in the end (delta: 25.2MB). Free memory was 70.5MB in the beginning and 72.9MB in the end (delta: -2.4MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2021-11-01 09:07:59,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.83ms. Allocated memory is still 132.1MB. Free memory was 72.9MB in the beginning and 61.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-01 09:07:59,777 INFO L158 Benchmark]: Boogie Preprocessor took 85.00ms. Allocated memory is still 132.1MB. Free memory was 61.1MB in the beginning and 53.4MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-01 09:07:59,778 INFO L158 Benchmark]: RCFGBuilder took 4028.78ms. Allocated memory was 132.1MB in the beginning and 530.6MB in the end (delta: 398.5MB). Free memory was 53.4MB in the beginning and 455.9MB in the end (delta: -402.5MB). Peak memory consumption was 298.0MB. Max. memory is 16.1GB. [2021-11-01 09:07:59,778 INFO L158 Benchmark]: TraceAbstraction took 148549.61ms. Allocated memory was 530.6MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 454.8MB in the beginning and 1.3GB in the end (delta: -800.8MB). Peak memory consumption was 973.7MB. Max. memory is 16.1GB. [2021-11-01 09:07:59,778 INFO L158 Benchmark]: Witness Printer took 537.18ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.4GB in the end (delta: -148.3MB). Peak memory consumption was 706.7MB. Max. memory is 16.1GB. [2021-11-01 09:07:59,779 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory was 63.1MB in the beginning and 63.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1751.13ms. Allocated memory was 107.0MB in the beginning and 132.1MB in the end (delta: 25.2MB). Free memory was 70.5MB in the beginning and 72.9MB in the end (delta: -2.4MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.83ms. Allocated memory is still 132.1MB. Free memory was 72.9MB in the beginning and 61.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.00ms. Allocated memory is still 132.1MB. Free memory was 61.1MB in the beginning and 53.4MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 4028.78ms. Allocated memory was 132.1MB in the beginning and 530.6MB in the end (delta: 398.5MB). Free memory was 53.4MB in the beginning and 455.9MB in the end (delta: -402.5MB). Peak memory consumption was 298.0MB. Max. memory is 16.1GB. * TraceAbstraction took 148549.61ms. Allocated memory was 530.6MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 454.8MB in the beginning and 1.3GB in the end (delta: -800.8MB). Peak memory consumption was 973.7MB. Max. memory is 16.1GB. * Witness Printer took 537.18ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.4GB in the end (delta: -148.3MB). Peak memory consumption was 706.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 148401.62ms, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 25.13ms, AutomataDifference: 84635.32ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 15699.33ms, InitialAbstractionConstructionTime: 6.60ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 4025 SdHoareTripleChecker+Valid, 73240.84ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4025 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 67214.99ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5588 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9122 IncrementalHoareTripleChecker+Invalid, 9297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 0 mSDtfsCounter, 9122 mSolverCounterSat, 118.16ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 15672.32ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=8, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 184.27ms AutomataMinimizationTime, 19 MinimizatonAttempts, 555 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 85 NumberOfFragments, 2871 HoareAnnotationTreeSize, 12 FomulaSimplifications, 12887 FormulaSimplificationTreeSizeReduction, 212.86ms HoareSimplificationTime, 12 FomulaSimplificationsInter, 6251 FormulaSimplificationTreeSizeReductionInter, 15475.66ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 312.67ms SsaConstructionTime, 37379.89ms SatisfiabilityAnalysisTime, 9834.78ms InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 5286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \result == 0) || (((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \valid[\old_byte_from_lhs] == 1)) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) || (((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && s_tolower_table <= 0) && \valid[\result] == 1) - InvariantResult [Line: 7675]: Loop Invariant Derived loop invariant: ((((((((((((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) && \result == 0) || (((((((((!(len_b == len_a) || lhs_len == rhs_len) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && !(rhs == 0)) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && !(array == 0))) || ((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) && \result == 0)) || ((((((((\old_byte_from_rhs == 0 && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((array == 0 && (!(len_b == len_a) || lhs_len == rhs_len)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && storage == 0) && !(array == 0))) || ((((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && (!(len_b == len_a) || lhs_len == rhs_len)) && \valid[lhs] == 1) && !(\old_byte_from_lhs == 0)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && !(lhs == storage)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && lhs_len == rhs_len) && \result == 0) || (((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)))) && \valid[\result] == 1) && \old_byte_from_lhs == 0)) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((!(len_b == len_a) || lhs_len == rhs_len) && rhs == 0) && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && \result == 0) && \result == 0) || ((((((((((((!(len_b == len_a) || lhs_len == rhs_len) && !(\old_byte_from_lhs == 0)) && !(\result == 0)) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && \result == 0) && !(rhs == 0)) && !(array == 0)))) - InvariantResult [Line: 7694]: Loop Invariant Derived loop invariant: (((((lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && len_b == len_a) && \result == 0) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)) && \result == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && len_b == len_a) && lhs_len == rhs_len) && \result == 0)))) || ((((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0))) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && (((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)))) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((0 <= s_tolower_table && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) || ((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && !(lhs == 0)) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 6899]: Loop Invariant Derived loop invariant: (((0 <= s_tolower_table && \result == 0) && s_tolower_table <= 0) && \result == 0) || (((((((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((\result + 1 <= unknown-#StackHeapBarrier-unknown && !(\old_byte_from_lhs == storage)) && !(lhs == storage)) && \old_byte_from_lhs == 0) && ((((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1) || ((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)))) && \valid[\old_byte_from_lhs] == 1)) || ((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 6899]: Loop Invariant Derived loop invariant: (((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1)) || (((lhs == 0 && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 9006]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \valid[\result] == 1 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((0 <= s_tolower_table && lhs == 0) && lhs == 0) && s_tolower_table <= 0) || (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: s_tolower_table == 0 RESULT: Ultimate proved your program to be correct! [2021-11-01 09:07:59,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...