./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_move_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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_move_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 ba6eb72b2235d93ac0dcdd3f0e672793184c4cf65112c581319750a174c5bca8 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 13:31:58,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 13:31:58,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 13:31:58,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 13:31:58,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 13:31:58,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 13:31:58,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 13:31:58,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 13:31:58,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 13:31:58,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 13:31:58,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 13:31:58,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 13:31:58,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 13:31:58,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 13:31:58,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 13:31:58,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 13:31:58,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 13:31:58,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 13:31:58,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 13:31:58,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 13:31:58,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 13:31:58,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 13:31:58,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 13:31:58,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 13:31:58,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 13:31:58,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 13:31:58,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 13:31:58,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 13:31:58,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 13:31:58,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 13:31:58,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 13:31:58,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 13:31:58,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 13:31:58,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 13:31:58,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 13:31:58,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 13:31:58,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 13:31:58,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 13:31:58,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 13:31:58,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 13:31:58,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 13:31:58,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 13:31:58,577 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 13:31:58,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 13:31:58,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 13:31:58,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 13:31:58,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 13:31:58,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 13:31:58,579 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 13:31:58,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 13:31:58,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 13:31:58,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 13:31:58,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 13:31:58,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 13:31:58,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 13:31:58,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 13:31:58,581 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 13:31:58,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 13:31:58,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 13:31:58,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 13:31:58,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 13:31:58,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:31:58,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 13:31:58,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 13:31:58,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 13:31:58,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 13:31:58,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 13:31:58,583 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 13:31:58,583 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 13:31:58,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 13:31:58,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 13:31:58,583 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 -> ba6eb72b2235d93ac0dcdd3f0e672793184c4cf65112c581319750a174c5bca8 [2021-11-02 13:31:58,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 13:31:58,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 13:31:58,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 13:31:58,818 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 13:31:58,819 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 13:31:58,821 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_move_harness.i [2021-11-02 13:31:58,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba8e0041/37647d2ceea342d3b173e36031a587d2/FLAG8b2c05fca [2021-11-02 13:31:59,508 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 13:31:59,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_move_harness.i [2021-11-02 13:31:59,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba8e0041/37647d2ceea342d3b173e36031a587d2/FLAG8b2c05fca [2021-11-02 13:31:59,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba8e0041/37647d2ceea342d3b173e36031a587d2 [2021-11-02 13:31:59,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 13:31:59,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 13:31:59,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 13:31:59,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 13:31:59,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 13:31:59,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:31:59" (1/1) ... [2021-11-02 13:31:59,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9dac9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:59, skipping insertion in model container [2021-11-02 13:31:59,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:31:59" (1/1) ... [2021-11-02 13:31:59,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 13:32:00,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 13:32:00,266 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_move_harness.i[4493,4506] [2021-11-02 13:32:00,272 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_move_harness.i[4553,4566] [2021-11-02 13:32:00,290 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:32:00,295 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:32:00,865 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,865 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,866 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,867 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,868 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,874 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,876 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,876 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,877 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,878 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,879 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,879 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:00,879 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,131 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:32:01,132 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:32:01,133 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:32:01,133 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:32:01,134 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:32:01,134 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:32:01,135 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:32:01,135 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:32:01,135 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:32:01,136 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:32:01,246 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:32:01,484 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,486 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,503 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,504 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,509 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,510 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,522 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,523 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,525 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,525 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,525 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,525 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,526 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:32:01,594 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 13:32:01,614 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_move_harness.i[4493,4506] [2021-11-02 13:32:01,615 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_move_harness.i[4553,4566] [2021-11-02 13:32:01,616 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:32:01,617 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:32:01,646 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,646 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,646 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,647 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,647 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,650 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,650 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,651 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,651 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,651 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,652 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,652 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,652 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,684 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:32:01,685 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:32:01,685 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:32:01,685 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:32:01,686 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:32:01,686 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:32:01,687 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:32:01,687 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:32:01,687 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:32:01,687 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:32:01,698 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:32:01,797 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,809 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,818 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,832 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,835 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,835 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,847 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,849 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,850 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,850 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,850 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,851 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,851 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:32:01,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:32:02,115 INFO L208 MainTranslator]: Completed translation [2021-11-02 13:32:02,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02 WrapperNode [2021-11-02 13:32:02,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 13:32:02,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 13:32:02,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 13:32:02,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 13:32:02,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 13:32:02,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 13:32:02,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 13:32:02,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 13:32:02,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 13:32:02,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 13:32:02,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 13:32:02,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 13:32:02,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (1/1) ... [2021-11-02 13:32:02,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:32:02,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:32:02,393 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-02 13:32:02,412 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-02 13:32:02,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-02 13:32:02,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 13:32:02,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 13:32:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 13:32:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 13:32:02,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 13:32:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-02 13:32:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 13:32:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-02 13:32:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 13:32:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 13:32:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 13:32:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 13:32:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 13:32:06,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 13:32:06,696 INFO L299 CfgBuilder]: Removed 124 assume(true) statements. [2021-11-02 13:32:06,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:32:06 BoogieIcfgContainer [2021-11-02 13:32:06,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 13:32:06,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 13:32:06,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 13:32:06,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 13:32:06,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 01:31:59" (1/3) ... [2021-11-02 13:32:06,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37449898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:32:06, skipping insertion in model container [2021-11-02 13:32:06,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:32:02" (2/3) ... [2021-11-02 13:32:06,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37449898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:32:06, skipping insertion in model container [2021-11-02 13:32:06,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:32:06" (3/3) ... [2021-11-02 13:32:06,711 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_move_harness.i [2021-11-02 13:32:06,715 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 13:32:06,716 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-02 13:32:06,758 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 13:32:06,763 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-02 13:32:06,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-02 13:32:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 116 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-02 13:32:06,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:06,785 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-02 13:32:06,785 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1930291544, now seen corresponding path program 1 times [2021-11-02 13:32:06,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:06,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082162033] [2021-11-02 13:32:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:06,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:07,374 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-02 13:32:07,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:07,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082162033] [2021-11-02 13:32:07,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082162033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:32:07,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:32:07,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 13:32:07,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75458597] [2021-11-02 13:32:07,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 13:32:07,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:07,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 13:32:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:32:07,413 INFO L87 Difference]: Start difference. First operand has 117 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 116 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 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-02 13:32:09,489 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:32:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:10,173 INFO L93 Difference]: Finished difference Result 230 states and 303 transitions. [2021-11-02 13:32:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:32:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 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-02 13:32:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:10,180 INFO L225 Difference]: With dead ends: 230 [2021-11-02 13:32:10,180 INFO L226 Difference]: Without dead ends: 111 [2021-11-02 13:32:10,182 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-02 13:32:10,184 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2475.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.29ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2714.32ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:10,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 2.29ms Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 1 Unknown, 0 Unchecked, 2714.32ms Time] [2021-11-02 13:32:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-02 13:32:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-02 13:32:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 110 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2021-11-02 13:32:10,216 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 60 [2021-11-02 13:32:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:10,216 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2021-11-02 13:32:10,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 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-02 13:32:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2021-11-02 13:32:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-02 13:32:10,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:10,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:32:10,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 13:32:10,222 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2019289401, now seen corresponding path program 1 times [2021-11-02 13:32:10,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:10,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512178512] [2021-11-02 13:32:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:10,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:10,322 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 13:32:10,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815741262] [2021-11-02 13:32:10,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:10,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:32:10,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:32:10,324 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-02 13:32:10,338 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-02 13:32:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:11,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 2555 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 13:32:11,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:32:11,239 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-02 13:32:11,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 13:32:11,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:11,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512178512] [2021-11-02 13:32:11,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 13:32:11,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815741262] [2021-11-02 13:32:11,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815741262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:32:11,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:32:11,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 13:32:11,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578403061] [2021-11-02 13:32:11,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 13:32:11,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 13:32:11,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:32:11,241 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:13,284 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-02 13:32:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:14,444 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. [2021-11-02 13:32:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 13:32:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-02 13:32:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:14,445 INFO L225 Difference]: With dead ends: 143 [2021-11-02 13:32:14,445 INFO L226 Difference]: Without dead ends: 112 [2021-11-02 13:32:14,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.75ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:32:14,446 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2848.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.41ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3164.93ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:14,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 262 Unknown, 0 Unchecked, 5.41ms Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 3164.93ms Time] [2021-11-02 13:32:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-02 13:32:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-11-02 13:32:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2021-11-02 13:32:14,453 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 63 [2021-11-02 13:32:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:14,453 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2021-11-02 13:32:14,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2021-11-02 13:32:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-02 13:32:14,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:14,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:32:14,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-02 13:32:14,667 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-02 13:32:14,668 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2143604789, now seen corresponding path program 1 times [2021-11-02 13:32:14,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:14,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079822776] [2021-11-02 13:32:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:14,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:14,733 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 13:32:14,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424368778] [2021-11-02 13:32:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:14,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:32:14,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:32:14,748 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-02 13:32:14,749 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-02 13:32:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:15,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 2562 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 13:32:15,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:32:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:32:15,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:32:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:32:15,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:15,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079822776] [2021-11-02 13:32:15,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 13:32:15,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424368778] [2021-11-02 13:32:15,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424368778] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:32:15,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 13:32:15,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-02 13:32:15,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927511619] [2021-11-02 13:32:15,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:32:15,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:32:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:32:15,783 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:17,820 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:32:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:18,939 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2021-11-02 13:32:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 13:32:18,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-02 13:32:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:18,941 INFO L225 Difference]: With dead ends: 146 [2021-11-02 13:32:18,941 INFO L226 Difference]: Without dead ends: 115 [2021-11-02 13:32:18,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.19ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:32:18,942 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2813.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.10ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3120.79ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:18,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 269 Unknown, 0 Unchecked, 6.10ms Time], IncrementalHoareTripleChecker [4 Valid, 264 Invalid, 1 Unknown, 0 Unchecked, 3120.79ms Time] [2021-11-02 13:32:18,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-02 13:32:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-11-02 13:32:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 114 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2021-11-02 13:32:18,949 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 64 [2021-11-02 13:32:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:18,949 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2021-11-02 13:32:18,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2021-11-02 13:32:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-02 13:32:18,950 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:18,950 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:32:18,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 13:32:19,172 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,SelfDestructingSolverStorable2 [2021-11-02 13:32:19,173 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash 423755193, now seen corresponding path program 2 times [2021-11-02 13:32:19,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:19,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188660983] [2021-11-02 13:32:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:19,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:19,225 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 13:32:19,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319808147] [2021-11-02 13:32:19,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 13:32:19,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:32:19,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:32:19,227 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-02 13:32:19,228 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-02 13:32:19,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-02 13:32:19,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 13:32:19,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 2555 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 13:32:19,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:32:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 13:32:20,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 13:32:20,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:20,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188660983] [2021-11-02 13:32:20,176 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 13:32:20,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319808147] [2021-11-02 13:32:20,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319808147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:32:20,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:32:20,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:32:20,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071796735] [2021-11-02 13:32:20,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:32:20,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:20,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:32:20,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:32:20,177 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:22,263 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:32:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:24,610 INFO L93 Difference]: Finished difference Result 307 states and 364 transitions. [2021-11-02 13:32:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:32:24,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-02 13:32:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:24,612 INFO L225 Difference]: With dead ends: 307 [2021-11-02 13:32:24,612 INFO L226 Difference]: Without dead ends: 214 [2021-11-02 13:32:24,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 105.25ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:32:24,613 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 216 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3914.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.44ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4316.02ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:24,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 0 Invalid, 709 Unknown, 0 Unchecked, 8.44ms Time], IncrementalHoareTripleChecker [8 Valid, 700 Invalid, 1 Unknown, 0 Unchecked, 4316.02ms Time] [2021-11-02 13:32:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-11-02 13:32:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 121. [2021-11-02 13:32:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 120 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2021-11-02 13:32:24,620 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 67 [2021-11-02 13:32:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:24,621 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2021-11-02 13:32:24,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2021-11-02 13:32:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-02 13:32:24,621 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:24,622 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:32:24,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 13:32:24,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:32:24,823 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 578937273, now seen corresponding path program 1 times [2021-11-02 13:32:24,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:24,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302717209] [2021-11-02 13:32:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:24,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 13:32:25,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:25,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302717209] [2021-11-02 13:32:25,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302717209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:32:25,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:32:25,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:32:25,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544765874] [2021-11-02 13:32:25,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:32:25,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:25,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:32:25,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:32:25,358 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:27,394 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-02 13:32:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:29,953 INFO L93 Difference]: Finished difference Result 240 states and 283 transitions. [2021-11-02 13:32:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:32:29,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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-02 13:32:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:29,954 INFO L225 Difference]: With dead ends: 240 [2021-11-02 13:32:29,954 INFO L226 Difference]: Without dead ends: 157 [2021-11-02 13:32:29,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 496.78ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:32:29,955 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 407 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3832.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.89ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4200.80ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:29,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 0 Invalid, 681 Unknown, 0 Unchecked, 11.89ms Time], IncrementalHoareTripleChecker [11 Valid, 669 Invalid, 1 Unknown, 0 Unchecked, 4200.80ms Time] [2021-11-02 13:32:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-02 13:32:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2021-11-02 13:32:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 120 states have (on average 1.2) internal successors, (144), 122 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2021-11-02 13:32:29,963 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 71 [2021-11-02 13:32:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:29,963 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2021-11-02 13:32:29,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2021-11-02 13:32:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-02 13:32:29,964 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:29,965 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:32:29,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 13:32:29,965 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash 563418555, now seen corresponding path program 1 times [2021-11-02 13:32:29,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:29,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931696132] [2021-11-02 13:32:29,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:29,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 13:32:30,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:30,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931696132] [2021-11-02 13:32:30,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931696132] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:32:30,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:32:30,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:32:30,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085258020] [2021-11-02 13:32:30,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:32:30,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:30,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:32:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:32:30,146 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:32,183 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-02 13:32:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:33,267 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2021-11-02 13:32:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:32:33,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-02 13:32:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:33,268 INFO L225 Difference]: With dead ends: 209 [2021-11-02 13:32:33,268 INFO L226 Difference]: Without dead ends: 121 [2021-11-02 13:32:33,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.07ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:32:33,270 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2734.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.04ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3068.89ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:33,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 259 Unknown, 0 Unchecked, 4.04ms Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 3068.89ms Time] [2021-11-02 13:32:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-02 13:32:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-11-02 13:32:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 120 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2021-11-02 13:32:33,275 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 71 [2021-11-02 13:32:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:33,275 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2021-11-02 13:32:33,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2021-11-02 13:32:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-02 13:32:33,276 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:33,276 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:32:33,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 13:32:33,276 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:33,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:33,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1406054188, now seen corresponding path program 1 times [2021-11-02 13:32:33,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:33,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84369691] [2021-11-02 13:32:33,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:33,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 13:32:33,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:33,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84369691] [2021-11-02 13:32:33,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84369691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:32:33,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:32:33,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:32:33,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429193497] [2021-11-02 13:32:33,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:32:33,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:33,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:32:33,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:32:33,542 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:36,029 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:32:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:37,600 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-11-02 13:32:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 13:32:37,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-02 13:32:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:37,601 INFO L225 Difference]: With dead ends: 208 [2021-11-02 13:32:37,601 INFO L226 Difference]: Without dead ends: 124 [2021-11-02 13:32:37,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 275.93ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:32:37,602 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3454.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.64ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3835.83ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:37,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 385 Unknown, 0 Unchecked, 4.64ms Time], IncrementalHoareTripleChecker [24 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 3835.83ms Time] [2021-11-02 13:32:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-02 13:32:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2021-11-02 13:32:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.152542372881356) internal successors, (136), 120 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2021-11-02 13:32:37,607 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 73 [2021-11-02 13:32:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:37,608 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2021-11-02 13:32:37,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2021-11-02 13:32:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-02 13:32:37,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:37,608 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:32:37,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 13:32:37,609 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash -247919355, now seen corresponding path program 1 times [2021-11-02 13:32:37,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:37,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737214894] [2021-11-02 13:32:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:37,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 13:32:38,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:38,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737214894] [2021-11-02 13:32:38,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737214894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:32:38,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:32:38,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 13:32:38,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143923446] [2021-11-02 13:32:38,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 13:32:38,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:38,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 13:32:38,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:32:38,460 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 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-02 13:32:41,005 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:32:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:48,666 INFO L93 Difference]: Finished difference Result 266 states and 295 transitions. [2021-11-02 13:32:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-02 13:32:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 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 74 [2021-11-02 13:32:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:48,667 INFO L225 Difference]: With dead ends: 266 [2021-11-02 13:32:48,667 INFO L226 Difference]: Without dead ends: 225 [2021-11-02 13:32:48,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 3504.98ms TimeCoverageRelationStatistics Valid=398, Invalid=1162, Unknown=0, NotChecked=0, Total=1560 [2021-11-02 13:32:48,669 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 534 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6552.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.45ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7087.75ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:48,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 0 Invalid, 1513 Unknown, 0 Unchecked, 22.45ms Time], IncrementalHoareTripleChecker [57 Valid, 1455 Invalid, 1 Unknown, 0 Unchecked, 7087.75ms Time] [2021-11-02 13:32:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-02 13:32:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 143. [2021-11-02 13:32:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.1571428571428573) 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-02 13:32:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2021-11-02 13:32:48,679 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 74 [2021-11-02 13:32:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:48,679 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2021-11-02 13:32:48,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 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-02 13:32:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2021-11-02 13:32:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-02 13:32:48,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:48,680 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:32:48,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 13:32:48,681 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:48,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2053357689, now seen corresponding path program 1 times [2021-11-02 13:32:48,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:48,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733650367] [2021-11-02 13:32:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:48,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-02 13:32:49,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:49,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733650367] [2021-11-02 13:32:49,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733650367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:32:49,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:32:49,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:32:49,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191746546] [2021-11-02 13:32:49,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:32:49,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:49,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:32:49,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:32:49,017 INFO L87 Difference]: Start difference. First operand 143 states and 162 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-02 13:32:51,907 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:32:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:53,247 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2021-11-02 13:32:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 13:32:53,247 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 74 [2021-11-02 13:32:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:53,248 INFO L225 Difference]: With dead ends: 189 [2021-11-02 13:32:53,248 INFO L226 Difference]: Without dead ends: 143 [2021-11-02 13:32:53,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 151.50ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:32:53,249 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3768.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.85ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4123.00ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:53,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 319 Unknown, 0 Unchecked, 2.85ms Time], IncrementalHoareTripleChecker [3 Valid, 315 Invalid, 1 Unknown, 0 Unchecked, 4123.00ms Time] [2021-11-02 13:32:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-02 13:32:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-02 13:32:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.1428571428571428) internal successors, (160), 142 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:32:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 160 transitions. [2021-11-02 13:32:53,254 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 160 transitions. Word has length 74 [2021-11-02 13:32:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:53,254 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 160 transitions. [2021-11-02 13:32:53,255 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-02 13:32:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2021-11-02 13:32:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-02 13:32:53,256 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:53,256 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:32:53,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 13:32:53,256 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:32:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:32:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -365516850, now seen corresponding path program 1 times [2021-11-02 13:32:53,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:32:53,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633512830] [2021-11-02 13:32:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:53,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:32:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:32:53,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:32:53,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633512830] [2021-11-02 13:32:53,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633512830] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:32:53,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888272378] [2021-11-02 13:32:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:32:53,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:32:53,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:32:53,822 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-02 13:32:53,823 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-02 13:32:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:32:54,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 2666 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 13:32:54,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:32:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:32:54,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:32:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:32:55,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888272378] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:32:55,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-02 13:32:55,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2021-11-02 13:32:55,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082145615] [2021-11-02 13:32:55,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 13:32:55,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:32:55,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 13:32:55,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=148, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:32:55,344 INFO L87 Difference]: Start difference. First operand 143 states and 160 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 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-02 13:32:58,096 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:32:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:32:59,876 INFO L93 Difference]: Finished difference Result 178 states and 202 transitions. [2021-11-02 13:32:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 13:32:59,877 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 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 77 [2021-11-02 13:32:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:32:59,878 INFO L225 Difference]: With dead ends: 178 [2021-11-02 13:32:59,878 INFO L226 Difference]: Without dead ends: 147 [2021-11-02 13:32:59,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 601.18ms TimeCoverageRelationStatistics Valid=124, Invalid=148, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:32:59,879 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4092.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.62ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4498.76ms IncrementalHoareTripleChecker+Time [2021-11-02 13:32:59,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 508 Unknown, 0 Unchecked, 2.62ms Time], IncrementalHoareTripleChecker [6 Valid, 501 Invalid, 1 Unknown, 0 Unchecked, 4498.76ms Time] [2021-11-02 13:32:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-02 13:32:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-11-02 13:32:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 144 states have (on average 1.1388888888888888) internal successors, (164), 146 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-02 13:32:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 164 transitions. [2021-11-02 13:32:59,884 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 164 transitions. Word has length 77 [2021-11-02 13:32:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:32:59,884 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 164 transitions. [2021-11-02 13:32:59,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 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-02 13:32:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2021-11-02 13:32:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:32:59,885 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:32:59,885 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:32:59,908 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-02 13:33:00,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:33:00,085 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:33:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:33:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1950258738, now seen corresponding path program 2 times [2021-11-02 13:33:00,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:33:00,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284323573] [2021-11-02 13:33:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:33:00,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:33:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:33:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-02 13:33:02,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:33:02,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284323573] [2021-11-02 13:33:02,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284323573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:33:02,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:33:02,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-02 13:33:02,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438693700] [2021-11-02 13:33:02,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-02 13:33:02,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:33:02,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 13:33:02,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:33:02,194 INFO L87 Difference]: Start difference. First operand 147 states and 164 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:04,994 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:33:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:33:14,731 INFO L93 Difference]: Finished difference Result 265 states and 290 transitions. [2021-11-02 13:33:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-02 13:33:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:33:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:33:14,733 INFO L225 Difference]: With dead ends: 265 [2021-11-02 13:33:14,733 INFO L226 Difference]: Without dead ends: 220 [2021-11-02 13:33:14,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3916.94ms TimeCoverageRelationStatistics Valid=264, Invalid=1376, Unknown=0, NotChecked=0, Total=1640 [2021-11-02 13:33:14,734 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 75 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8870.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.68ms SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9577.58ms IncrementalHoareTripleChecker+Time [2021-11-02 13:33:14,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 2257 Unknown, 0 Unchecked, 20.68ms Time], IncrementalHoareTripleChecker [75 Valid, 2181 Invalid, 1 Unknown, 0 Unchecked, 9577.58ms Time] [2021-11-02 13:33:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-11-02 13:33:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2021-11-02 13:33:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 149 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2021-11-02 13:33:14,741 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 81 [2021-11-02 13:33:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:33:14,742 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2021-11-02 13:33:14,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2021-11-02 13:33:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:33:14,742 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:33:14,742 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:33:14,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 13:33:14,743 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:33:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:33:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1676421821, now seen corresponding path program 1 times [2021-11-02 13:33:14,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:33:14,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565589265] [2021-11-02 13:33:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:33:14,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:33:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:33:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-02 13:33:16,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:33:16,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565589265] [2021-11-02 13:33:16,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565589265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:33:16,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:33:16,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-02 13:33:16,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347248489] [2021-11-02 13:33:16,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 13:33:16,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:33:16,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 13:33:16,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:33:16,312 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:19,220 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:33:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:33:33,437 INFO L93 Difference]: Finished difference Result 329 states and 357 transitions. [2021-11-02 13:33:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-02 13:33:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:33:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:33:33,439 INFO L225 Difference]: With dead ends: 329 [2021-11-02 13:33:33,439 INFO L226 Difference]: Without dead ends: 307 [2021-11-02 13:33:33,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 8125.25ms TimeCoverageRelationStatistics Valid=606, Invalid=2700, Unknown=0, NotChecked=0, Total=3306 [2021-11-02 13:33:33,440 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 616 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 2027 mSolverCounterSat, 71 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8904.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.98ms SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2027 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9717.95ms IncrementalHoareTripleChecker+Time [2021-11-02 13:33:33,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 0 Invalid, 2099 Unknown, 0 Unchecked, 21.98ms Time], IncrementalHoareTripleChecker [71 Valid, 2027 Invalid, 1 Unknown, 0 Unchecked, 9717.95ms Time] [2021-11-02 13:33:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-02 13:33:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 184. [2021-11-02 13:33:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 181 states have (on average 1.1215469613259668) internal successors, (203), 183 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2021-11-02 13:33:33,451 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 81 [2021-11-02 13:33:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:33:33,451 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2021-11-02 13:33:33,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2021-11-02 13:33:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:33:33,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:33:33,453 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:33:33,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 13:33:33,453 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:33:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:33:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash 98585541, now seen corresponding path program 1 times [2021-11-02 13:33:33,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:33:33,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140995195] [2021-11-02 13:33:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:33:33,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:33:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:33:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-02 13:33:33,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:33:33,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140995195] [2021-11-02 13:33:33,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140995195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:33:33,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:33:33,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:33:33,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027042391] [2021-11-02 13:33:33,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:33:33,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:33:33,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:33:33,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:33:33,740 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:36,746 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:33:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:33:38,246 INFO L93 Difference]: Finished difference Result 211 states and 232 transitions. [2021-11-02 13:33:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:33:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:33:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:33:38,247 INFO L225 Difference]: With dead ends: 211 [2021-11-02 13:33:38,247 INFO L226 Difference]: Without dead ends: 184 [2021-11-02 13:33:38,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 154.51ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:33:38,248 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3980.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.68ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4417.92ms IncrementalHoareTripleChecker+Time [2021-11-02 13:33:38,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 318 Unknown, 0 Unchecked, 2.68ms Time], IncrementalHoareTripleChecker [6 Valid, 311 Invalid, 1 Unknown, 0 Unchecked, 4417.92ms Time] [2021-11-02 13:33:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-02 13:33:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-11-02 13:33:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2021-11-02 13:33:38,260 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 81 [2021-11-02 13:33:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:33:38,260 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 200 transitions. [2021-11-02 13:33:38,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2021-11-02 13:33:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:33:38,261 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:33:38,261 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:33:38,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 13:33:38,262 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:33:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:33:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1000620110, now seen corresponding path program 1 times [2021-11-02 13:33:38,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:33:38,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907907335] [2021-11-02 13:33:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:33:38,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:33:38,319 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 13:33:38,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171030906] [2021-11-02 13:33:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:33:38,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:33:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:33:38,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:33:38,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-02 13:33:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:33:39,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 2738 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 13:33:39,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:33:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-02 13:33:39,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 13:33:39,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:33:39,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907907335] [2021-11-02 13:33:39,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 13:33:39,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171030906] [2021-11-02 13:33:39,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171030906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:33:39,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:33:39,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:33:39,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216606143] [2021-11-02 13:33:39,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:33:39,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:33:39,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:33:39,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:33:39,302 INFO L87 Difference]: Start difference. First operand 184 states and 200 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:42,460 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:33:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:33:45,013 INFO L93 Difference]: Finished difference Result 494 states and 532 transitions. [2021-11-02 13:33:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:33:45,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:33:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:33:45,014 INFO L225 Difference]: With dead ends: 494 [2021-11-02 13:33:45,014 INFO L226 Difference]: Without dead ends: 335 [2021-11-02 13:33:45,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 112.99ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:33:45,015 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5055.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.70ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5594.72ms IncrementalHoareTripleChecker+Time [2021-11-02 13:33:45,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 625 Unknown, 0 Unchecked, 4.70ms Time], IncrementalHoareTripleChecker [8 Valid, 616 Invalid, 1 Unknown, 0 Unchecked, 5594.72ms Time] [2021-11-02 13:33:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-02 13:33:45,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 190. [2021-11-02 13:33:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 187 states have (on average 1.1016042780748663) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2021-11-02 13:33:45,025 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 81 [2021-11-02 13:33:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:33:45,026 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2021-11-02 13:33:45,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2021-11-02 13:33:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:33:45,026 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:33:45,027 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:33:45,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-02 13:33:45,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-02 13:33:45,234 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:33:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:33:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -371187188, now seen corresponding path program 1 times [2021-11-02 13:33:45,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:33:45,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490586460] [2021-11-02 13:33:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:33:45,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:33:45,288 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 13:33:45,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513938284] [2021-11-02 13:33:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:33:45,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:33:45,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:33:45,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:33:45,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-02 13:33:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:33:45,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 13:33:45,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:33:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-02 13:33:46,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 13:33:46,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:33:46,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490586460] [2021-11-02 13:33:46,192 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 13:33:46,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513938284] [2021-11-02 13:33:46,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513938284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:33:46,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:33:46,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:33:46,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846960906] [2021-11-02 13:33:46,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:33:46,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:33:46,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:33:46,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:33:46,193 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:49,330 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:33:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:33:51,325 INFO L93 Difference]: Finished difference Result 251 states and 268 transitions. [2021-11-02 13:33:51,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:33:51,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:33:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:33:51,330 INFO L225 Difference]: With dead ends: 251 [2021-11-02 13:33:51,330 INFO L226 Difference]: Without dead ends: 206 [2021-11-02 13:33:51,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 87.70ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:33:51,333 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4580.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.52ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5062.70ms IncrementalHoareTripleChecker+Time [2021-11-02 13:33:51,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 495 Unknown, 0 Unchecked, 1.52ms Time], IncrementalHoareTripleChecker [4 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 5062.70ms Time] [2021-11-02 13:33:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-11-02 13:33:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2021-11-02 13:33:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 173 states have (on average 1.1040462427745665) internal successors, (191), 175 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2021-11-02 13:33:51,346 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 81 [2021-11-02 13:33:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:33:51,347 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2021-11-02 13:33:51,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2021-11-02 13:33:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-02 13:33:51,348 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:33:51,348 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:33:51,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-02 13:33:51,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-02 13:33:51,564 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:33:51,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:33:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 21050970, now seen corresponding path program 1 times [2021-11-02 13:33:51,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:33:51,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953262930] [2021-11-02 13:33:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:33:51,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:33:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:33:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-02 13:33:53,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:33:53,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953262930] [2021-11-02 13:33:53,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953262930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:33:53,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:33:53,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-02 13:33:53,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259029928] [2021-11-02 13:33:53,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 13:33:53,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:33:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 13:33:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-02 13:33:53,261 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:33:56,429 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:34:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:34:03,186 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2021-11-02 13:34:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 13:34:03,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 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-02 13:34:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:34:03,188 INFO L225 Difference]: With dead ends: 199 [2021-11-02 13:34:03,188 INFO L226 Difference]: Without dead ends: 177 [2021-11-02 13:34:03,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3490.60ms TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2021-11-02 13:34:03,189 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6495.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.13ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7177.00ms IncrementalHoareTripleChecker+Time [2021-11-02 13:34:03,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 1088 Unknown, 0 Unchecked, 8.13ms Time], IncrementalHoareTripleChecker [28 Valid, 1059 Invalid, 1 Unknown, 0 Unchecked, 7177.00ms Time] [2021-11-02 13:34:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-02 13:34:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2021-11-02 13:34:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.1015625) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:34:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2021-11-02 13:34:03,197 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 84 [2021-11-02 13:34:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:34:03,197 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2021-11-02 13:34:03,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:34:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2021-11-02 13:34:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-02 13:34:03,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:34:03,199 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:34:03,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 13:34:03,199 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:34:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:34:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1141138372, now seen corresponding path program 1 times [2021-11-02 13:34:03,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:34:03,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83553656] [2021-11-02 13:34:03,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:34:03,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:34:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:34:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-02 13:34:04,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:34:04,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83553656] [2021-11-02 13:34:04,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83553656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:34:04,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:34:04,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:34:04,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475600118] [2021-11-02 13:34:04,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:34:04,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:34:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:34:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:34:04,508 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:34:07,986 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:34:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:34:09,682 INFO L93 Difference]: Finished difference Result 236 states and 252 transitions. [2021-11-02 13:34:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:34:09,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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-02 13:34:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:34:09,683 INFO L225 Difference]: With dead ends: 236 [2021-11-02 13:34:09,683 INFO L226 Difference]: Without dead ends: 131 [2021-11-02 13:34:09,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.25ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:34:09,684 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4587.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.28ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5115.25ms IncrementalHoareTripleChecker+Time [2021-11-02 13:34:09,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 362 Unknown, 0 Unchecked, 2.28ms Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 1 Unknown, 0 Unchecked, 5115.25ms Time] [2021-11-02 13:34:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-02 13:34:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2021-11-02 13:34:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 116 states have (on average 1.0775862068965518) internal successors, (125), 118 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:34:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2021-11-02 13:34:09,691 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 84 [2021-11-02 13:34:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:34:09,691 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2021-11-02 13:34:09,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:34:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2021-11-02 13:34:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-02 13:34:09,692 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:34:09,692 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 13:34:09,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 13:34:09,692 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:34:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:34:09,693 INFO L85 PathProgramCache]: Analyzing trace with hash -57098032, now seen corresponding path program 1 times [2021-11-02 13:34:09,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:34:09,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378273076] [2021-11-02 13:34:09,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:34:09,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:34:09,736 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 13:34:09,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581249269] [2021-11-02 13:34:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:34:09,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:34:09,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:34:09,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:34:09,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-02 13:34:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:34:10,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 2895 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-02 13:34:10,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:34:11,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2021-11-02 13:34:11,953 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 26 treesize of output 22 [2021-11-02 13:34:11,977 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-02 13:34:12,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-02 13:34:12,534 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 13 treesize of output 5 [2021-11-02 13:34:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-02 13:34:13,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 13:34:13,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:34:13,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378273076] [2021-11-02 13:34:13,432 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 13:34:13,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581249269] [2021-11-02 13:34:13,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581249269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:34:13,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:34:13,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-02 13:34:13,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918356965] [2021-11-02 13:34:13,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 13:34:13,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:34:13,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 13:34:13,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:34:13,433 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:34:16,653 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:34:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:34:20,370 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2021-11-02 13:34:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 13:34:20,370 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 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 90 [2021-11-02 13:34:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:34:20,370 INFO L225 Difference]: With dead ends: 119 [2021-11-02 13:34:20,370 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 13:34:20,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3225.46ms TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2021-11-02 13:34:20,371 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4393.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.22ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4876.58ms IncrementalHoareTripleChecker+Time [2021-11-02 13:34:20,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 418 Unknown, 0 Unchecked, 4.22ms Time], IncrementalHoareTripleChecker [23 Valid, 394 Invalid, 1 Unknown, 0 Unchecked, 4876.58ms Time] [2021-11-02 13:34:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 13:34:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 13:34:20,372 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-02 13:34:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 13:34:20,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2021-11-02 13:34:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:34:20,372 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 13:34:20,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:34:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 13:34:20,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 13:34:20,374 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-11-02 13:34:20,375 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-11-02 13:34:20,375 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-11-02 13:34:20,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-02 13:34:20,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:34:20,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 13:34:20,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:20,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:34:24,643 INFO L854 garLoopResultBuilder]: At program point L10044(lines 9999 10046) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset|))) (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0))) [2021-11-02 13:34:24,643 INFO L854 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: false [2021-11-02 13:34:24,643 INFO L854 garLoopResultBuilder]: At program point L10044-2(lines 9999 10046) the Hoare annotation is: false [2021-11-02 13:34:24,643 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,643 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 13:34:24,644 INFO L854 garLoopResultBuilder]: At program point L10044-3(lines 9999 10046) the Hoare annotation is: false [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 13:34:24,644 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,644 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-02 13:34:24,644 INFO L854 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset|))) (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0))) [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-02 13:34:24,644 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-02 13:34:24,644 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-02 13:34:24,644 INFO L854 garLoopResultBuilder]: At program point L10112(lines 10101 10113) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0))) (.cse1 (= (select |#valid| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1)) (.cse2 (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|))) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) (.cse5 (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0))) (.cse6 (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) .cse4 .cse5 (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) .cse6 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0)) (and .cse0 .cse1 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-11-02 13:34:24,644 INFO L854 garLoopResultBuilder]: At program point L10112-1(lines 10101 10113) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-02 13:34:24,644 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L10114(lines 10114 10134) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L7274(lines 7274 7278) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L854 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: false [2021-11-02 13:34:24,645 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,645 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,645 INFO L854 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L854 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: false [2021-11-02 13:34:24,645 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L9291-1(line 9291) no Hoare annotation was computed. [2021-11-02 13:34:24,645 INFO L858 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L10001-2(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L10001-3(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L854 garLoopResultBuilder]: At program point L9291-2(line 9291) the Hoare annotation is: false [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L9291-3(line 9291) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0)) [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L861 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: true [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,646 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L854 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: false [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,647 INFO L858 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L854 garLoopResultBuilder]: At program point L9990-6(lines 9988 9991) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset|))) (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0))) [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9280(lines 9280 9293) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-17(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-19(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L854 garLoopResultBuilder]: At program point L9990-20(lines 9988 9991) the Hoare annotation is: false [2021-11-02 13:34:24,648 INFO L854 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (not (= ULTIMATE.start_aws_hash_table_move_~to.base 0)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= ULTIMATE.start_aws_hash_table_move_~from.base 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-14(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-16(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-26(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L854 garLoopResultBuilder]: At program point L9990-27(lines 9988 9991) the Hoare annotation is: false [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-21(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-23(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,648 INFO L858 garLoopResultBuilder]: For program point L9990-24(line 9990) no Hoare annotation was computed. [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-11-02 13:34:24,649 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: false [2021-11-02 13:34:24,649 INFO L858 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2021-11-02 13:34:24,649 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: false [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-11-02 13:34:24,649 INFO L858 garLoopResultBuilder]: For program point L7267(lines 7267 7272) no Hoare annotation was computed. [2021-11-02 13:34:24,649 INFO L858 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-11-02 13:34:24,649 INFO L858 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: false [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,649 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base| 0)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| |ULTIMATE.start_aws_hash_table_move_harness_~#to~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_move_harness_~#from~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-02 13:34:24,652 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:34:24,653 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 13:34:24,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,689 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:24,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:24,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:24,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:24,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:24,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:24,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:24,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 01:34:24 BoogieIcfgContainer [2021-11-02 13:34:24,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 13:34:24,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 13:34:24,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 13:34:24,717 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 13:34:24,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:32:06" (3/4) ... [2021-11-02 13:34:24,720 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 13:34:24,743 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 187 nodes and edges [2021-11-02 13:34:24,746 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2021-11-02 13:34:24,747 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-02 13:34:24,748 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-02 13:34:24,749 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-02 13:34:24,750 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-02 13:34:24,751 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-02 13:34:24,752 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 13:34:24,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(to == 0) && \valid[from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0) || ((((((((!(to == 0) && \valid[from] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= from) && \result + 1 <= 0) && from == map) && !(from == to)) && !(from == required_bytes)) && !(from == 0)) && from == map) [2021-11-02 13:34:24,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(to == 0) && cond == 1) && \result == 0) && !(\result == 0)) && \result + 1 < from) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && \valid[required_bytes := 0][from] == 1) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0 [2021-11-02 13:34:24,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(to == 0) && \valid[from] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[from][from]][40] + 1 <= 0) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[from][from] + 1 < from) && \result + 1 < from) && from == map) && #memory_$Pointer$[map][map] == 0) && map == 0) && \result == 0) && from == map) && !(from == to)) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && from == map) && #memory_$Pointer$[from][from] == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0 [2021-11-02 13:34:24,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(to == 0) && \valid[from] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[from][from]][40] + 1 <= 0) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[from][from] + 1 < from) && \result == 0) && \result + 1 < from) && from == map) && #memory_$Pointer$[map][map] == 0) && map == 0) && \result == 0) && from == map) && !(from == to)) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && from == map) && #memory_$Pointer$[from][from] == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0 [2021-11-02 13:34:24,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(to == 0) && \valid[from] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[from][from]][40] + 1 <= 0) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[from][from] + 1 < from) && \result + 1 < from) && from == map) && #memory_$Pointer$[map][map] == 0) && map == 0) && from == map) && !(from == to)) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && from == map) && #memory_$Pointer$[from][from] == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0 [2021-11-02 13:34:24,784 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(to == 0) && \result == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && from == map) && !(from == to)) && !(from == 0)) && from == map [2021-11-02 13:34:24,784 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(to == 0) && !(to == 0)) && \result == 0) && !(\result == 0)) && !(from == 0)) && (!(map == 0) || !(map == 0))) && \result == 0) && from == map) && !(from == to)) && !(from == 0)) && from == map [2021-11-02 13:34:25,262 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-02 13:34:25,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 13:34:25,263 INFO L158 Benchmark]: Toolchain (without parser) took 145348.48ms. Allocated memory was 125.8MB in the beginning and 478.2MB in the end (delta: 352.3MB). Free memory was 78.7MB in the beginning and 384.8MB in the end (delta: -306.2MB). Peak memory consumption was 319.8MB. Max. memory is 16.1GB. [2021-11-02 13:34:25,263 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 96.7MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 13:34:25,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2199.29ms. Allocated memory was 125.8MB in the beginning and 201.3MB in the end (delta: 75.5MB). Free memory was 78.4MB in the beginning and 98.2MB in the end (delta: -19.8MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2021-11-02 13:34:25,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 157.13ms. Allocated memory is still 201.3MB. Free memory was 98.2MB in the beginning and 84.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-02 13:34:25,264 INFO L158 Benchmark]: Boogie Preprocessor took 71.75ms. Allocated memory is still 201.3MB. Free memory was 84.6MB in the beginning and 136.3MB in the end (delta: -51.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2021-11-02 13:34:25,264 INFO L158 Benchmark]: RCFGBuilder took 4352.08ms. Allocated memory was 201.3MB in the beginning and 398.5MB in the end (delta: 197.1MB). Free memory was 136.3MB in the beginning and 278.0MB in the end (delta: -141.6MB). Peak memory consumption was 245.3MB. Max. memory is 16.1GB. [2021-11-02 13:34:25,264 INFO L158 Benchmark]: TraceAbstraction took 138016.23ms. Allocated memory was 398.5MB in the beginning and 478.2MB in the end (delta: 79.7MB). Free memory was 278.0MB in the beginning and 315.7MB in the end (delta: -37.7MB). Peak memory consumption was 232.5MB. Max. memory is 16.1GB. [2021-11-02 13:34:25,265 INFO L158 Benchmark]: Witness Printer took 545.56ms. Allocated memory is still 478.2MB. Free memory was 315.7MB in the beginning and 384.8MB in the end (delta: -69.1MB). Peak memory consumption was 204.5MB. Max. memory is 16.1GB. [2021-11-02 13:34:25,266 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.44ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 96.7MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2199.29ms. Allocated memory was 125.8MB in the beginning and 201.3MB in the end (delta: 75.5MB). Free memory was 78.4MB in the beginning and 98.2MB in the end (delta: -19.8MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 157.13ms. Allocated memory is still 201.3MB. Free memory was 98.2MB in the beginning and 84.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.75ms. Allocated memory is still 201.3MB. Free memory was 84.6MB in the beginning and 136.3MB in the end (delta: -51.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 4352.08ms. Allocated memory was 201.3MB in the beginning and 398.5MB in the end (delta: 197.1MB). Free memory was 136.3MB in the beginning and 278.0MB in the end (delta: -141.6MB). Peak memory consumption was 245.3MB. Max. memory is 16.1GB. * TraceAbstraction took 138016.23ms. Allocated memory was 398.5MB in the beginning and 478.2MB in the end (delta: 79.7MB). Free memory was 278.0MB in the beginning and 315.7MB in the end (delta: -37.7MB). Peak memory consumption was 232.5MB. Max. memory is 16.1GB. * Witness Printer took 545.56ms. Allocated memory is still 478.2MB. Free memory was 315.7MB in the beginning and 384.8MB in the end (delta: -69.1MB). Peak memory consumption was 204.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 117 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 137895.45ms, OverallIterations: 18, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 25.85ms, AutomataDifference: 111441.68ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 4062.38ms, InitialAbstractionConstructionTime: 9.22ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 3119 SdHoareTripleChecker+Valid, 91670.78ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3119 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 83353.71ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7198 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12353 IncrementalHoareTripleChecker+Invalid, 12705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 0 mSDtfsCounter, 12353 mSolverCounterSat, 136.93ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 919 GetRequests, 657 SyntacticMatches, 2 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 24460.36ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=14, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 140.21ms AutomataMinimizationTime, 18 MinimizatonAttempts, 638 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 37 LocationsWithAnnotation, 37 PreInvPairs, 55 NumberOfFragments, 1060 HoareAnnotationTreeSize, 37 FomulaSimplifications, 2529 FormulaSimplificationTreeSizeReduction, 95.67ms HoareSimplificationTime, 37 FomulaSimplificationsInter, 323 FormulaSimplificationTreeSizeReductionInter, 3953.31ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 836.38ms SsaConstructionTime, 6333.58ms SatisfiabilityAnalysisTime, 12298.55ms InterpolantComputationTime, 1434 NumberOfCodeBlocks, 1430 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1554 ConstructedInterpolants, 0 QuantifiedInterpolants, 5949 SizeOfPredicates, 62 NumberOfNonLiveVariables, 18710 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 348/380 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[elemsize := 0][from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[elemsize := 0][from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((((!(to == 0) && \valid[from] == 1) && from == map) && !(from == to)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[elemsize := 0][from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[elemsize := 0][from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && !(to == 0)) && \result == 0) && !(\result == 0)) && !(from == 0)) && (!(map == 0) || !(map == 0))) && \result == 0) && from == map) && !(from == to)) && !(from == 0)) && from == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-11-02 13:34:25,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:25,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:25,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((!(to == 0) && \valid[from] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[from][from]][40] + 1 <= 0) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[from][from] + 1 < from) && \result + 1 < from) && from == map) && #memory_$Pointer$[map][map] == 0) && map == 0) && from == map) && !(from == to)) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && from == map) && #memory_$Pointer$[from][from] == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[elemsize := 0][from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9999]: Loop Invariant [2021-11-02 13:34:25,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:25,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:25,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((!(to == 0) && \valid[from] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[from][from]][40] + 1 <= 0) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[from][from] + 1 < from) && \result + 1 < from) && from == map) && #memory_$Pointer$[map][map] == 0) && map == 0) && \result == 0) && from == map) && !(from == to)) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && from == map) && #memory_$Pointer$[from][from] == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[elemsize := 0][from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[elemsize := 0][from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: (((((((((((((!(to == 0) && cond == 1) && \result == 0) && !(\result == 0)) && \result + 1 < from) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && \valid[required_bytes := 0][from] == 1) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9291]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-02 13:34:25,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:25,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:34:25,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:34:25,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((!(to == 0) && \valid[from] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[from][from]][40] + 1 <= 0) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[from][from] + 1 < from) && \result == 0) && \result + 1 < from) && from == map) && #memory_$Pointer$[map][map] == 0) && map == 0) && \result == 0) && from == map) && !(from == to)) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && from == map) && #memory_$Pointer$[from][from] == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[from] == 1) && cond == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((((((!(to == 0) && \result == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && from == map) && !(from == to)) && !(from == 0)) && from == map - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((((((((((!(to == 0) && \valid[from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0) && \result == 0) || ((((((((!(to == 0) && \valid[from] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= from) && \result + 1 <= 0) && from == map) && !(from == to)) && !(from == required_bytes)) && !(from == 0)) && from == map) - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: (((((((((!(to == 0) && \valid[elemsize := 0][from] == 1) && from == map) && !(from == to)) && num_entries + 1 <= 0) && !(from == required_bytes)) && !(from == 0)) && from == 0) && from == map) && unknown-#StackHeapBarrier-unknown < from) && max_table_entries + 1 <= 0 RESULT: Ultimate proved your program to be correct! [2021-11-02 13:34:25,506 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-02 13:34:25,553 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