./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_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 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 12:58:36,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 12:58:36,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 12:58:36,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 12:58:36,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 12:58:36,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 12:58:36,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 12:58:36,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 12:58:36,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 12:58:36,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 12:58:36,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 12:58:36,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 12:58:36,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 12:58:36,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 12:58:36,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 12:58:36,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 12:58:36,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 12:58:36,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 12:58:36,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 12:58:36,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 12:58:36,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 12:58:36,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 12:58:36,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 12:58:36,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 12:58:36,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 12:58:36,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 12:58:36,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 12:58:36,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 12:58:36,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 12:58:36,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 12:58:36,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 12:58:36,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 12:58:36,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 12:58:36,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 12:58:36,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 12:58:36,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 12:58:36,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 12:58:36,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 12:58:36,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 12:58:36,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 12:58:36,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 12:58:36,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 12:58:36,587 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 12:58:36,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 12:58:36,591 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 12:58:36,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 12:58:36,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 12:58:36,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 12:58:36,594 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 12:58:36,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 12:58:36,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 12:58:36,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 12:58:36,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 12:58:36,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 12:58:36,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 12:58:36,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 12:58:36,596 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 12:58:36,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 12:58:36,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 12:58:36,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 12:58:36,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 12:58:36,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 12:58:36,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 12:58:36,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 12:58:36,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 12:58:36,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 12:58:36,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 12:58:36,598 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 12:58:36,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 12:58:36,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 12:58:36,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 12:58:36,606 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 -> 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 [2021-11-05 12:58:36,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 12:58:36,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 12:58:36,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 12:58:36,926 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 12:58:36,927 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 12:58:36,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-05 12:58:36,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264bc3535/1a770e3a3134473691c4da4c6b6d63db/FLAG8e524b131 [2021-11-05 12:58:37,700 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 12:58:37,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-05 12:58:37,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264bc3535/1a770e3a3134473691c4da4c6b6d63db/FLAG8e524b131 [2021-11-05 12:58:37,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264bc3535/1a770e3a3134473691c4da4c6b6d63db [2021-11-05 12:58:37,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 12:58:37,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 12:58:37,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 12:58:37,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 12:58:37,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 12:58:37,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 12:58:37" (1/1) ... [2021-11-05 12:58:37,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d59a75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:37, skipping insertion in model container [2021-11-05 12:58:37,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 12:58:37" (1/1) ... [2021-11-05 12:58:37,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 12:58:37,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 12:58:38,190 WARN L228 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_hash_table_clean_up_harness.i[4497,4510] [2021-11-05 12:58:38,195 WARN L228 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_hash_table_clean_up_harness.i[4557,4570] [2021-11-05 12:58:38,211 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 12:58:38,216 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 12:58:38,882 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,885 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,886 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,896 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,896 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,898 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,898 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,900 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,900 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,901 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:38,901 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,173 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 12:58:39,174 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 12:58:39,175 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 12:58:39,176 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 12:58:39,180 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 12:58:39,181 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 12:58:39,182 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 12:58:39,191 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 12:58:39,192 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 12:58:39,193 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 12:58:39,331 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 12:58:39,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,611 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,613 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,619 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,620 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,643 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,643 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,646 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,646 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,646 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,647 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,647 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 12:58:39,718 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 12:58:39,729 WARN L228 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_hash_table_clean_up_harness.i[4497,4510] [2021-11-05 12:58:39,730 WARN L228 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_hash_table_clean_up_harness.i[4557,4570] [2021-11-05 12:58:39,731 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 12:58:39,736 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 12:58:39,757 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,758 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,758 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,758 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,758 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,765 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,766 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,767 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,767 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,768 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,768 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,770 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,770 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,791 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 12:58:39,793 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 12:58:39,794 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 12:58:39,794 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 12:58:39,795 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 12:58:39,813 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 12:58:39,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 12:58:39,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 12:58:39,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 12:58:39,815 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 12:58:39,837 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 12:58:39,908 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,909 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,914 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,914 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,915 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,916 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,937 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,938 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,938 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,939 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,940 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,940 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,940 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:58:39,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 12:58:40,205 INFO L208 MainTranslator]: Completed translation [2021-11-05 12:58:40,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40 WrapperNode [2021-11-05 12:58:40,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 12:58:40,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 12:58:40,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 12:58:40,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 12:58:40,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 12:58:40,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 12:58:40,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 12:58:40,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 12:58:40,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 12:58:40,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 12:58:40,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 12:58:40,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 12:58:40,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (1/1) ... [2021-11-05 12:58:40,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 12:58:40,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:58:40,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-05 12:58:40,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-05 12:58:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-05 12:58:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 12:58:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 12:58:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 12:58:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 12:58:40,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 12:58:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-05 12:58:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 12:58:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-05 12:58:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 12:58:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 12:58:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 12:58:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 12:58:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 12:58:47,770 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 12:58:47,771 INFO L299 CfgBuilder]: Removed 144 assume(true) statements. [2021-11-05 12:58:47,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:58:47 BoogieIcfgContainer [2021-11-05 12:58:47,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 12:58:47,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 12:58:47,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 12:58:47,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 12:58:47,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 12:58:37" (1/3) ... [2021-11-05 12:58:47,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1a359c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 12:58:47, skipping insertion in model container [2021-11-05 12:58:47,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:58:40" (2/3) ... [2021-11-05 12:58:47,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1a359c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 12:58:47, skipping insertion in model container [2021-11-05 12:58:47,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:58:47" (3/3) ... [2021-11-05 12:58:47,779 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2021-11-05 12:58:47,784 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 12:58:47,784 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-05 12:58:47,823 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 12:58:47,827 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-05 12:58:47,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-05 12:58:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 143 states have (on average 1.4055944055944056) internal successors, (201), 149 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-05 12:58:47,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:58:47,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:58:47,849 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:58:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:58:47,853 INFO L85 PathProgramCache]: Analyzing trace with hash 937862733, now seen corresponding path program 1 times [2021-11-05 12:58:47,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:58:47,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186154705] [2021-11-05 12:58:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:58:47,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:58:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:58:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:58:48,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:58:48,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186154705] [2021-11-05 12:58:48,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186154705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:58:48,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:58:48,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 12:58:48,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885225532] [2021-11-05 12:58:48,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:58:48,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-05 12:58:48,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:58:48,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-05 12:58:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 12:58:48,413 INFO L87 Difference]: Start difference. First operand has 150 states, 143 states have (on average 1.4055944055944056) internal successors, (201), 149 states have internal predecessors, (201), 0 states have call successors, (0), 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 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:58:48,433 INFO L93 Difference]: Finished difference Result 296 states and 397 transitions. [2021-11-05 12:58:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 12:58:48,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-05 12:58:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:58:48,441 INFO L225 Difference]: With dead ends: 296 [2021-11-05 12:58:48,441 INFO L226 Difference]: Without dead ends: 144 [2021-11-05 12:58:48,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 12:58:48,445 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.32ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 12:58:48,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 1.32ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 12:58:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-05 12:58:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-05 12:58:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 143 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 171 transitions. [2021-11-05 12:58:48,472 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 171 transitions. Word has length 55 [2021-11-05 12:58:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:58:48,473 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 171 transitions. [2021-11-05 12:58:48,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 171 transitions. [2021-11-05 12:58:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-05 12:58:48,474 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:58:48,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:58:48,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 12:58:48,475 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:58:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:58:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1984184949, now seen corresponding path program 1 times [2021-11-05 12:58:48,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:58:48,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620665033] [2021-11-05 12:58:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:58:48,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:58:48,549 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 12:58:48,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649607290] [2021-11-05 12:58:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:58:48,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:58:48,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:58:48,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 12:58:48,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-05 12:58:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:58:49,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 2472 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 12:58:49,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 12:58:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:58:49,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 12:58:49,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:58:49,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620665033] [2021-11-05 12:58:49,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 12:58:49,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649607290] [2021-11-05 12:58:49,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649607290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:58:49,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:58:49,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:58:49,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943663292] [2021-11-05 12:58:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:58:49,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:58:49,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:58:49,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:58:49,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:58:49,629 INFO L87 Difference]: Start difference. First operand 144 states and 171 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:58:49,766 INFO L93 Difference]: Finished difference Result 398 states and 474 transitions. [2021-11-05 12:58:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:58:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-05 12:58:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:58:49,770 INFO L225 Difference]: With dead ends: 398 [2021-11-05 12:58:49,770 INFO L226 Difference]: Without dead ends: 276 [2021-11-05 12:58:49,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 115.66ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:58:49,772 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 311 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.01ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.04ms IncrementalHoareTripleChecker+Time [2021-11-05 12:58:49,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 959 Invalid, 16 Unknown, 0 Unchecked, 8.01ms Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 50.04ms Time] [2021-11-05 12:58:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-05 12:58:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 147. [2021-11-05 12:58:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 146 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2021-11-05 12:58:49,782 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 55 [2021-11-05 12:58:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:58:49,782 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2021-11-05 12:58:49,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2021-11-05 12:58:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-05 12:58:49,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:58:49,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:58:49,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-05 12:58:49,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:58:49,994 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:58:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:58:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1945028463, now seen corresponding path program 1 times [2021-11-05 12:58:49,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:58:49,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825240212] [2021-11-05 12:58:49,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:58:49,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:58:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:58:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:58:50,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:58:50,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825240212] [2021-11-05 12:58:50,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825240212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:58:50,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:58:50,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:58:50,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663540477] [2021-11-05 12:58:50,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:58:50,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:58:50,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:58:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:58:50,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:58:50,503 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:52,546 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-05 12:58:54,671 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:58:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:58:55,598 INFO L93 Difference]: Finished difference Result 262 states and 311 transitions. [2021-11-05 12:58:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-05 12:58:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-05 12:58:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:58:55,600 INFO L225 Difference]: With dead ends: 262 [2021-11-05 12:58:55,600 INFO L226 Difference]: Without dead ends: 153 [2021-11-05 12:58:55,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 465.72ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-05 12:58:55,601 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 369 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4465.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.50ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4781.32ms IncrementalHoareTripleChecker+Time [2021-11-05 12:58:55,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 691 Invalid, 151 Unknown, 0 Unchecked, 6.50ms Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 4781.32ms Time] [2021-11-05 12:58:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-05 12:58:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2021-11-05 12:58:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 148 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2021-11-05 12:58:55,627 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 57 [2021-11-05 12:58:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:58:55,627 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2021-11-05 12:58:55,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2021-11-05 12:58:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-05 12:58:55,629 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:58:55,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:58:55,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 12:58:55,630 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:58:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:58:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1101022961, now seen corresponding path program 1 times [2021-11-05 12:58:55,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:58:55,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591117819] [2021-11-05 12:58:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:58:55,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:58:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:58:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:58:55,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:58:55,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591117819] [2021-11-05 12:58:55,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591117819] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:58:55,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:58:55,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:58:55,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739345992] [2021-11-05 12:58:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:58:55,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:58:55,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:58:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:58:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:58:55,850 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:58:55,971 INFO L93 Difference]: Finished difference Result 261 states and 309 transitions. [2021-11-05 12:58:55,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 12:58:55,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-05 12:58:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:58:55,973 INFO L225 Difference]: With dead ends: 261 [2021-11-05 12:58:55,973 INFO L226 Difference]: Without dead ends: 147 [2021-11-05 12:58:55,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.33ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:58:55,974 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 147 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.49ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 111.02ms IncrementalHoareTripleChecker+Time [2021-11-05 12:58:55,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 305 Invalid, 34 Unknown, 0 Unchecked, 1.49ms Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 111.02ms Time] [2021-11-05 12:58:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-05 12:58:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-11-05 12:58:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 146 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2021-11-05 12:58:55,983 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 57 [2021-11-05 12:58:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:58:55,984 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2021-11-05 12:58:55,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2021-11-05 12:58:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-05 12:58:55,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:58:55,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:58:55,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 12:58:55,986 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:58:55,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:58:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2001669686, now seen corresponding path program 1 times [2021-11-05 12:58:55,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:58:55,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090374183] [2021-11-05 12:58:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:58:55,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:58:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:58:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:58:56,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:58:56,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090374183] [2021-11-05 12:58:56,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090374183] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:58:56,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:58:56,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:58:56,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292993125] [2021-11-05 12:58:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:58:56,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:58:56,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:58:56,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:58:56,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:58:56,297 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:58:58,335 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-05 12:59:00,475 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:01,238 INFO L93 Difference]: Finished difference Result 260 states and 305 transitions. [2021-11-05 12:59:01,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 12:59:01,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-05 12:59:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:01,239 INFO L225 Difference]: With dead ends: 260 [2021-11-05 12:59:01,239 INFO L226 Difference]: Without dead ends: 150 [2021-11-05 12:59:01,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 338.20ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:59:01,240 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 158 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4372.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.24ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4679.03ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:01,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 386 Invalid, 119 Unknown, 0 Unchecked, 3.24ms Time], IncrementalHoareTripleChecker [24 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 4679.03ms Time] [2021-11-05 12:59:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-05 12:59:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2021-11-05 12:59:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 146 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2021-11-05 12:59:01,247 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 59 [2021-11-05 12:59:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:01,247 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2021-11-05 12:59:01,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2021-11-05 12:59:01,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-05 12:59:01,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:01,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:01,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 12:59:01,249 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1973786693, now seen corresponding path program 1 times [2021-11-05 12:59:01,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:01,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513842069] [2021-11-05 12:59:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:01,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:59:02,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:59:02,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513842069] [2021-11-05 12:59:02,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513842069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:59:02,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:59:02,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:59:02,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555906891] [2021-11-05 12:59:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:59:02,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:59:02,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:59:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:59:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:59:02,083 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-05 12:59:04,132 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:06,252 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:07,138 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2021-11-05 12:59:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 12:59:07,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-05 12:59:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:07,157 INFO L225 Difference]: With dead ends: 161 [2021-11-05 12:59:07,157 INFO L226 Difference]: Without dead ends: 157 [2021-11-05 12:59:07,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 379.99ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:59:07,158 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 189 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4465.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.78ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4774.88ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:07,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 513 Invalid, 136 Unknown, 0 Unchecked, 3.78ms Time], IncrementalHoareTripleChecker [7 Valid, 127 Invalid, 2 Unknown, 0 Unchecked, 4774.88ms Time] [2021-11-05 12:59:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-05 12:59:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2021-11-05 12:59:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 142 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2021-11-05 12:59:07,164 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 60 [2021-11-05 12:59:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:07,165 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2021-11-05 12:59:07,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-05 12:59:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2021-11-05 12:59:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-05 12:59:07,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:07,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:07,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 12:59:07,166 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1344954047, now seen corresponding path program 1 times [2021-11-05 12:59:07,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:07,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994938962] [2021-11-05 12:59:07,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:07,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:59:09,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:59:09,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994938962] [2021-11-05 12:59:09,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994938962] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:59:09,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:59:09,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-05 12:59:09,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170414441] [2021-11-05 12:59:09,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:59:09,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-05 12:59:09,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:59:09,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-05 12:59:09,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-11-05 12:59:09,681 INFO L87 Difference]: Start difference. First operand 143 states and 164 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:11,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-05 12:59:13,879 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:15,986 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:18,182 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:20,388 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:22,549 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:24,721 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:26,891 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:29,059 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:31,227 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:36,187 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2021-11-05 12:59:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-05 12:59:36,188 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-05 12:59:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:36,188 INFO L225 Difference]: With dead ends: 174 [2021-11-05 12:59:36,189 INFO L226 Difference]: Without dead ends: 164 [2021-11-05 12:59:36,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 4100.38ms TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2021-11-05 12:59:36,190 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 775 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 59 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21884.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.55ms SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23694.83ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:36,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 1402 Invalid, 661 Unknown, 0 Unchecked, 12.55ms Time], IncrementalHoareTripleChecker [59 Valid, 592 Invalid, 10 Unknown, 0 Unchecked, 23694.83ms Time] [2021-11-05 12:59:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-05 12:59:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2021-11-05 12:59:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1726618705035972) internal successors, (163), 142 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2021-11-05 12:59:36,198 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 66 [2021-11-05 12:59:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:36,198 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2021-11-05 12:59:36,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2021-11-05 12:59:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-05 12:59:36,199 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:36,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:36,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 12:59:36,200 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1471234926, now seen corresponding path program 1 times [2021-11-05 12:59:36,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:36,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784769215] [2021-11-05 12:59:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:36,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:59:36,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:59:36,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784769215] [2021-11-05 12:59:36,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784769215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:59:36,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:59:36,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:59:36,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460800164] [2021-11-05 12:59:36,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:59:36,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:59:36,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:59:36,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:59:36,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:59:36,553 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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-05 12:59:38,596 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-05 12:59:40,765 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:41,362 INFO L93 Difference]: Finished difference Result 215 states and 246 transitions. [2021-11-05 12:59:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:59:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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) Word has length 71 [2021-11-05 12:59:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:41,365 INFO L225 Difference]: With dead ends: 215 [2021-11-05 12:59:41,365 INFO L226 Difference]: Without dead ends: 143 [2021-11-05 12:59:41,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 142.28ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:59:41,366 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 25 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4348.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.98ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4750.03ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:41,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 514 Invalid, 90 Unknown, 0 Unchecked, 1.98ms Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 4750.03ms Time] [2021-11-05 12:59:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-05 12:59:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-05 12:59:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 142 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2021-11-05 12:59:41,374 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 71 [2021-11-05 12:59:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:41,374 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2021-11-05 12:59:41,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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-05 12:59:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2021-11-05 12:59:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-05 12:59:41,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:41,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:41,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 12:59:41,376 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1507166216, now seen corresponding path program 1 times [2021-11-05 12:59:41,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:41,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378681652] [2021-11-05 12:59:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:41,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:59:41,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:59:41,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378681652] [2021-11-05 12:59:41,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378681652] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:59:41,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:59:41,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:59:41,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007458499] [2021-11-05 12:59:41,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:59:41,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:59:41,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:59:41,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:59:41,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:59:41,833 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:43,887 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:59:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:44,794 INFO L93 Difference]: Finished difference Result 233 states and 266 transitions. [2021-11-05 12:59:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 12:59:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-11-05 12:59:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:44,795 INFO L225 Difference]: With dead ends: 233 [2021-11-05 12:59:44,795 INFO L226 Difference]: Without dead ends: 159 [2021-11-05 12:59:44,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 429.90ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:59:44,796 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 157 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2413.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.34ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2659.09ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:44,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 467 Invalid, 115 Unknown, 0 Unchecked, 2.34ms Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 1 Unknown, 0 Unchecked, 2659.09ms Time] [2021-11-05 12:59:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-05 12:59:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2021-11-05 12:59:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.1608391608391608) internal successors, (166), 146 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2021-11-05 12:59:44,807 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 76 [2021-11-05 12:59:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:44,809 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2021-11-05 12:59:44,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2021-11-05 12:59:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-05 12:59:44,810 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:44,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:44,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 12:59:44,811 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:44,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1309389368, now seen corresponding path program 1 times [2021-11-05 12:59:44,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:44,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339641064] [2021-11-05 12:59:44,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:44,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:59:45,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:59:45,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339641064] [2021-11-05 12:59:45,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339641064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:59:45,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:59:45,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:59:45,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874847155] [2021-11-05 12:59:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:59:45,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:59:45,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:59:45,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:59:45,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:59:45,184 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:45,498 INFO L93 Difference]: Finished difference Result 224 states and 253 transitions. [2021-11-05 12:59:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 12:59:45,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-11-05 12:59:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:45,500 INFO L225 Difference]: With dead ends: 224 [2021-11-05 12:59:45,500 INFO L226 Difference]: Without dead ends: 143 [2021-11-05 12:59:45,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 254.33ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:59:45,501 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 369 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 152.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 163.42ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:45,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 326 Invalid, 58 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 163.42ms Time] [2021-11-05 12:59:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-05 12:59:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-05 12:59:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1366906474820144) internal successors, (158), 142 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2021-11-05 12:59:45,508 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 76 [2021-11-05 12:59:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:45,508 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2021-11-05 12:59:45,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2021-11-05 12:59:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-05 12:59:45,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:45,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:45,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 12:59:45,512 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:45,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:45,513 INFO L85 PathProgramCache]: Analyzing trace with hash -630391455, now seen corresponding path program 1 times [2021-11-05 12:59:45,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:45,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456938965] [2021-11-05 12:59:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:45,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:59:45,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:59:45,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456938965] [2021-11-05 12:59:45,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456938965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:59:45,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:59:45,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 12:59:45,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239720038] [2021-11-05 12:59:45,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:59:45,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 12:59:45,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:59:45,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 12:59:45,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 12:59:45,705 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:45,733 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2021-11-05 12:59:45,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 12:59:45,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-11-05 12:59:45,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:45,735 INFO L225 Difference]: With dead ends: 191 [2021-11-05 12:59:45,735 INFO L226 Difference]: Without dead ends: 144 [2021-11-05 12:59:45,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.82ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 12:59:45,736 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.32ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.20ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:45,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.32ms Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 21.20ms Time] [2021-11-05 12:59:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-05 12:59:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-05 12:59:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.1357142857142857) internal successors, (159), 143 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2021-11-05 12:59:45,743 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 82 [2021-11-05 12:59:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:45,744 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2021-11-05 12:59:45,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2021-11-05 12:59:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-05 12:59:45,745 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:45,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:45,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 12:59:45,746 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:45,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1144615907, now seen corresponding path program 1 times [2021-11-05 12:59:45,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:45,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115635655] [2021-11-05 12:59:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:45,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:59:46,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:59:46,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115635655] [2021-11-05 12:59:46,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115635655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:59:46,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:59:46,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:59:46,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650836316] [2021-11-05 12:59:46,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:59:46,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:59:46,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:59:46,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:59:46,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:59:46,157 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:46,242 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2021-11-05 12:59:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 12:59:46,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-11-05 12:59:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:46,243 INFO L225 Difference]: With dead ends: 144 [2021-11-05 12:59:46,243 INFO L226 Difference]: Without dead ends: 142 [2021-11-05 12:59:46,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:59:46,244 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 49 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.63ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.14ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:46,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 393 Invalid, 14 Unknown, 0 Unchecked, 0.63ms Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 47.14ms Time] [2021-11-05 12:59:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-05 12:59:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-11-05 12:59:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 139 states have (on average 1.129496402877698) internal successors, (157), 141 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2021-11-05 12:59:46,250 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 82 [2021-11-05 12:59:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:46,250 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2021-11-05 12:59:46,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2021-11-05 12:59:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-05 12:59:46,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:46,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:46,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 12:59:46,251 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash 464392901, now seen corresponding path program 1 times [2021-11-05 12:59:46,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:46,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318190925] [2021-11-05 12:59:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:46,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:59:47,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:59:47,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318190925] [2021-11-05 12:59:47,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318190925] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:59:47,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:59:47,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:59:47,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248980702] [2021-11-05 12:59:47,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:59:47,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:59:47,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:59:47,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:59:47,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:59:47,391 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:59:47,567 INFO L93 Difference]: Finished difference Result 259 states and 285 transitions. [2021-11-05 12:59:47,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 12:59:47,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-05 12:59:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:59:47,569 INFO L225 Difference]: With dead ends: 259 [2021-11-05 12:59:47,569 INFO L226 Difference]: Without dead ends: 142 [2021-11-05 12:59:47,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.77ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:59:47,570 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.91ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 132.80ms IncrementalHoareTripleChecker+Time [2021-11-05 12:59:47,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 423 Invalid, 35 Unknown, 0 Unchecked, 0.91ms Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 132.80ms Time] [2021-11-05 12:59:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-05 12:59:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2021-11-05 12:59:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 136 states have (on average 1.1176470588235294) internal successors, (152), 138 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2021-11-05 12:59:47,576 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 84 [2021-11-05 12:59:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:59:47,576 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2021-11-05 12:59:47,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:59:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2021-11-05 12:59:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 12:59:47,578 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:59:47,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:59:47,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 12:59:47,579 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 12:59:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:59:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1560379032, now seen corresponding path program 1 times [2021-11-05 12:59:47,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:59:47,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435842557] [2021-11-05 12:59:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:47,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:59:47,635 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 12:59:47,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363870593] [2021-11-05 12:59:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:59:47,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:59:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:59:47,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 12:59:47,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-05 12:59:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:59:49,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 139 conjunts are in the unsatisfiable core [2021-11-05 12:59:49,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 12:59:49,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-05 12:59:50,023 INFO L354 Elim1Store]: treesize reduction 133, result has 15.3 percent of original size [2021-11-05 12:59:50,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 53 [2021-11-05 12:59:50,900 INFO L354 Elim1Store]: treesize reduction 112, result has 15.8 percent of original size [2021-11-05 12:59:50,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 41 [2021-11-05 12:59:51,713 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-05 12:59:51,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 45 [2021-11-05 12:59:52,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:59:52,656 INFO L354 Elim1Store]: treesize reduction 66, result has 32.7 percent of original size [2021-11-05 12:59:52,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 58 [2021-11-05 12:59:53,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-05 12:59:53,608 INFO L354 Elim1Store]: treesize reduction 156, result has 17.5 percent of original size [2021-11-05 12:59:53,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 75 treesize of output 92 [2021-11-05 12:59:54,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-05 13:00:10,982 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-05 13:00:10,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 87 [2021-11-05 13:00:11,050 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-05 13:00:11,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 91 [2021-11-05 13:00:15,591 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-05 13:00:15,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 95 [2021-11-05 13:00:15,650 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-05 13:00:15,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 94 [2021-11-05 13:00:18,854 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-05 13:00:18,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 118 [2021-11-05 13:00:18,950 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-05 13:00:18,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 129 [2021-11-05 13:00:19,222 INFO L354 Elim1Store]: treesize reduction 88, result has 37.6 percent of original size [2021-11-05 13:00:19,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 143 [2021-11-05 13:00:20,359 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-05 13:00:20,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 51 [2021-11-05 13:00:20,437 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-05 13:00:20,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 47 [2021-11-05 13:00:21,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-11-05 13:00:22,040 INFO L354 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2021-11-05 13:00:22,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 41 [2021-11-05 13:00:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:00:22,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:00:22,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:00:22,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435842557] [2021-11-05 13:00:22,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:00:22,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363870593] [2021-11-05 13:00:22,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363870593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:00:22,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:00:22,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-05 13:00:22,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402528934] [2021-11-05 13:00:22,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:00:22,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-05 13:00:22,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:00:22,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-05 13:00:22,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-11-05 13:00:22,212 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:00:24,254 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-05 13:00:26,471 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:00:28,658 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:00:30,879 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-05 13:00:33,094 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:00:35,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:00:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:00:36,938 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2021-11-05 13:00:36,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-05 13:00:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-05 13:00:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:00:36,947 INFO L225 Difference]: With dead ends: 226 [2021-11-05 13:00:36,947 INFO L226 Difference]: Without dead ends: 181 [2021-11-05 13:00:36,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3136.64ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-11-05 13:00:36,948 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 109 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12780.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.27ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 14039.72ms IncrementalHoareTripleChecker+Time [2021-11-05 13:00:36,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 1992 Invalid, 586 Unknown, 0 Unchecked, 5.27ms Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 6 Unknown, 385 Unchecked, 14039.72ms Time] [2021-11-05 13:00:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-05 13:00:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2021-11-05 13:00:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.0971428571428572) internal successors, (192), 177 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:00:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2021-11-05 13:00:36,958 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 87 [2021-11-05 13:00:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:00:36,959 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2021-11-05 13:00:36,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:00:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2021-11-05 13:00:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 13:00:36,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:00:36,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:00:37,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-05 13:00:37,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-05 13:00:37,169 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 13:00:37,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:00:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash -378783014, now seen corresponding path program 1 times [2021-11-05 13:00:37,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:00:37,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743390514] [2021-11-05 13:00:37,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:00:37,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:00:37,243 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:00:37,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946984140] [2021-11-05 13:00:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:00:37,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:00:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:00:37,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 13:00:37,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-05 13:04:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:04:09,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 358 conjunts are in the unsatisfiable core [2021-11-05 13:04:09,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:04:09,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-05 13:04:10,307 INFO L354 Elim1Store]: treesize reduction 133, result has 15.3 percent of original size [2021-11-05 13:04:10,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 53 [2021-11-05 13:04:10,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-05 13:04:11,807 INFO L354 Elim1Store]: treesize reduction 112, result has 15.8 percent of original size [2021-11-05 13:04:11,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 41 [2021-11-05 13:04:12,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-05 13:04:13,359 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-05 13:04:13,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 63 [2021-11-05 13:04:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:04:15,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:04:15,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:04:15,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743390514] [2021-11-05 13:04:15,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:04:15,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946984140] [2021-11-05 13:04:15,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946984140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:04:15,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:04:15,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 13:04:15,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014755378] [2021-11-05 13:04:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:04:15,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 13:04:15,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:04:15,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 13:04:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-05 13:04:15,251 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:04:17,294 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-05 13:04:19,489 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:04:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:04:20,558 INFO L93 Difference]: Finished difference Result 347 states and 374 transitions. [2021-11-05 13:04:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-05 13:04:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-05 13:04:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:04:20,560 INFO L225 Difference]: With dead ends: 347 [2021-11-05 13:04:20,560 INFO L226 Difference]: Without dead ends: 188 [2021-11-05 13:04:20,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2586.67ms TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-11-05 13:04:20,561 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 29 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4232.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.05ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 4673.93ms IncrementalHoareTripleChecker+Time [2021-11-05 13:04:20,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 873 Invalid, 157 Unknown, 0 Unchecked, 2.05ms Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 2 Unknown, 105 Unchecked, 4673.93ms Time] [2021-11-05 13:04:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-05 13:04:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2021-11-05 13:04:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 180 states have (on average 1.0944444444444446) internal successors, (197), 182 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:04:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2021-11-05 13:04:20,570 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 87 [2021-11-05 13:04:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:04:20,570 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2021-11-05 13:04:20,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:04:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2021-11-05 13:04:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-05 13:04:20,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:04:20,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:04:20,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-05 13:04:20,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:04:20,787 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 13:04:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:04:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash -245451586, now seen corresponding path program 1 times [2021-11-05 13:04:20,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:04:20,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018575156] [2021-11-05 13:04:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:04:20,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:04:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:04:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:04:21,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:04:21,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018575156] [2021-11-05 13:04:21,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018575156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:04:21,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:04:21,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:04:21,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670094761] [2021-11-05 13:04:21,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:04:21,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:04:21,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:04:21,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:04:21,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:04:21,125 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:04:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:04:21,300 INFO L93 Difference]: Finished difference Result 344 states and 370 transitions. [2021-11-05 13:04:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:04:21,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-11-05 13:04:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:04:21,301 INFO L225 Difference]: With dead ends: 344 [2021-11-05 13:04:21,301 INFO L226 Difference]: Without dead ends: 176 [2021-11-05 13:04:21,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 167.68ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:04:21,302 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 137 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.23ms IncrementalHoareTripleChecker+Time [2021-11-05 13:04:21,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 597 Invalid, 22 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 68.23ms Time] [2021-11-05 13:04:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-05 13:04:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-11-05 13:04:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 175 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:04:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2021-11-05 13:04:21,312 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 89 [2021-11-05 13:04:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:04:21,312 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2021-11-05 13:04:21,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:04:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2021-11-05 13:04:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-05 13:04:21,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:04:21,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:04:21,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 13:04:21,313 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-05 13:04:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:04:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1294211146, now seen corresponding path program 1 times [2021-11-05 13:04:21,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:04:21,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778047476] [2021-11-05 13:04:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:04:21,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:04:21,402 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:04:21,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812001393] [2021-11-05 13:04:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:04:21,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:04:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:04:21,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 13:04:21,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-05 13:04:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:04:22,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-05 13:04:22,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:04:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:04:22,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:04:22,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:04:22,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778047476] [2021-11-05 13:04:22,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:04:22,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812001393] [2021-11-05 13:04:22,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812001393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:04:22,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:04:22,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:04:22,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305917693] [2021-11-05 13:04:22,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:04:22,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:04:22,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:04:22,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:04:22,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:04:22,514 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:04:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:04:22,651 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2021-11-05 13:04:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:04:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-11-05 13:04:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:04:22,651 INFO L225 Difference]: With dead ends: 176 [2021-11-05 13:04:22,651 INFO L226 Difference]: Without dead ends: 0 [2021-11-05 13:04:22,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 179.03ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:04:22,652 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.17ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.17ms IncrementalHoareTripleChecker+Time [2021-11-05 13:04:22,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 10 Unknown, 0 Unchecked, 0.17ms Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 42.17ms Time] [2021-11-05 13:04:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-05 13:04:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-05 13:04:22,653 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-05 13:04:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-05 13:04:22,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2021-11-05 13:04:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:04:22,653 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-05 13:04:22,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:04:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-05 13:04:22,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-05 13:04:22,656 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-05 13:04:22,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-05 13:04:22,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-11-05 13:04:22,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-11-05 13:04:22,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-11-05 13:04:22,657 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-05 13:04:22,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-05 13:04:22,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-05 13:04:22,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-05 13:04:22,912 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,913 INFO L858 garLoopResultBuilder]: For program point L9285(lines 9285 9287) no Hoare annotation was computed. [2021-11-05 13:04:22,913 INFO L858 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2021-11-05 13:04:22,913 INFO L858 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2021-11-05 13:04:22,913 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-05 13:04:22,913 INFO L854 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-11-05 13:04:22,914 INFO L858 garLoopResultBuilder]: For program point L7175(lines 1 10161) no Hoare annotation was computed. [2021-11-05 13:04:22,914 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse3 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse5 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse6 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse7 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse8 (= .cse12 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0))) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse10 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8)) (.cse11 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse13 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse14 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse15 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0))) (.cse16 (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5|) 0))) (.cse17 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_add_size_checked_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) .cse11 (= .cse12 ULTIMATE.start_aws_add_u64_checked_~a) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) .cse13 (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse12 (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528)) .cse13 .cse14 .cse15 .cse16 .cse17)))) [2021-11-05 13:04:22,914 INFO L858 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2021-11-05 13:04:22,914 INFO L854 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: false [2021-11-05 13:04:22,914 INFO L858 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2021-11-05 13:04:22,914 INFO L858 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2021-11-05 13:04:22,915 INFO L858 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,915 INFO L854 garLoopResultBuilder]: At program point L10017-6(lines 10015 10018) the Hoare annotation is: false [2021-11-05 13:04:22,915 INFO L858 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,915 INFO L858 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,915 INFO L858 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,915 INFO L858 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,916 INFO L858 garLoopResultBuilder]: For program point L10017-12(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,916 INFO L854 garLoopResultBuilder]: At program point L10017-13(lines 10015 10018) the Hoare annotation is: false [2021-11-05 13:04:22,916 INFO L858 garLoopResultBuilder]: For program point L10017-14(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,916 INFO L858 garLoopResultBuilder]: For program point L10017-9(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,916 INFO L858 garLoopResultBuilder]: For program point L10017-10(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,916 INFO L854 garLoopResultBuilder]: At program point L10017-20(lines 10015 10018) the Hoare annotation is: false [2021-11-05 13:04:22,916 INFO L858 garLoopResultBuilder]: For program point L10017-21(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,916 INFO L858 garLoopResultBuilder]: For program point L10017-23(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,917 INFO L858 garLoopResultBuilder]: For program point L10017-16(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,917 INFO L858 garLoopResultBuilder]: For program point L10017-17(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,917 INFO L858 garLoopResultBuilder]: For program point L10017-19(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,917 INFO L858 garLoopResultBuilder]: For program point L10017-24(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,917 INFO L858 garLoopResultBuilder]: For program point L10017-26(line 10017) no Hoare annotation was computed. [2021-11-05 13:04:22,917 INFO L854 garLoopResultBuilder]: At program point L10017-27(lines 10015 10018) the Hoare annotation is: false [2021-11-05 13:04:22,918 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,919 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: false [2021-11-05 13:04:22,919 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,919 INFO L854 garLoopResultBuilder]: At program point L7411(lines 7397 7412) the Hoare annotation is: false [2021-11-05 13:04:22,919 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,919 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,919 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,919 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,919 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,920 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,920 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,920 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,920 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,921 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,921 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,921 INFO L858 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,921 INFO L858 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,921 INFO L858 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,921 INFO L858 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-11-05 13:04:22,921 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,921 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,922 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,922 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,922 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,922 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,922 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,922 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,922 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,923 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,923 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,923 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse10 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse14 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse17 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (let ((.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse2 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse5 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse6 (let ((.cse18 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse19 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse20 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|))) (or (and .cse0 .cse18 .cse19 .cse20 .cse10 .cse14 .cse17) (and .cse0 .cse18 .cse19 .cse20 (= |ULTIMATE.start_aws_mul_size_checked_#res| 0) .cse10 (= |ULTIMATE.start_aws_mul_u64_checked_#res| 0) .cse14 .cse17)))) (.cse7 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse8 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5|) 0))) (.cse9 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8)) (.cse11 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse12 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse13 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse15 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0))) (.cse16 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res| 1) 0) .cse9 .cse10 .cse11 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) .cse12 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2021-11-05 13:04:22,923 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,923 INFO L858 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,924 INFO L858 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,924 INFO L858 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,924 INFO L858 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-11-05 13:04:22,924 INFO L854 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: false [2021-11-05 13:04:22,924 INFO L854 garLoopResultBuilder]: At program point L6852-1(line 6852) the Hoare annotation is: false [2021-11-05 13:04:22,924 INFO L854 garLoopResultBuilder]: At program point L6852(line 6852) the Hoare annotation is: false [2021-11-05 13:04:22,924 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,924 INFO L854 garLoopResultBuilder]: At program point L7415(lines 7414 7416) the Hoare annotation is: false [2021-11-05 13:04:22,924 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5|) 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0)) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) [2021-11-05 13:04:22,925 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse2 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse5 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse6 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse8 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse9 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse10 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse11 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse12 (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5|) 0))) (.cse13 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (let ((.cse7 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and .cse0 .cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse8 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) .cse9 (= .cse7 ULTIMATE.start_aws_add_u64_checked_~a) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) .cse10 (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) .cse11 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0)) .cse12 .cse13)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-11-05 13:04:22,925 INFO L858 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2021-11-05 13:04:22,925 INFO L858 garLoopResultBuilder]: For program point L6822(lines 6822 6824) no Hoare annotation was computed. [2021-11-05 13:04:22,925 INFO L858 garLoopResultBuilder]: For program point L6822-2(lines 6822 6824) no Hoare annotation was computed. [2021-11-05 13:04:22,925 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) (= .cse0 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= .cse0 ULTIMATE.start_aws_add_u64_checked_~a) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0)) (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5|) 0)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) [2021-11-05 13:04:22,925 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-05 13:04:22,925 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-05 13:04:22,926 INFO L858 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2021-11-05 13:04:22,926 INFO L858 garLoopResultBuilder]: For program point L10028-1(lines 10028 10032) no Hoare annotation was computed. [2021-11-05 13:04:22,926 INFO L858 garLoopResultBuilder]: For program point L10028-2(lines 10028 10032) no Hoare annotation was computed. [2021-11-05 13:04:22,926 INFO L858 garLoopResultBuilder]: For program point L10028-3(lines 10028 10032) no Hoare annotation was computed. [2021-11-05 13:04:22,926 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-05 13:04:22,926 INFO L858 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-11-05 13:04:22,926 INFO L861 garLoopResultBuilder]: At program point L10161(line 10161) the Hoare annotation is: true [2021-11-05 13:04:22,926 INFO L858 garLoopResultBuilder]: For program point L6825-2(lines 6825 6827) no Hoare annotation was computed. [2021-11-05 13:04:22,926 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) [2021-11-05 13:04:22,927 INFO L858 garLoopResultBuilder]: For program point L6825(lines 6825 6827) no Hoare annotation was computed. [2021-11-05 13:04:22,927 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-05 13:04:22,927 INFO L854 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: false [2021-11-05 13:04:22,927 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-05 13:04:22,927 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-05 13:04:22,927 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-11-05 13:04:22,927 INFO L858 garLoopResultBuilder]: For program point L10131(lines 10131 10133) no Hoare annotation was computed. [2021-11-05 13:04:22,928 INFO L854 garLoopResultBuilder]: At program point L9272(lines 9272 9298) the Hoare annotation is: false [2021-11-05 13:04:22,928 INFO L858 garLoopResultBuilder]: For program point L9933(lines 9933 9958) no Hoare annotation was computed. [2021-11-05 13:04:22,928 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse10 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse14 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse17 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (let ((.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse2 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse5 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse6 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse7 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5|) 0))) (.cse8 (let ((.cse18 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse19 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse20 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|))) (or (and .cse0 .cse18 .cse19 .cse20 .cse10 (= |ULTIMATE.start_aws_mul_u64_checked_#res| 0) .cse14 .cse17) (and .cse0 .cse18 .cse19 .cse20 .cse10 .cse14 .cse17)))) (.cse9 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8)) (.cse11 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse12 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse13 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse15 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0))) (.cse16 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) .cse7 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) .cse12 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2021-11-05 13:04:22,928 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0)) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,929 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,930 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,931 INFO L858 garLoopResultBuilder]: For program point L9276(lines 9276 9278) no Hoare annotation was computed. [2021-11-05 13:04:22,931 INFO L858 garLoopResultBuilder]: For program point L9276-2(lines 9276 9278) no Hoare annotation was computed. [2021-11-05 13:04:22,931 INFO L858 garLoopResultBuilder]: For program point L10135(lines 10135 10137) no Hoare annotation was computed. [2021-11-05 13:04:22,931 INFO L858 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-11-05 13:04:22,931 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-05 13:04:22,931 INFO L858 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2021-11-05 13:04:22,931 INFO L854 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-11-05 13:04:22,931 INFO L858 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2021-11-05 13:04:22,931 INFO L858 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2021-11-05 13:04:22,932 INFO L854 garLoopResultBuilder]: At program point L10071-2(lines 10026 10073) the Hoare annotation is: false [2021-11-05 13:04:22,932 INFO L854 garLoopResultBuilder]: At program point L10071-3(lines 10026 10073) the Hoare annotation is: false [2021-11-05 13:04:22,932 INFO L858 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2021-11-05 13:04:22,932 INFO L854 garLoopResultBuilder]: At program point L10071(lines 10026 10073) the Hoare annotation is: false [2021-11-05 13:04:22,932 INFO L854 garLoopResultBuilder]: At program point L10071-1(lines 10026 10073) the Hoare annotation is: false [2021-11-05 13:04:22,933 INFO L854 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: false [2021-11-05 13:04:22,933 INFO L854 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: false [2021-11-05 13:04:22,933 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: false [2021-11-05 13:04:22,933 INFO L854 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-11-05 13:04:22,933 INFO L854 garLoopResultBuilder]: At program point L10139(lines 10128 10140) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse3 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse4 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse5 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse6 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and .cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse1 (exists ((|v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11|) 0))) (and (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0) (= (select |#valid| |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11|) 0) (= .cse2 (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528)) (= .cse2 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (not (= |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|))))) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5| Int) (|v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10| Int)) (and (not (= |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5|)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5|) 0) (= (select |#valid| |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10|) 0))) .cse3 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0)) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-11-05 13:04:22,933 INFO L858 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2021-11-05 13:04:22,934 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-05 13:04:22,934 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-05 13:04:22,934 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-05 13:04:22,934 INFO L858 garLoopResultBuilder]: For program point L10141(lines 10141 10160) no Hoare annotation was computed. [2021-11-05 13:04:22,934 INFO L858 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2021-11-05 13:04:22,934 INFO L858 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2021-11-05 13:04:22,934 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse3 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse5 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse6 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse7 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse8 (= .cse12 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0))) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse10 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8)) (.cse11 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse13 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse14 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse15 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0))) (.cse16 (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5|) 0))) (.cse17 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) .cse11 (= .cse12 ULTIMATE.start_aws_add_u64_checked_~a) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) .cse13 (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse12 (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528)) .cse13 .cse14 .cse15 .cse16 .cse17)))) [2021-11-05 13:04:22,935 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) [2021-11-05 13:04:22,935 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-11-05 13:04:22,935 INFO L854 garLoopResultBuilder]: At program point L266-2(line 266) the Hoare annotation is: false [2021-11-05 13:04:22,938 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:04:22,939 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-05 13:04:22,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,953 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,953 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,970 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,971 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,971 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,981 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:22,981 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:22,982 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,983 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:22,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:22,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,988 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,990 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,991 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,993 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,993 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,994 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:22,994 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:22,995 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,995 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:22,996 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,997 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:22,997 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,998 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:22,998 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,999 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:22,999 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,000 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,000 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,000 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,000 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,000 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] [2021-11-05 13:04:23,000 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,001 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,001 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] [2021-11-05 13:04:23,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] [2021-11-05 13:04:23,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] [2021-11-05 13:04:23,005 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,005 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,005 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,006 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,007 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,007 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,007 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,013 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,013 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,015 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,015 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,016 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,016 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,016 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 01:04:23 BoogieIcfgContainer [2021-11-05 13:04:23,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-05 13:04:23,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-05 13:04:23,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-05 13:04:23,018 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-05 13:04:23,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:58:47" (3/4) ... [2021-11-05 13:04:23,021 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-05 13:04:23,042 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 181 nodes and edges [2021-11-05 13:04:23,044 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2021-11-05 13:04:23,045 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-05 13:04:23,045 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-05 13:04:23,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-05 13:04:23,047 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-05 13:04:23,048 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-05 13:04:23,049 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-05 13:04:23,074 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) [2021-11-05 13:04:23,074 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((0 == map && \result + 1 <= 0) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown < map) && b == 24) && elemsize == r) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && \result + 1 <= 0) && ((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \result == 0) && map == map) && !(map == required_bytes)) || ((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && map == map) && !(map == required_bytes)))) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown < map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && ((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \result == 0) && map == map) && !(map == required_bytes)) || ((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && map == map) && !(map == required_bytes)))) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && required_bytes == required_bytes) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) [2021-11-05 13:04:23,074 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((0 == map && \result + 1 <= 0) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && (((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && map == map) && !(map == required_bytes)) || ((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \result == 0) && map == map) && \result == 0) && map == map) && !(map == required_bytes)))) && unknown-#StackHeapBarrier-unknown < map) && b == 24) && elemsize == r) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && \result + 1 <= 0) && \result + 1 <= 0) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && (((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && map == map) && !(map == required_bytes)) || ((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \result == 0) && map == map) && \result == 0) && map == map) && !(map == required_bytes)))) && unknown-#StackHeapBarrier-unknown < map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && required_bytes == required_bytes) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) [2021-11-05 13:04:23,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) [2021-11-05 13:04:23,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0 == map && required_bytes == 0) && !(map == 0)) && (\exists v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11 : int, v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: (((\valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0 && \valid[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11] == 0) && unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11][0] == 24 * num_entries) && !(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11 == v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6))) && \valid[required_bytes] == 1) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int, v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10 : int :: (!(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10 == v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5) && \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0) && \valid[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10] == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && \valid[map] == 1) && map == map) && !(map == required_bytes)) && \result == 0) || (((((((0 == map && !(map == 0)) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && !(map == required_bytes)) [2021-11-05 13:04:23,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes) [2021-11-05 13:04:23,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result + 1 <= 0 && \result + 1 <= 0) && (((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) || ((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)))) || (((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && unknown-#memory_int-unknown[elemsize][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) [2021-11-05 13:04:23,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result + 1 <= 0 && \result + 1 <= 0) && \result + 1 <= 0) && (((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) || ((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)))) || (((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && unknown-#memory_int-unknown[elemsize][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) [2021-11-05 13:04:23,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result + 1 <= 0 && (((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) || ((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes))) [2021-11-05 13:04:23,661 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-05 13:04:23,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-05 13:04:23,662 INFO L158 Benchmark]: Toolchain (without parser) took 345841.13ms. Allocated memory was 69.2MB in the beginning and 429.9MB in the end (delta: 360.7MB). Free memory was 42.3MB in the beginning and 156.5MB in the end (delta: -114.2MB). Peak memory consumption was 299.1MB. Max. memory is 16.1GB. [2021-11-05 13:04:23,663 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 69.2MB. Free memory was 51.6MB in the beginning and 51.5MB in the end (delta: 53.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 13:04:23,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2383.18ms. Allocated memory was 69.2MB in the beginning and 117.4MB in the end (delta: 48.2MB). Free memory was 42.2MB in the beginning and 52.7MB in the end (delta: -10.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2021-11-05 13:04:23,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 169.42ms. Allocated memory is still 117.4MB. Free memory was 52.7MB in the beginning and 63.6MB in the end (delta: -10.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2021-11-05 13:04:23,663 INFO L158 Benchmark]: Boogie Preprocessor took 104.86ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 54.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-05 13:04:23,663 INFO L158 Benchmark]: RCFGBuilder took 7288.33ms. Allocated memory was 117.4MB in the beginning and 356.5MB in the end (delta: 239.1MB). Free memory was 54.6MB in the beginning and 213.5MB in the end (delta: -158.9MB). Peak memory consumption was 207.5MB. Max. memory is 16.1GB. [2021-11-05 13:04:23,664 INFO L158 Benchmark]: TraceAbstraction took 335243.89ms. Allocated memory was 356.5MB in the beginning and 429.9MB in the end (delta: 73.4MB). Free memory was 213.5MB in the beginning and 167.6MB in the end (delta: 46.0MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. [2021-11-05 13:04:23,664 INFO L158 Benchmark]: Witness Printer took 643.98ms. Allocated memory is still 429.9MB. Free memory was 166.5MB in the beginning and 156.5MB in the end (delta: 10.0MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2021-11-05 13:04:23,665 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.22ms. Allocated memory is still 69.2MB. Free memory was 51.6MB in the beginning and 51.5MB in the end (delta: 53.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2383.18ms. Allocated memory was 69.2MB in the beginning and 117.4MB in the end (delta: 48.2MB). Free memory was 42.2MB in the beginning and 52.7MB in the end (delta: -10.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 169.42ms. Allocated memory is still 117.4MB. Free memory was 52.7MB in the beginning and 63.6MB in the end (delta: -10.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.86ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 54.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 7288.33ms. Allocated memory was 117.4MB in the beginning and 356.5MB in the end (delta: 239.1MB). Free memory was 54.6MB in the beginning and 213.5MB in the end (delta: -158.9MB). Peak memory consumption was 207.5MB. Max. memory is 16.1GB. * TraceAbstraction took 335243.89ms. Allocated memory was 356.5MB in the beginning and 429.9MB in the end (delta: 73.4MB). Free memory was 213.5MB in the beginning and 167.6MB in the end (delta: 46.0MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. * Witness Printer took 643.98ms. Allocated memory is still 429.9MB. Free memory was 166.5MB in the beginning and 156.5MB in the end (delta: 10.0MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] * 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 - 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, 150 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 335117.35ms, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 26.80ms, AutomataDifference: 70715.74ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 44.23ms, InitialAbstractionConstructionTime: 10.01ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 2831 SdHoareTripleChecker+Valid, 64688.86ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2831 mSDsluCounter, 10397 SdHoareTripleChecker+Invalid, 59548.22ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 490 IncrementalHoareTripleChecker+Unchecked, 7854 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1565 IncrementalHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 2543 mSDtfsCounter, 1565 mSolverCounterSat, 52.86ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 12500.27ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=15, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 149.05ms AutomataMinimizationTime, 17 MinimizatonAttempts, 194 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 40 LocationsWithAnnotation, 40 PreInvPairs, 56 NumberOfFragments, 1859 HoareAnnotationTreeSize, 40 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 16.96ms HoareSimplificationTime, 40 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 8.22ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 695.02ms SsaConstructionTime, 216970.64ms SatisfiabilityAnalysisTime, 44693.08ms InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1215 ConstructedInterpolants, 50 QuantifiedInterpolants, 7846 SizeOfPredicates, 120 NumberOfNonLiveVariables, 10861 ConjunctsInSsa, 509 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 6 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant [2021-11-05 13:04:23,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] Derived loop invariant: (((\result + 1 <= 0 && \result + 1 <= 0) && \result + 1 <= 0) && (((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) || ((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)))) || (((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && unknown-#memory_int-unknown[elemsize][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2021-11-05 13:04:23,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((0 == map && \result + 1 <= 0) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown < map) && b == 24) && elemsize == r) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && \result + 1 <= 0) && ((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \result == 0) && map == map) && !(map == required_bytes)) || ((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && map == map) && !(map == required_bytes)))) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown < map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && ((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \result == 0) && map == map) && !(map == required_bytes)) || ((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && map == map) && !(map == required_bytes)))) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && required_bytes == required_bytes) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) - InvariantResult [Line: 7414]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((0 == map && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && max_table_entries == 8) && \valid[map] == 1) && map == map - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant [2021-11-05 13:04:23,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] Derived loop invariant: \result + 1 <= 0 && (((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) || ((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes))) - InvariantResult [Line: 1988]: Loop Invariant [2021-11-05 13:04:23,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant [2021-11-05 13:04:23,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) - InvariantResult [Line: 10128]: Loop Invariant [2021-11-05 13:04:23,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] [2021-11-05 13:04:23,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] [2021-11-05 13:04:23,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-05 13:04:23,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] [2021-11-05 13:04:23,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10,QUANTIFIED] Derived loop invariant: ((((((((((((0 == map && required_bytes == 0) && !(map == 0)) && (\exists v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11 : int, v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: (((\valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0 && \valid[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11] == 0) && unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11][0] == 24 * num_entries) && !(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11 == v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6))) && \valid[required_bytes] == 1) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int, v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10 : int :: (!(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10 == v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5) && \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0) && \valid[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_10] == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && \valid[map] == 1) && map == map) && !(map == required_bytes)) && \result == 0) || (((((((0 == map && !(map == 0)) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && !(map == required_bytes)) - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant [2021-11-05 13:04:23,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5,QUANTIFIED] [2021-11-05 13:04:23,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((0 == map && \result + 1 <= 0) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && (((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && map == map) && !(map == required_bytes)) || ((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \result == 0) && map == map) && \result == 0) && map == map) && !(map == required_bytes)))) && unknown-#StackHeapBarrier-unknown < map) && b == 24) && elemsize == r) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && \result + 1 <= 0) && \result + 1 <= 0) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && (((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && map == map) && !(map == required_bytes)) || ((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \result == 0) && map == map) && \result == 0) && map == map) && !(map == required_bytes)))) && unknown-#StackHeapBarrier-unknown < map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_5] == 0)) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && required_bytes == required_bytes) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) - InvariantResult [Line: 248]: Loop Invariant [2021-11-05 13:04:23,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] Derived loop invariant: (((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes) - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7407]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((0 == map && cond == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && max_table_entries == 8) && \valid[map] == 1) && map == map - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant [2021-11-05 13:04:23,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] [2021-11-05 13:04:23,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-05 13:04:23,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5,QUANTIFIED] Derived loop invariant: ((\result + 1 <= 0 && \result + 1 <= 0) && (((((((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) || ((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)))) || (((((((((((((((((0 == map && \valid[elemsize := 0][map] == 1) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && unknown-#memory_int-unknown[elemsize][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0.base_5] == 0)) && !(map == required_bytes)) - InvariantResult [Line: 6852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7397]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-05 13:04:23,898 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-05 13:04:23,932 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE